Error bounds and finite termination for constrained optimization problems
Summary: 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 \(K K T\) 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.
- Two error bounds for constrained optimization problems and their applications
- Error bounds and multipliers in constrained optimization problems with tolerance
- scientific article; zbMATH DE number 5283371
- Error bounds for rank constrained optimization problems and applications
- Error bounds for initial value problems by optimization
- Error bounds for mixed integer nonlinear optimization problems
- Convergence and error bound for perturbation of linear programs
- scientific article; zbMATH DE number 1306972
- Error bounds for mixed integer linear optimization problems
- scientific article; zbMATH DE number 841069
- A general descent framework for the monotone variational inequality problem
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- A note on finite termination of iterative algorithms in mathematical programming
- A robust sequential quadratic programming method
- A structured reduced sequential quadratic programming and its application to a shape design problem
- Armijo Newton method for convex best interpolation
- Convergence properties of nonmonotone spectral projected gradient methods
- Efficient sequential quadratic programming implementations for equality-constrained discrete-time optimal control
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Equivalent Unconstrained Minimization and Global Error Bounds for Variational Inequality Problems
- Global s-type error bound for the extended linear complementarity problem and applications.
- Global projection-type error bounds for general variational inequalities
- Hybrid approach with active set identification for mathematical programs with complementarity constraints
- Local convergence analysis of projection-type algorithms: unified approach
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Nondegenerate Solutions and Related Concepts in Affine Variational Inequalities
- On the Boundedness and Stability of Solutions to the Affine Variational Inequality Problem
- On the finite convergence of successive SDP relaxation methods
- Projected gradient methods for linearly constrained problems
- Some methods based on the D-gap function for solving monotone variational inequalities
- Stabilized sequential quadratic programming
- Superlinear convergence of a stabilized SQP method to a degenerate solution
- Unconstrained optimization reformulations of variational inequality problems
- Variational principles for variational inequalities
- Weak Sharp Minima in Mathematical Programming
- Weak Sharp Solutions of Variational Inequalities
- Two error bounds for constrained optimization problems and their applications
- Computable error bounds for an optimization problem with parallelepiped constraint
- A global error bound via the SQP method for constrained optimization problem
- scientific article; zbMATH DE number 5283371 (Why is no real title available?)
- scientific article; zbMATH DE number 5704141 (Why is no real title available?)
- Optimal bounds for round-off errors in the cyclic peaceman-rachford iteration
- A global dual error bound and its application to the analysis of linearly constrained nonconvex optimization
- Stopping rules and backward error analysis for bound-constrained optimization
- Error bounds for initial value problems by optimization
This page was built for publication: Error bounds and finite termination for constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1717787)
