Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization

DOI10.1007/s101070050083zbMath0998.90088OpenAlexW2075706482MaRDI QIDQ1806029

Heinz H. Bauschke, Wu Li, Jonathan M. Borwein

Publication date: 6 August 2003

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

Full work available at URL: https://doi.org/10.1007/s101070050083

zbMATH Keywords

error bound linear inequalities orthogonal projection bounded linear regularity convex feasibility problems convex inequalities property (G)linear regularity basic constraint qualification Hoffman's error bound asymptotic constraint qualification CHIP conical hull intersection property constraint best approximation Friedrich angle

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product) (46C05) Linear inequalities of matrices (15A39) Approximation with constraints (41A29) Ordered topological linear spaces, vector lattices (46A40)

Related Items

Special values of multiple polylogarithms, A fully stochastic primal-dual algorithm, Primal necessary characterizations of transversality properties, Dual sufficient characterizations of transversality properties, On applications of the calmness moduli for multifunctions to error bounds, Arbitrarily Slow Convergence of Sequences of Linear Operators: A Survey, Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems, Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems, On conic QPCCs, conic QCQPs and completely positive programs, Stochastic block projection algorithms with extrapolation for convex feasibility problems, Linear regularity, equirregularity, and intersection mappings for convex semi-infinite inequality systems, Geometric condition measures and smoothness condition measures for closed convex sets and linear regularity of infinitely many closed convex sets, On basic constraint qualifications for infinite system of convex Inequalities in Banach spaces, Augmented Lagrangian methods for convex matrix optimization problems, Kurdyka-Łojasiewicz exponent via inf-projection, Linear regularity and \(\phi\)-regularity of nonconvex sets, Coherent risk measure, equilibrium and equilibrium pricing, Unnamed Item, Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems, Some new characterizations of intrinsic transversality in Hilbert spaces, A unified approach to error bounds for structured convex optimization problems, Slow convergence of sequences of linear operators. II: Arbitrarily slow convergence, Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization, Distributed solutions for loosely coupled feasibility problems using proximal splitting methods, Set regularities and feasibility problems, Exact Penalization of Generalized Nash Equilibrium Problems, Characterizing nonconvex constrained best approximation using Robinson's constraint qualification, Error Bound Characterizations of the Conical Constraint Qualification in Convex Programming, Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions, Error bounds, facial residual functions and applications to the exponential cone, Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates, Geometric and metric characterizations of transversality properties, Stationarity and regularity of infinite collections of sets, Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints, Calmness of partial perturbation to composite rank constraint systems and its applications, Constraint qualifications characterizing Lagrangian duality in convex optimization, Linear convergence of the randomized sparse Kaczmarz method, Error Bounds and Multipliers in Constrained Optimization Problems with Tolerance, Strong calmness of perturbed KKT system for a class of conic programming with degenerate solutions, Weak sharp minima for piecewise linear multiobjective optimization in normed spaces, Sufficient conditions for error bounds and linear regularity in Banach spaces, BCQ and strong BCQ for nonconvex generalized equations with applications to metric subregularity, A Block Lanczos Method for the Extended Trust-Region Subproblem, Amenable cones: error bounds without constraint qualifications, New extremal principles with applications to stochastic and semi-infinite programming, About \([q\)-regularity properties of collections of sets], Strong CHIP for infinite systems of convex sets in normed linear spaces, Critical Multipliers in Semidefinite Programming, QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming, Variational geometric approach to generalized differential and conjugate calculi in convex analysis, Revisiting some rules of convex analysis, Duality theorems for quasiconvex programming with a reverse quasiconvex constraint, Algebraic Cycles and the Lie Algebra of Mixed Tate Motives, Strong Abadie CQ, ACQ, calmness and linear regularity, New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization, A simple closure condition for the normal cone intersection formula, 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, Bounded linear regularity of convex sets in Banach spaces and its applications, The strong conical hull intersection property for convex programming, A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces., Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets, Necessary and sufficient conditions for stable conjugate duality, About regularity of collections of sets, Linear convergence of the Douglas–Rachford method for two closed sets, On constraint qualifications of a nonconvex inequality, Learning Theory of Randomized Sparse Kaczmarz Method, Dynamical behavior of a stochastic forward-backward algorithm using random monotone operators, Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems, The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets, Set intersection problems: supporting hyperplanes and quadratic programming, Optimality Conditions in Directionally Differentiable Pareto Problems with a Set Constraint via Tangent Cones, Unnamed Item, Strong CHIP, normality, and linear regularity of convex sets, Transversality properties: primal sufficient conditions, Parabolic regularity in geometric variational analysis, A Global Approach to Nonlinearly Constrained Best Approximation, Metric inequality conditions on sets and consequences in optimization, Stochastic proximal splitting algorithm for composite minimization, Second-order variational analysis in second-order cone programming, Fenchel duality and the strong conical hull intersection property, New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors, Linear Convergence of Projection Algorithms, Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions, Ergodic Convergence of a Stochastic Proximal Point Algorithm, Criticality of Lagrange Multipliers in Variational Systems, Calmness and the Abadie CQ for Multifunctions and Linear Regularity for a Collection of Closed Sets, Normal property, Jameson property, CHIP and linear regularity for an infinite system of convex sets in Banach spaces, Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions, Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone, Computation of graphical derivatives of normal cone maps to a class of conic constraint sets, Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation, On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming, An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications, Weak sharp minima revisited. II: Application to linear regularity and error bounds, Volumes of hyperbolic manifolds and mixed Tate motives, On Degenerate Doubly Nonnegative Projection Problems, Amenable Cones Are Particularly Nice, Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications, Hyperbolicity cones are amenable, Relative regularity conditions and linear regularity properties for split feasibility problems in normed linear spaces, A strict complementarity approach to error bound and sensitivity of solution of conic programs, Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming, A successive centralized circumcentered-reflection method for the convex feasibility problem, Convergence Rate Analysis of a Dykstra-Type Projection Algorithm