Error Bounds and Finite Termination for Constrained Optimization Problems
Authors:
Open Access
- 1 January 2014
- journal article
- research article
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2014 (1)
Abstract
We present a global error bound for the projected gradient of nonconvex constrained optimization problems and a local error bound for the distance from a feasible solution to the optimal solution set of convex constrained optimization problems, by using the merit function involved in the sequential quadratic programming (SQP) method. For the solution sets (stationary points set and KKT points set) of nonconvex constrained optimization problems, we establish the definitions of generalized nondegeneration and generalized weak sharp minima. Based on the above, the necessary and sufficient conditions for a feasible solution of the nonconvex constrained optimization problems to terminate finitely at the two solutions are given, respectively. Accordingly, the results in this paper improve and popularize existing results known in the literature. Further, we utilize the global error bound for the projected gradient with the merit function being computed easily to describe these necessary and sufficient conditions.Keywords
Funding Information
- National Natural Science Foundation of China (11271233, 10971118, ZR2012AM016)
- National Natural Science Foundation of China (11271233, 10971118, ZR2012AM016)
- Natural Science Foundation of Shandong Province (11271233, 10971118, ZR2012AM016)
This publication has 26 references indexed in Scilit:
- A note on finite termination of iterative algorithms in mathematical programmingOperations Research Letters, 2008
- Armijo Newton method for convex best interpolationOptimization Methods and Software, 2006
- Convergence properties of nonmonotone spectral projected gradient methodsJournal of Computational and Applied Mathematics, 2005
- On the finite convergence of successive SDP relaxation methodsEuropean Journal of Operational Research, 2002
- Weak Sharp Solutions of Variational InequalitiesSIAM Journal on Optimization, 1998
- Equivalent Unconstrained Minimization and Global Error Bounds for Variational Inequality ProblemsSIAM Journal on Control and Optimization, 1997
- Nondegenerate Solutions and Related Concepts in Affine Variational InequalitiesSIAM Journal on Control and Optimization, 1996
- On the Boundedness and Stability of Solutions to the Affine Variational Inequality ProblemSIAM Journal on Control and Optimization, 1994
- Weak Sharp Minima in Mathematical ProgrammingSIAM Journal on Control and Optimization, 1993
- Variational principles for variational inequalitiesNumerical Functional Analysis and Optimization, 1989