Weak sharp minima revisited. II: Application to linear regularity and error bounds
From MaRDI portal
Publication:2576722
DOI10.1007/S10107-005-0615-2zbMath1124.90349OpenAlexW2038377767MaRDI QIDQ2576722
Publication date: 14 December 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0615-2
error boundsconstraint qualificationrecession coneweak sharp minimarecession functionlocal weak sharp minimalinear regularityadditive regularityboundedly weak sharp minima
Related Items (61)
A stochastic approximation method for convex programming with many semidefinite constraints ⋮ 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 ⋮ 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 ⋮ Variational Analysis of Composite Models with Applications to Continuous Optimization ⋮ Characterizations of stability of error bounds for convex inequality constraint systems ⋮ 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 ⋮ Unnamed Item ⋮ Structure and weak sharp minimum of the Pareto solution set for piecewise linear multiobjective optimization ⋮ New characterizations of weak sharp minima ⋮ Set regularities and feasibility problems ⋮ Perturbation of error bounds ⋮ The equivalence of three types of error bounds for weakly and approximately convex functions ⋮ Sample average approximation with heavier tails. I: Non-asymptotic bounds with weak assumptions and stochastic constraints ⋮ About error bounds in metrizable topological vector spaces ⋮ Generalized weak sharp minima in cone-constrained convex optimization with applications ⋮ Stationarity and regularity of infinite collections of sets ⋮ 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 ⋮ Error bounds and a condition number for the absolute value equations ⋮ Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity ⋮ Positive definiteness of high-order subdifferential and high-order optimality conditions in vector optimization problems ⋮ Weak sharpness for gap functions in vector variational inequalities ⋮ A note on weak sharp minima in multicriteria linear programming ⋮ Global error bounds for \(\gamma \)-paraconvex multifunctions ⋮ Weak \(\psi \)-sharp minima in vector optimization problems ⋮ Unnamed Item ⋮ Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity ⋮ Error Bounds and Multipliers in Constrained Optimization Problems with Tolerance ⋮ Weak sharp minima for piecewise linear multiobjective optimization in normed spaces ⋮ A Block Lanczos Method for the Extended Trust-Region Subproblem ⋮ About \([q\)-regularity properties of collections of sets] ⋮ Finite termination of inexact proximal point algorithms in Hilbert spaces ⋮ Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty ⋮ About subtransversality of collections of sets ⋮ RSG: Beating Subgradient Method without Smoothness and Strong Convexity ⋮ Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions ⋮ Error bounds for systems of lower semicontinuous functions in Asplund spaces ⋮ Quantitative characterizations of regularity properties of collections of sets ⋮ Weak sharp minima for set-valued vector variational inequalities with an application ⋮ Error bounds: necessary and sufficient conditions ⋮ Nonconvex weak sharp minima on Riemannian manifolds ⋮ About regularity of collections of sets ⋮ 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 ⋮ Characterizations of linear suboptimality for mathematical programs with equilibrium constraints ⋮ Convergence of the gradient sampling algorithm on directionally Lipschitz functions ⋮ Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions ⋮ A versatile approach to metric regularity, openness, and Lipschitzian properties ⋮ Global Error Bounds for Systems of Convex Polynomials over Polyhedral Constraints ⋮ Weak sharpness and finite termination for variational inequalities on Hadamard manifolds ⋮ Amenable Cones Are Particularly Nice ⋮ 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
- Unnamed Item
- Error bounds in mathematical programming
- Variational methods in partially ordered spaces
- Asymptotic constraint qualifications and global error bounds for convex inequalities.
- Convex analysis and nonlinear optimization. Theory and examples
- 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
- Weak Sharp Minima in Mathematical Programming
- Global Regularity Theorems
- An Application of Error Bounds for Convex Programming in a Linear Space
- Global Error Bounds for Convex Inequality Systems in Banach Spaces
- Extension of Hoffman’s Error Bound to Polynomial Systems
- Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
- Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
- A Unified Analysis of Hoffman’s Bound via Fenchel Duality
- On the Subdifferentiability of Convex Functions
- Level Sets and Continuity of Conjugate Convex Functions
- Convex Analysis
- The Duality of Pairs of Wedges
- Characterizations of Error Bounds for Convex Multifunctions on Banach Spaces
- Error Bound Moduli for Conic Convex Systems on Banach Spaces
This page was built for publication: Weak sharp minima revisited. II: Application to linear regularity and error bounds