Shuang Lin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Shuang Lin has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Jie Zhang
School of Mathematics, Liaoning Normal University, Dalian 116029, China
3 shared publications - Chen Qiu
School of Mathematics, Liaoning Normal University, Dalian 116035, China
2 shared publications - Yanan Wang
Mathematics Teaching and Research Office, Dalian Vocational and Technical College, Dalian 116035, China
1 shared publication - Yifei Wang
School of Mathematics, Liaoning Normal University, Dalian 116029, China
1 shared publication
Latest Publications
- Open Access
Reformulation and Enhancement of Distributed Robust Optimization Framework Incorporating Decision-Adaptive Uncertainty Sets
Distributionally robust optimization (DRO) is an advanced framework within the realm of optimization theory that addresses scenarios where the underlying probability distribution governing the data is uncertain or ambiguous. In this paper, we introduce a novel class of DRO challenges where the probability distribution of random variables is contingent upon the decision variables, and the ambiguity set is defined through parameterization involving the mean and a covariance matrix, which also depend on the decision variables. This dependency makes DRO difficult to solve directly; therefore, first, we demonstrate that under the condition of a full-space support set, the original problem can be reduced to a second-order cone programming (SOCP) problem. Subsequently, we solve this second-order cone programming problem using a projection differential equation approach. Compared with the traditional methods, the differential equation method offers advantages in providing continuous and smooth solutions, offering inherent stability analysis, and possessing a rich mathematical toolbox, which make the differential equation a powerful and versatile tool for addressing complex optimization challenges.
Open AccessReformulation and Enhancement of Distributed Robust Optimization Framework Incorporating Decision-Adaptive Uncertainty Sets
Distributionally robust optimization (DRO) is an advanced framework within the realm of optimization theory that addresses scenarios where the underlying probability distribution governing the data is uncertain or ambiguous. In this paper, we introduce a novel class of DRO challenges where the probability distribution of random variables is contingent upon the decision variables, and the ambiguity set is defined through parameterization involving the mean and a covariance matrix, which also depend on the decision variables. This dependency makes DRO difficult to solve directly; therefore, first, we demonstrate that under the condition of a full-space support set, the original problem can be reduced to a second-order cone programming (SOCP) problem. Subsequently, we solve this second-order cone programming problem using a projection differential equation approach. Compared with the traditional methods, the differential equation method offers advantages in providing continuous and smooth solutions, offering inherent stability analysis, and possessing a rich mathematical toolbox, which make the differential equation a powerful and versatile tool for addressing complex optimization challenges.
- Open Access
- 20 May 2024
- Published by Wiley in Journal of Mathematics
- Vol. 2024, 1-10
A Neural Network Based on a Nonsmooth Equation for a Box Constrained Variational Inequality Problem
The variational inequality framework holds significant prominence across various domains including economic finance, network transportation, and game theory. In addition, a novel approach utilizing a neural network model is introduced in the current work to address a box constrained variational inequality problem. Initially, the original problem is reformulated into a nonsmooth equation, following which the neural network model is meticulously devised to tackle this reformulated equation. This study comprehensively investigated inherent characteristics and properties of this neural network model. In addition, employing the Lyapunov function method, stability analysis of the neural network model proposed is rigorously demonstrated in the Lyapunov sense. Furthermore, the efficacy of the proposed technique is substantiated through numerical simulations, providing empirical support for its applicability and effectiveness.
- 20 May 2024
- Published by Wiley in Journal of Mathematics
- Vol. 2024, 1-10
Open AccessA Neural Network Based on a Nonsmooth Equation for a Box Constrained Variational Inequality Problem
The variational inequality framework holds significant prominence across various domains including economic finance, network transportation, and game theory. In addition, a novel approach utilizing a neural network model is introduced in the current work to address a box constrained variational inequality problem. Initially, the original problem is reformulated into a nonsmooth equation, following which the neural network model is meticulously devised to tackle this reformulated equation. This study comprehensively investigated inherent characteristics and properties of this neural network model. In addition, employing the Lyapunov function method, stability analysis of the neural network model proposed is rigorously demonstrated in the Lyapunov sense. Furthermore, the efficacy of the proposed technique is substantiated through numerical simulations, providing empirical support for its applicability and effectiveness.
- Open Access
- 16 January 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (2) , 482
Asymptotic Analysis for One-Stage Stochastic Linear Complementarity Problems and Applications
One-stage stochastic linear complementarity problem (SLCP) is a special case of a multi-stage stochastic linear complementarity problem, which has important applications in economic engineering and operations management. In this paper, we establish asymptotic analysis results of a sample-average approximation (SAA) estimator for the SLCP. The asymptotic normality analysis results for the stochastic-constrained optimization problem are extended to the SLCP model and then the conditions, which ensure the convergence in distribution of the sample-average approximation estimator for the SLCP to multivariate normal with zero mean vector and a covariance matrix, are obtained. The results obtained are finally applied for estimating the confidence region of a solution for the SLCP.
- 16 January 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (2) , 482
Open AccessAsymptotic Analysis for One-Stage Stochastic Linear Complementarity Problems and Applications
One-stage stochastic linear complementarity problem (SLCP) is a special case of a multi-stage stochastic linear complementarity problem, which has important applications in economic engineering and operations management. In this paper, we establish asymptotic analysis results of a sample-average approximation (SAA) estimator for the SLCP. The asymptotic normality analysis results for the stochastic-constrained optimization problem are extended to the SLCP model and then the conditions, which ensure the convergence in distribution of the sample-average approximation estimator for the SLCP to multivariate normal with zero mean vector and a covariance matrix, are obtained. The results obtained are finally applied for estimating the confidence region of a solution for the SLCP.