Error bounds and finite termination for constrained optimization problems

DOI10.1155/2014/158780zbMath1407.90350OpenAlexW1975067702WikidataQ59063352 ScholiaQ59063352MaRDI QIDQ1717787

Bingzhuang Liu, Wen-Ling Zhao, Dao Jin Song

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/158780

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Methods of successive quadratic programming type (90C55)

Cites Work

• Convergence properties of nonmonotone spectral projected gradient methods
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• A structured reduced sequential quadratic programming and its application to a shape design problem
• Superlinear convergence of a stabilized SQP method to a degenerate solution
• Stabilized sequential quadratic programming
• A general descent framework for the monotone variational inequality problem
• Unconstrained optimization reformulations of variational inequality problems
• Efficient sequential quadratic programming implementations for equality-constrained discrete-time optimal control
• A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
• Global \(s\)-type error bound for the extended linear complementarity problem and applications.
• Local convergence analysis of projection-type algorithms: unified approach
• A robust sequential quadratic programming method
• Some methods based on the D-gap function for solving monotone variational inequalities
• On the finite convergence of successive SDP relaxation methods
• Hybrid approach with active set identification for mathematical programs with complementarity constraints
• A note on finite termination of iterative algorithms in mathematical programming
• Equivalent Unconstrained Minimization and Global Error Bounds for Variational Inequality Problems
• Weak Sharp Minima in Mathematical Programming
• Projected gradient methods for linearly constrained problems
• Variational principles for variational inequalities
• Weak Sharp Solutions of Variational Inequalities
• On the Boundedness and Stability of Solutions to the Affine Variational Inequality Problem
• Nondegenerate Solutions and Related Concepts in Affine Variational Inequalities
• Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
• Armijo Newton method for convex best interpolation
• Global projection-type error bounds for general variational inequalities

This page was built for publication: Error bounds and finite termination for constrained optimization problems