Wenyu Sun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wenyu Sun has a total of 41 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
7 shared publications - Dan Xue
Nanjing Normal University
3 shared publications - Raimundo J. B. de Sampaio
Pontifical Catholic University of Panara (PUCPR)
3 shared publications - Zhongyi Liu
Hohai University
3 shared publications - Chengjin Li
Nanjing Normal University
2 shared publications - Chuangyin Dang
Department of Systems Engineering, City University of Hong Kong, Kowloon, Hong Kong
2 shared publications
Latest Publications
- 28 January 2020
- Published by Springer Nature in Journal of Global Optimization
- Vol. 76 (4) , 841-861
A derivative-free algorithm for spherically constrained optimization
- 28 January 2020
- Published by Springer Nature in Journal of Global Optimization
- Vol. 76 (4) , 841-861
A derivative-free algorithm for spherically constrained optimization
- 1 January 2020
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 10 (4) , 537-555
Survey of derivative-free optimization
In this survey paper we present an overview of derivative-free optimization, including basic concepts, theories, derivative-free methods and some applications. To date, there are mainly three classes of derivative-free methods and we concentrate on two of them, they are direct search methods and model-based methods. In this paper, we first focus on unconstrained optimization problems and review some classical direct search methods and model-based methods in turn for these problems. Then, we survey a number of derivative-free approaches for problems with constraints, including an algorithm we proposed for spherical optimization recently.
- 1 January 2020
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 10 (4) , 537-555
Survey of derivative-free optimization
In this survey paper we present an overview of derivative-free optimization, including basic concepts, theories, derivative-free methods and some applications. To date, there are mainly three classes of derivative-free methods and we concentrate on two of them, they are direct search methods and model-based methods. In this paper, we first focus on unconstrained optimization problems and review some classical direct search methods and model-based methods in turn for these problems. Then, we survey a number of derivative-free approaches for problems with constraints, including an algorithm we proposed for spherical optimization recently.
- 1 April 2019
- Published by Elsevier in Signal Processing: Image Communication
- Vol. 73, 3-11
On semi-definiteness and minimal H-eigenvalue of a symmetric space tensor using nonnegative polynomial optimization techniques
- 1 April 2019
- Published by Elsevier in Signal Processing: Image Communication
- Vol. 73, 3-11
On semi-definiteness and minimal H-eigenvalue of a symmetric space tensor using nonnegative polynomial optimization techniques
- 29 July 2016
- Published by Springer Nature in Science China Mathematics
- Vol. 59 (11) , 2265-2280
A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization
- 29 July 2016
- Published by Springer Nature in Science China Mathematics
- Vol. 59 (11) , 2265-2280
A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization
- Open Access
- 1 January 2015
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 5 (2) , 169-184
A wedge trust region method with self-correcting geometry for derivative-free optimization
- 1 January 2015
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 5 (2) , 169-184
Open AccessA wedge trust region method with self-correcting geometry for derivative-free optimization
- 19 May 2014
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 84 (291) , 187-208
A dwindling filter line search method for unconstrained optimization
A dwindling multidimensional filter is proposed and applied to a second-order line search framework for unconstrained optimization. Usually, the multidimensional filter is built up with a fixed envelope, which is not well-suited to line search frameworks. In this paper, we propose the dwindling multidimensional filter, whose envelope is dwindling as the step-length of line search decreasing. Combining the dwindling multidimensional filter and a second-order line search, the new algorithm globally converges to a second-order critical point, when the negative curvature direction is exploited. Detailed numerical results on small and large CUTE test problems indicate that the new algorithm is more competitive than some classical line search methods.
- 19 May 2014
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 84 (291) , 187-208
A dwindling filter line search method for unconstrained optimization
A dwindling multidimensional filter is proposed and applied to a second-order line search framework for unconstrained optimization. Usually, the multidimensional filter is built up with a fixed envelope, which is not well-suited to line search frameworks. In this paper, we propose the dwindling multidimensional filter, whose envelope is dwindling as the step-length of line search decreasing. Combining the dwindling multidimensional filter and a second-order line search, the new algorithm globally converges to a second-order critical point, when the negative curvature direction is exploited. Detailed numerical results on small and large CUTE test problems indicate that the new algorithm is more competitive than some classical line search methods.
- 21 April 2014
- Published by Springer Nature in Frontiers of Mathematics in China
- Vol. 9 (5) , 1211-1238
Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization
- 21 April 2014
- Published by Springer Nature in Frontiers of Mathematics in China
- Vol. 9 (5) , 1211-1238
Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization
- 17 September 2013
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 57 (2) , 365-386
An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
- 17 September 2013
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 57 (2) , 365-386
An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
- 1 August 2013
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 28 (4) , 725-742
A hybrid splitting method for variational inequality problems with separable structure
Alternating direction method (ADM), which decomposes a large-scale original variational inequality (VI) problem into a series of smaller scale subproblems, is very attractive for solving a class of VI problems with a separable structure. This type of method can greatly improve the efficiency, but cannot avoid solving VI subproblems. In this paper, we propose a hybrid splitting method with variable parameters for separable VI problems. Specifically, the proposed method solves only one strongly monotone VI subproblem and a well-posed system of nonlinear equations in each iteration. The global convergence of the new method is established under some standard assumptions as those in classical ADMs. Finally, some preliminary numerical results show that the proposed method performs favourably in practice.
- 1 August 2013
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 28 (4) , 725-742
A hybrid splitting method for variational inequality problems with separable structure
Alternating direction method (ADM), which decomposes a large-scale original variational inequality (VI) problem into a series of smaller scale subproblems, is very attractive for solving a class of VI problems with a separable structure. This type of method can greatly improve the efficiency, but cannot avoid solving VI subproblems. In this paper, we propose a hybrid splitting method with variable parameters for separable VI problems. Specifically, the proposed method solves only one strongly monotone VI subproblem and a well-posed system of nonlinear equations in each iteration. The global convergence of the new method is established under some standard assumptions as those in classical ADMs. Finally, some preliminary numerical results show that the proposed method performs favourably in practice.
- 26 June 2013
- Published by Springer Nature in Science China Mathematics
- Vol. 57 (6) , 1287-1302
On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure
- 26 June 2013
- Published by Springer Nature in Science China Mathematics
- Vol. 57 (6) , 1287-1302
On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure