Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization
From MaRDI portal
Publication:1806029
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
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)
Recommendations
Cited in
(only showing first 100 items - show all)- Arbitrarily slow convergence of sequences of linear operators: a survey
- About regularity of collections of sets
- Quantitative characterizations of regularity properties of collections of sets
- Duality theorems for quasiconvex programming with a reverse quasiconvex constraint
- Dual sufficient characterizations of transversality properties
- Primal necessary characterizations of transversality properties
- Strong Abadie CQ, ACQ, calmness and linear regularity
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- Fenchel duality and the strong conical hull intersection property
- Ergodic convergence of a stochastic proximal point algorithm
- Transversality properties: primal sufficient conditions
- Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications
- Volumes of hyperbolic manifolds and mixed Tate motives
- Bounded linear regularity of convex sets in Banach spaces and its applications
- A fully stochastic primal-dual algorithm
- Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
- Special values of multiple polylogarithms
- Stationarity and regularity of infinite collections of sets
- Nonlinear transversality of collections of sets: dual space necessary characterizations
- Parabolic regularity in geometric variational analysis
- Slow convergence of sequences of linear operators. II: Arbitrarily slow convergence
- A Global Approach to Nonlinearly Constrained Best Approximation
- A unified approach to error bounds for structured convex optimization problems
- Linear regularity and \(\phi\)-regularity of nonconvex sets
- Weak sharp minima for piecewise linear multiobjective optimization in normed spaces
- Algebraic Cycles and the Lie Algebra of Mixed Tate Motives
- Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets
- Revisiting some rules of convex analysis
- Calmness of partial perturbation to composite rank constraint systems and its applications
- An inexact augmented Lagrangian method for second-order cone programming with applications
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- On conic QPCCs, conic QCQPs and completely positive programs
- Geometric and metric characterizations of transversality properties
- The strong conical hull intersection property for convex programming
- Set intersection problems: supporting hyperplanes and quadratic programming
- On basic constraint qualifications for infinite system of convex Inequalities in Banach spaces
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
- Coherent risk measure, equilibrium and equilibrium pricing
- Optimality Conditions in Directionally Differentiable Pareto Problems with a Set Constraint via Tangent Cones
- Linear convergence of the randomized sparse Kaczmarz method
- Bounded linear regularity, strong CHIP, and CHIP are distinct properties
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Dynamical behavior of a stochastic forward-backward algorithm using random monotone operators
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
- 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
- Second-order variational analysis in second-order cone programming
- Linear convergence of the Douglas-Rachford method for two closed sets
- Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems
- Criticality of Lagrange multipliers in variational systems
- scientific article; zbMATH DE number 7079312 (Why is no real title available?)
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Necessary and sufficient conditions for stable conjugate duality
- Augmented Lagrangian methods for convex matrix optimization 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
- Weak sharp minima revisited. II: Application to linear regularity and error bounds
- Variational geometric approach to generalized differential and conjugate calculi in convex analysis
- Error bounds for systems of lower semicontinuous functions in Asplund spaces
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- Set regularities and feasibility problems
- Linear convergence of projection algorithms
- About \([q]\)-regularity properties of collections of sets
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
- A simple closure condition for the normal cone intersection formula
- Strong CHIP, normality, and linear regularity of convex sets
- Stochastic proximal splitting algorithm for composite minimization
- BCQ and strong BCQ for nonconvex generalized equations with applications to metric subregularity
- Stochastic block projection algorithms with extrapolation for convex feasibility problems
- Error bounds and multipliers in constrained optimization problems with tolerance
- 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
- New extremal principles with applications to stochastic and semi-infinite programming
- Exact penalization of generalized Nash equilibrium problems
- Subtransversality and strong CHIP of closed sets in Asplund spaces
- Error bounds, facial residual functions and applications to the exponential cone
- Computation of graphical derivatives of normal cone maps to a class of conic constraint sets
- Error bound characterizations of the conical constraint qualification in convex programming
- Characterizing nonconvex constrained best approximation using Robinson's constraint qualification
- Critical Multipliers in Semidefinite Programming
- On applications of the calmness moduli for multifunctions to error bounds
- Some new characterizations of intrinsic transversality in Hilbert spaces
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
- Convergence Rate Analysis of a Dykstra-Type Projection Algorithm
- Relative regularity conditions and linear regularity properties for split feasibility problems in normed linear spaces
- Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
- Amenable cones: error bounds without constraint qualifications
- A successive centralized circumcentered-reflection method for the convex feasibility problem
- Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming
- Calmness and the Abadie CQ for multifunctions and linear regularity for a collection of closed sets
- New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization
- Strong calmness of perturbed KKT system for a class of conic programming with degenerate solutions
- Strong convergence of the composition of firmly nonexpansive mappings
- Kurdyka-Łojasiewicz exponent via inf-projection
- On degenerate doubly nonnegative projection problems
- Amenable cones are particularly nice
- Strong CHIP for infinite systems of convex sets in normed linear spaces
- Sufficient conditions for error bounds and linear regularity in Banach spaces
- A block Lanczos method for the extended trust-region subproblem
- Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
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)
