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

DOI10.1007/S10107-007-0130-8zbMATH Open1163.90016OpenAlexW2012732584MaRDI QIDQ959926FDOQ959926

Authors: James V. Burke, Sien Deng 

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

Recommendations

• Weak sharp minima revisited. I: Basic theory
• Weak sharp minima revisited. II: Application to linear regularity and error bounds
• Weak Sharp Minima in Mathematical Programming
• Global error bound for convex inclusion problems
• New characterizations of weak sharp minima

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)

Cites Work

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

Cited In (43)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q959926)