Two error bounds for constrained optimization problems and their applications

DOI10.1007/s00245-007-9023-8zbMath1173.65045OpenAlexW2047074228MaRDI QIDQ1021250

Chang-Yu Wang, Wen-Ling Zhao, Zhang, Jianzhong

Publication date: 8 June 2009

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00245-007-9023-8

zbMATH Keywords

constrained optimizationerror boundnonlinear programmingvalue functiontrust region methodfinite terminationprojected gradientKuhn-Tucker pointTrust region subproblem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51) Semi-infinite programming (90C34)

Related Items

Global convergence and finite termination of a class of smooth penalty function algorithms ⋮ Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence properties of nonmonotone spectral projected gradient methods
• Projected quasi-Newton algorithm with trust region for constrained optimization
• Approximate solution of the trust region problem by minimization over two-dimensional subspaces
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• A general descent framework for the monotone variational inequality problem
• Unconstrained optimization reformulations of variational inequality problems
• Global \(s\)-type error bound for the extended linear complementarity problem and applications.
• Local convergence analysis of projection-type algorithms: unified approach
• Some methods based on the D-gap function for solving monotone variational inequalities
• Equivalent Unconstrained Minimization and Global Error Bounds for Variational Inequality Problems
• Weak Sharp Minima in Mathematical Programming
• On the global convergence of trust region algorithms for unconstrained minimization
• A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
• Conditions for convergence of trust region algorithms for nonsmooth optimization
• On the superlinear convergence of a trust region algorithm for nonsmooth optimization
• 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
• Automatic Determination of an Initial Trust Region in Nonlinear Programming
• Trust Region Methods
• Nondegenerate Solutions and Related Concepts in Affine Variational Inequalities

This page was built for publication: Two error bounds for constrained optimization problems and their applications