Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions

DOI10.1007/S10107-007-0130-8zbMath1163.90016OpenAlexW2012732584MaRDI QIDQ959926

Sien Deng, James V. Burke

Publication date: 16 December 2008

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-007-0130-8

zbMATH Keywords

error boundsconstraint qualificationweak sharp minimaaffine convex inclusionconvex inclusion

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52)

Related Items (36)

Convergence results of a new monotone inertial forward-backward splitting algorithm under the local Hölder error bound condition ⋮ On applications of the calmness moduli for multifunctions to error bounds ⋮ A Lipschitzian error bound for monotone symmetric cone linear complementarity problem ⋮ A Lipschitzian error bound for convex quadratic symmetric cone programming ⋮ Inclusions in general spaces: Hoelder stability, solution schemes and Ekeland's principle ⋮ Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems ⋮ New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure ⋮ Equivalent properties of global weak sharp minima with applications ⋮ Optimality conditions for weak \({\psi}\) -sharp minima in vector optimization problems ⋮ Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces ⋮ Linear conditioning, weak sharpness and finite convergence for equilibrium problems ⋮ New characterizations of weak sharp minima ⋮ Strong Fermat rules for constrained set-valued optimization problems on Banach spaces ⋮ Linear convergence of first order methods for non-strongly convex optimization ⋮ Generalized weak sharp minima in cone-constrained convex optimization with applications ⋮ Strong KKT conditions and weak sharp solutions in convex-composite optimization ⋮ Weak sharp minima in set-valued optimization problems ⋮ Relative regularity conditions and linear regularity properties for split feasibility problems in normed linear spaces ⋮ Necessary conditions for weak sharp minima in cone-constrained optimization problems ⋮ Global error bounds for piecewise convex polynomials ⋮ An easily computable upper bound on the Hoffman constant for homogeneous inequality systems ⋮ Weak \(\psi \)-sharp minima in vector optimization problems ⋮ Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity ⋮ Sufficient conditions for error bounds and linear regularity in Banach spaces ⋮ Finite termination of inexact proximal point algorithms in Hilbert spaces ⋮ Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty ⋮ Strong Abadie CQ, ACQ, calmness and linear regularity ⋮ RSG: Beating Subgradient Method without Smoothness and Strong Convexity ⋮ Optimization methods and stability of inclusions in Banach spaces ⋮ Metric subregularity for nonclosed convex multifunctions in normed spaces ⋮ Weak sharp minima for set-valued vector variational inequalities with an application ⋮ A note on finite termination of iterative algorithms in mathematical programming ⋮ Generalized weak sharp minima in cone-constrained convex optimization on Hadamard manifolds ⋮ New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors ⋮ Weak sharpness and finite termination for variational inequalities on Hadamard manifolds ⋮ Some Dual Conditions for Global Weak Sharp Minimality of Nonconvex Functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Error bounds in mathematical programming
• Asymptotic constraint qualifications and global error bounds for convex inequalities.
• Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
• Regularity and conditioning of solution mappings in variational analysis
• Regularities and their relations to error bounds
• A Gauss-Newton method for convex composite optimization
• Weak sharp minima revisited. II: Application to linear regularity and error bounds
• Calmness of constraint systems with applications
• Error bounds for convex differentiable inequality systems in Banach spaces
• Weak Sharp Minima in Mathematical Programming
• Calmness and Exact Penalization
• Global Regularity Theorems
• On the Identification of Active Constraints
• Regularity and Stability for Convex Multivalued Functions
• An Exact Penalization Viewpoint of Constrained Optimization
• An Application of Error Bounds for Convex Programming in a Linear Space
• A New Approach to Lagrange Multipliers
• Global Error Bounds for Convex Inequality Systems in Banach Spaces
• Extension of Hoffman’s Error Bound to Polynomial Systems
• Variational Analysis
• Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
• Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
• Subdifferential Conditions for Calmness of Convex Constraints
• A Unified Analysis of Hoffman’s Bound via Fenchel Duality
• Hoffman's Error Bound, Local Controllability, and Sensitivity Analysis
• Convex Analysis
• Normed Convex Processes
• Error Bound Moduli for Conic Convex Systems on Banach Spaces
• A subdifferential condition for calmness of multifunctions

This page was built for publication: Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions