Sufficient conditions for error bounds and linear regularity in Banach spaces
From MaRDI portal
Publication:2452391
DOI10.1007/s10114-014-2522-zzbMath1322.90068MaRDI QIDQ2452391
Publication date: 3 June 2014
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-014-2522-z
90C25: Convex programming
90C31: Sensitivity, stability, parametric optimization
49J53: Set-valued and variational analysis
Related Items
Cites Work
- Optimality conditions for non-finite valued convex composite functions
- Linear regularity for an infinite system formed by \(p\)-uniformly subsmooth sets in Banach spaces
- Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
- Error bounds for systems of lower semicontinuous functions in Asplund spaces
- Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets
- On the Clarke subdifferential of the distance function of a closed set
- Convex functions, monotone operators and differentiability
- Error bounds in mathematical programming
- Exact order of Hoffman's error bounds for elliptic quadratic inequalities derived from vector-valued Chebyshev approximation
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Regularities and their relations to error bounds
- Sufficient conditions for error bounds and applications
- Strong Abadie CQ, ACQ, calmness and linear regularity
- Stability of Error Bounds for Semi-infinite Convex Constraint Systems
- Linear Regularity for a Collection of Subsmooth Sets in Banach Spaces
- A Condition Number for Differentiable Convex Inequalities
- Global Regularity Theorems
- Regular Points of Lipschitz Functions
- An Application of Error Bounds for Convex Programming in a Linear Space
- Extension of Hoffman’s Error Bound to Polynomial Systems
- Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
- On Projection Algorithms for Solving Convex Feasibility Problems
- Error bounds for monotone linear complementarity problems
- Hoffman's Error Bound, Local Controllability, and Sensitivity Analysis
- The Duality of Pairs of Wedges
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item