Soon-Yi Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Soon-Yi Wu has a total of 56 co-authors. Here are the top co-authors by number of shared publications:
- Liqun Qi
Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
6 shared publications - Yunhai Xiao
Center for Applied Mathematics of Henan Province, Henan University, Zhengzhou, China
6 shared publications - Shu-Cherng Fang
North Carolina State University
4 shared publications - Liping Zhang
Department of Mathematical Sciences, Tsinghua University, Beijing, China
3 shared publications - Kok Lay Teo
School of Mathematical Sciences, Sunway University, Bandar Sunway, Selangor Darul Ehsan, Malaysia
2 shared publications - Ruey-Lin Sheu
Department of Mathematics, National Cheng Kung University, Tainan, Taiwan
2 shared publications
Latest Publications
- 10 December 2020
- Published by Wiley in International Transactions in Operational Research
- Vol. 29 (1) , 130-157
A modified exchange algorithm for distributional robust optimization and applications in risk management
Convex semi‐definite semi‐infinite programming problems (SDSIP) represent a special class of distributionally robust optimization (DRO) problems with a wide range of applications in engineering and economics. In this paper, we propose a modified exchange algorithm for convex SDSIP that arises from DRO with matrix moment constraints. We first explore the convergence results of the modified exchange algorithm and perform the efficiency analysis based on a set of benchmark tests. In addition, we apply the SDSIP framework to investigate an optimized certainty bound risk with an ambiguity uncertainty set and implement the algorithm to solve a practical risk minimization problem in portfolio selection. The empirical results show both the efficiency of the algorithm and the robustness of the risk measure.
- 10 December 2020
- Published by Wiley in International Transactions in Operational Research
- Vol. 29 (1) , 130-157
A modified exchange algorithm for distributional robust optimization and applications in risk management
Convex semi‐definite semi‐infinite programming problems (SDSIP) represent a special class of distributionally robust optimization (DRO) problems with a wide range of applications in engineering and economics. In this paper, we propose a modified exchange algorithm for convex SDSIP that arises from DRO with matrix moment constraints. We first explore the convergence results of the modified exchange algorithm and perform the efficiency analysis based on a set of benchmark tests. In addition, we apply the SDSIP framework to investigate an optimized certainty bound risk with an ambiguity uncertainty set and implement the algorithm to solve a practical risk minimization problem in portfolio selection. The empirical results show both the efficiency of the algorithm and the robustness of the risk measure.
- 22 January 2018
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 37 (10) , 4279-4294
Design of Sparse Filters by a Discrete Filled Function Technique
- 22 January 2018
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 37 (10) , 4279-4294
Design of Sparse Filters by a Discrete Filled Function Technique
- 15 December 2015
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 68 (2) , 573-595
Computation Algorithm for Convex Semi-infinite Program with Second-Order Cones: Special Analyses for Affine and Quadratic Case
- 15 December 2015
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 68 (2) , 573-595
Computation Algorithm for Convex Semi-infinite Program with Second-Order Cones: Special Analyses for Affine and Quadratic Case
- 11 July 2014
- Published by Springer Nature in Journal of Global Optimization
- Vol. 62 (4) , 751-762
Norm descent conjugate gradient methods for solving symmetric nonlinear equations
- 11 July 2014
- Published by Springer Nature in Journal of Global Optimization
- Vol. 62 (4) , 751-762
Norm descent conjugate gradient methods for solving symmetric nonlinear equations
- 19 March 2014
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 59 (3) , 591-616
Solving semi-infinite programs by smoothing projected gradient method
- 19 March 2014
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 59 (3) , 591-616
Solving semi-infinite programs by smoothing projected gradient method
- 11 January 2014
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 61 (1) , 17-41
Nonmonotone Barzilai–Borwein Gradient Algorithm for $\ell _{1}$ ℓ 1 -Regularized Nonsmooth Minimization in Compressive Sensing- 11 January 2014
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 61 (1) , 17-41
Nonmonotone Barzilai–Borwein Gradient Algorithm for $\ell _{1}$ ℓ 1 -Regularized Nonsmooth Minimization in Compressive Sensing- 18 November 2012
- Published by Springer Nature in Science China Mathematics
- Vol. 56 (1) , 201-211
An entropy based central cutting plane algorithm for convex min-max semi-infinite programming problems
- 18 November 2012
- Published by Springer Nature in Science China Mathematics
- Vol. 56 (1) , 201-211
An entropy based central cutting plane algorithm for convex min-max semi-infinite programming problems
- 20 October 2012
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 158 (1) , 216-233
Convergence Analysis of the Gauss–Newton-Type Method for Lipschitz-Like Mappings
- 20 October 2012
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 158 (1) , 216-233
Convergence Analysis of the Gauss–Newton-Type Method for Lipschitz-Like Mappings
- Open Access
Nonmonotone Barzilai-Borwein Gradient Algorithm for $\ell_1$-Regularized Nonsmooth Minimization in Compressive Sensing
This paper is devoted to minimizing the sum of a smooth function and a nonsmooth $\ell_1$-regularized term. This problem as a special cases includes the $\ell_1$-regularized convex minimization problem in signal processing, compressive sensing, machine learning, data mining, etc. However, the non-differentiability of the $\ell_1$-norm causes more challenging especially in large problems encountered in many practical applications. This paper proposes, analyzes, and tests a Barzilai-Borwein gradient algorithm. At each iteration, the generated search direction enjoys descent property and can be easily derived by minimizing a local approximal quadratic model and simultaneously taking the favorable structure of the $\ell_1$-norm. Moreover, a nonmonotone line search technique is incorporated to find a suitable stepsize along this direction. The algorithm is easily performed, where the values of the objective function and the gradient of the smooth term are required at per-iteration. Under some conditions, the proposed algorithm is shown to be globally convergent. The limited experiments by using some nonconvex unconstrained problems from CUTEr library with additive $\ell_1$-regularization illustrate that the proposed algorithm performs quite well. Extensive experiments for $\ell_1$-regularized least squares problems in compressive sensing verify that our algorithm compares favorably with several state-of-the-art algorithms which are specifically designed in recent years.
Open AccessNonmonotone Barzilai-Borwein Gradient Algorithm for $\ell_1$-Regularized Nonsmooth Minimization in Compressive Sensing
This paper is devoted to minimizing the sum of a smooth function and a nonsmooth $\ell_1$-regularized term. This problem as a special cases includes the $\ell_1$-regularized convex minimization problem in signal processing, compressive sensing, machine learning, data mining, etc. However, the non-differentiability of the $\ell_1$-norm causes more challenging especially in large problems encountered in many practical applications. This paper proposes, analyzes, and tests a Barzilai-Borwein gradient algorithm. At each iteration, the generated search direction enjoys descent property and can be easily derived by minimizing a local approximal quadratic model and simultaneously taking the favorable structure of the $\ell_1$-norm. Moreover, a nonmonotone line search technique is incorporated to find a suitable stepsize along this direction. The algorithm is easily performed, where the values of the objective function and the gradient of the smooth term are required at per-iteration. Under some conditions, the proposed algorithm is shown to be globally convergent. The limited experiments by using some nonconvex unconstrained problems from CUTEr library with additive $\ell_1$-regularization illustrate that the proposed algorithm performs quite well. Extensive experiments for $\ell_1$-regularized least squares problems in compressive sensing verify that our algorithm compares favorably with several state-of-the-art algorithms which are specifically designed in recent years.
- 21 March 2012
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 54 (2) , 441-459
Primal and dual alternating direction algorithms for ℓ 1-ℓ 1-norm minimization problems in compressive sensing
- 21 March 2012
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 54 (2) , 441-459
Primal and dual alternating direction algorithms for ℓ 1-ℓ 1-norm minimization problems in compressive sensing