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

DOI10.1007/S101070050083zbMATH Open0998.90088OpenAlexW2075706482MaRDI QIDQ1806029FDOQ1806029

Authors: Heinz H. Bauschke, Wu Li, Jonathan M. Borwein Edit this on Wikidata

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

Recommendations

• Bounded linear regularity, strong CHIP, and CHIP are distinct properties
• Strong CHIP, normality, and linear regularity of convex sets
• Bounded linear regularity of convex sets in Banach spaces and its applications
• The strong conical hull intersection property for convex programming

zbMATH Keywords

error boundlinear inequalitiesbounded linear regularityorthogonal projectionconvex feasibility problemsconvex inequalitiesproperty (G)linear regularitybasic constraint qualificationHoffman's error boundasymptotic constraint qualificationCHIP conical hull intersection propertyconstraint best approximationFriedrich angle

Mathematics Subject Classification ID

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

Cited In (only showing first 100 items - show all)

• Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
• Learning theory of randomized sparse Kaczmarz method
• Computation of graphical derivatives of normal cone maps to a class of conic constraint sets
• New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization
• 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
• Amenable cones: error bounds without constraint qualifications
• Sufficient conditions for error bounds and linear regularity in Banach spaces
• Error bounds, facial residual functions and applications to the exponential cone
• Critical Multipliers in Semidefinite Programming
• Kurdyka-Łojasiewicz exponent via inf-projection
• Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates
• A strict complementarity approach to error bound and sensitivity of solution of conic programs
• Computing the best approximation over the intersection of a polyhedral set and the doubly nonnegative cone
• Calmness and the Abadie CQ for multifunctions and linear regularity for a collection of closed sets
• Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
• A successive centralized circumcentered-reflection method for the convex feasibility problem
• Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming
• Subtransversality and strong CHIP of closed sets in Asplund spaces
• Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
• On degenerate doubly nonnegative projection problems
• Amenable cones are particularly nice
• A block Lanczos method for the extended trust-region subproblem
• Error bound characterizations of the conical constraint qualification in convex programming
• Some new characterizations of intrinsic transversality in Hilbert spaces
• Metric inequality conditions on sets and consequences in optimization
• Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems
• Convergence Rate Analysis of a Dykstra-Type Projection Algorithm
• Strong convergence of the composition of firmly nonexpansive mappings
• Normal property, Jameson property, CHIP and linear regularity for an infinite system of convex sets in Banach spaces
• Characterizing nonconvex constrained best approximation using Robinson's constraint qualification
• Exact penalization of generalized Nash equilibrium problems
• Strong calmness of perturbed KKT system for a class of conic programming with degenerate solutions
• Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints
• New extremal principles with applications to stochastic and semi-infinite programming
• Strong CHIP for infinite systems of convex sets in normed linear spaces
• Hyperbolicity cones are amenable
• Error bounds and multipliers in constrained optimization problems with tolerance
• Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications
• Revisiting some rules of convex analysis
• Criticality of Lagrange multipliers in variational systems
• Quantitative characterizations of regularity properties of collections of sets
• Dual sufficient characterizations of transversality properties
• Primal necessary characterizations of transversality properties
• Linear regularity and \(\phi\)-regularity of nonconvex sets
• Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
• Slow convergence of sequences of linear operators. II: Arbitrarily slow convergence
• Algebraic Cycles and the Lie Algebra of Mixed Tate Motives
• Second-order variational analysis in second-order cone programming
• Duality theorems for quasiconvex programming with a reverse quasiconvex constraint
• Bounded linear regularity, strong CHIP, and CHIP are distinct properties
• A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
• Necessary and sufficient conditions for stable conjugate duality
• Linear regularity, equirregularity, and intersection mappings for convex semi-infinite inequality systems
• Linear convergence of projection algorithms
• On conic QPCCs, conic QCQPs and completely positive programs
• On basic constraint qualifications for infinite system of convex Inequalities in Banach spaces
• Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions
• On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
• Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
• Nonlinear transversality of collections of sets: dual space necessary characterizations
• A Global Approach to Nonlinearly Constrained Best Approximation
• An inexact augmented Lagrangian method for second-order cone programming with applications
• Coherent risk measure, equilibrium and equilibrium pricing
• Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization
• On constraint qualifications of a nonconvex inequality
• A simple closure condition for the normal cone intersection formula
• New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
• Transversality properties: primal sufficient conditions
• The strong conical hull intersection property for convex programming
• Geometric and metric characterizations of transversality properties
• Dynamical behavior of a stochastic forward-backward algorithm using random monotone operators
• Arbitrarily slow convergence of sequences of linear operators: a survey
• Optimality Conditions in Directionally Differentiable Pareto Problems with a Set Constraint via Tangent Cones
• Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems
• Set regularities and feasibility problems
• Strong Abadie CQ, ACQ, calmness and linear regularity
• Ergodic convergence of a stochastic proximal point algorithm
• The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
• Linear convergence of the Douglas-Rachford method for two closed sets
• Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
• Geometric condition measures and smoothness condition measures for closed convex sets and linear regularity of infinitely many closed convex sets
• Stochastic block projection algorithms with extrapolation for convex feasibility problems
• Fenchel duality and the strong conical hull intersection property
• Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
• Strong CHIP, normality, and linear regularity of convex sets
• BCQ and strong BCQ for nonconvex generalized equations with applications to metric subregularity
• A unified approach to error bounds for structured convex optimization problems
• About \([q]\)-regularity properties of collections of sets
• Bounded linear regularity of convex sets in Banach spaces and its applications
• About regularity of collections of sets
• Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets
• Set intersection problems: supporting hyperplanes and quadratic programming
• Augmented Lagrangian methods for convex matrix optimization problems
• A fully stochastic primal-dual algorithm
• Variational geometric approach to generalized differential and conjugate calculi in convex analysis
• Error bounds for systems of lower semicontinuous functions in Asplund spaces
• Special values of multiple polylogarithms
• Parabolic regularity in geometric variational analysis
• Stochastic proximal splitting algorithm for composite minimization

This page was built for publication: Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization

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