Sort:
Open Access Research Article Issue
An integrated group decision-making technique under interval-valued probabilistic linguistic T-spherical fuzzy information and its application to the selection of cloud storage provider
AIMS Mathematics 2023, 8(9): 20223-20253
Published: 15 September 2023
Abstract PDF (692.9 KB) Collect
Downloads:7

Cloud storage is crucial in today's digital era due to its accessibility, scalability, cost savings, collaboration and enhanced security features. The selection of a reliable cloud storage provider is a significant multi-attribute group decision-making (MAGDM) problem that involves intrinsic relationships among the various alternatives, attributes and decision DMs. Due to the uncertain and incomplete nature of the evaluation data for cloud storage providers, i.e., quality of service and user feedback, the identification of appropriate cloud storage providers with accurate service ranking remains an open research challenge. To address the above-mentioned challenge, this work proposes the concept of interval-valued probabilistic linguistic T-spherical fuzzy set (IVPLt-SFS). Then, some basic operations and a score function are defined to compare two or more IVPLt-SF numbers (IVPLt-SFNs). For information fusion, two aggregation operators for IVPLt-SFN are also developed. Next, an extended TOPSIS method-based group decision-making technique under interval-valued probabilistic linguistic T-spherical fuzzy information is established to solve the MAGDM problem. Finally, a numerical example is given to illustrate the practicability and usefulness of the designed approach and its suitability as a decision-making tool for selecting a cloud storage provider. Comparative and sensitivity analysis confirmed that this paper enriches the theory and methodology of the selection problem of cloud storage provider and MAGDM analysis.

Open Access Research Article Issue
A Novel Non-Parameter Filled Function Method for Discrete Global Optimization and Its Application
Tsinghua Science and Technology 2027, 32(1): 235-243
Published: 26 September 2025
Abstract PDF (918.9 KB) Collect
Downloads:61

For the solution of a type of discrete global optimization problems, we provide a unique non-parameter filled function. A relevant solution algorithm that combines the discrete steepest approach with numerical and theoretical characterization of the suggested filled function is created. The suggested approach is a global optimization technique that revises the objective function into a filled function through optimizing a filled function built on earlier found minimum points to find better local minimum points step by step. A global minimum point can be derived through iterating over these programs. The numerical outcomes generated demonstrate the effectiveness of the filled function method. Moreover, we verify that the presented method is promising through the application of the filled function to the assignment problem.

Open Access Issue
A Variance Reducing Stochastic Proximal Method with Acceleration Techniques
Tsinghua Science and Technology 2023, 28(6): 999-1008
Published: 28 July 2023
Abstract PDF (9.1 MB) Collect
Downloads:233

We consider a fundamental problem in the field of machine learning—structural risk minimization, which can be represented as the average of a large number of smooth component functions plus a simple and convex (but possibly non-smooth) function. In this paper, we propose a novel proximal variance reducing stochastic method building on the introduced Point-SAGA. Our method achieves two proximal operator calculations by combining the fast Douglas–Rachford splitting and refers to the scheme of the FISTA algorithm in the choice of momentum factors. We show that the objective function value converges to the iteration point at the rate of 𝒪⁢(1/k) when each loss function is convex and smooth. In addition, we prove that our method achieves a linear convergence rate for strongly convex and smooth loss functions. Experiments demonstrate the effectiveness of the proposed algorithm, especially when the loss function is ill-conditioned with good acceleration.

Total 3