On applications of the calmness moduli for multifunctions to error bounds
From MaRDI portal
Publication:5045174
DOI10.1080/02331934.2021.1906873zbMath1506.90252OpenAlexW3146796022MaRDI QIDQ5045174
Publication date: 4 November 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2021.1906873
Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Geometry and structure of normed linear spaces (46B20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Nonsmooth analysis
- Weak sharp minima for piecewise linear multiobjective optimization in normed spaces
- Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
- Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets
- Finite termination of the proximal point algorithm
- Sensitivity analysis for nonsmooth generalized equations
- On the convergence of von Neumann's alternating projection algorithm for two sets
- First-order conditions for isolated locally optimal solutions
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Error bounds in mathematical programming
- Abadie constraint qualifications for convex constraint systems and applications to calmness property
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Implicit multifunction theorems for the sensitivity analysis of variational conditions
- Regularity and conditioning of solution mappings in variational analysis
- A Gauss-Newton method for convex composite optimization
- Strong Abadie CQ, ACQ, calmness and linear regularity
- Weak sharp minima revisited. II: Application to linear regularity and error bounds
- Calmness of constraint systems with applications
- Solution Sensitivity from General Principles
- Normal property, Jameson property, CHIP and linear regularity for an infinite system of convex sets in Banach spaces
- Weak Sharp Minima in Mathematical Programming
- Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging
- Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
- Calmness and Exact Penalization
- Metric Subregularity and Constraint Qualifications for Convex Generalized Equations in Banach Spaces
- Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
- Implicit Functions and Solution Mappings
- Linear Regularity for a Collection of Subsmooth Sets in Banach Spaces
- Calmness for L-Subsmooth Multifunctions in Banach Spaces
- Optimization and nonsmooth analysis
- Global Error Bounds for Convex Inequality Systems in Banach Spaces
- Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
- Existence and Differentiability of Metric Projections in Hilbert Spaces
- On Projection Algorithms for Solving Convex Feasibility Problems
- Subdifferential Conditions for Calmness of Convex Constraints
- On the Calmness of a Class of Multifunctions
- Weak Sharp Minima: Characterizations and Sufficient Conditions
- Calmness and the Abadie CQ for Multifunctions and Linear Regularity for a Collection of Closed Sets
- Strong CHIP, normality, and linear regularity of convex sets
- Set-valued analysis
