Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization
From MaRDI portal
(Redirected from Publication:1806029)
Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
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)- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Calmness of partial perturbation to composite rank constraint systems and its applications
- Weak sharp minima for piecewise linear multiobjective optimization in normed spaces
- scientific article; zbMATH DE number 7079312 (Why is no real title available?)
- Hyperbolicity cones are amenable
- Volumes of hyperbolic manifolds and mixed Tate motives
- Weak sharp minima revisited. II: Application to linear regularity and error bounds
- Stationarity and regularity of infinite collections of sets
- Linear convergence of the randomized sparse Kaczmarz method
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
- Revisiting some rules of convex analysis
- Error bounds and multipliers in constrained optimization problems with tolerance
- Dual sufficient characterizations of transversality properties
- Primal necessary characterizations of transversality properties
- Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications
- Linear regularity and \(\phi\)-regularity of nonconvex sets
- Quantitative characterizations of regularity properties of collections of sets
- Computation of graphical derivatives of normal cone maps to a class of conic constraint sets
- Criticality of Lagrange multipliers in variational systems
- Learning theory of randomized sparse Kaczmarz method
- New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
- Algebraic Cycles and the Lie Algebra of Mixed Tate Motives
- Relative regularity conditions and linear regularity properties for split feasibility problems in normed linear spaces
- Slow convergence of sequences of linear operators. II: Arbitrarily slow convergence
- Second-order variational analysis in second-order cone programming
- On applications of the calmness moduli for multifunctions to error bounds
- Duality theorems for quasiconvex programming with a reverse quasiconvex constraint
- Amenable cones: error bounds without constraint qualifications
- Linear regularity, equirregularity, and intersection mappings for convex semi-infinite inequality systems
- 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
- On conic QPCCs, conic QCQPs and completely positive programs
- Linear convergence of projection algorithms
- Sufficient conditions for error bounds and linear regularity in Banach spaces
- On basic constraint qualifications for infinite system of convex Inequalities in Banach spaces
- 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
- Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions
- Kurdyka-Łojasiewicz exponent via inf-projection
- Critical Multipliers in Semidefinite Programming
- Error bounds, facial residual functions and applications to the exponential cone
- Coherent risk measure, equilibrium and equilibrium pricing
- On constraint qualifications of a nonconvex inequality
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
- Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization
- Nonlinear transversality of collections of sets: dual space necessary characterizations
- An inexact augmented Lagrangian method for second-order cone programming with applications
- A Global Approach to Nonlinearly Constrained Best Approximation
- Transversality properties: primal sufficient conditions
- A simple closure condition for the normal cone intersection formula
- Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates
- Dynamical behavior of a stochastic forward-backward algorithm using random monotone operators
- Computing the best approximation over the intersection of a polyhedral set and the doubly nonnegative cone
- Geometric and metric characterizations of transversality properties
- A strict complementarity approach to error bound and sensitivity of solution of conic programs
- The strong conical hull intersection property for convex programming
- Calmness and the Abadie CQ for multifunctions and linear regularity for a collection of closed sets
- Arbitrarily slow convergence of sequences of linear operators: a survey
- 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
- Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems
- Set regularities and feasibility problems
- Subtransversality and strong CHIP of closed sets in Asplund spaces
- Optimality Conditions in Directionally Differentiable Pareto Problems with a Set Constraint via Tangent Cones
- Strong Abadie CQ, ACQ, calmness and linear regularity
- Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
- On degenerate doubly nonnegative projection problems
- Amenable cones are particularly nice
- Ergodic convergence of a stochastic proximal point algorithm
- Linear convergence of the Douglas-Rachford method for two closed sets
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- Some new characterizations of intrinsic transversality in Hilbert spaces
- A block Lanczos method for the extended trust-region subproblem
- Geometric condition measures and smoothness condition measures for closed convex sets and linear regularity of infinitely many closed convex sets
- Error bound characterizations of the conical constraint qualification in convex programming
- Metric inequality conditions on sets and consequences in optimization
- Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
- Fenchel duality and the strong conical hull intersection property
- Stochastic block projection algorithms with extrapolation for convex feasibility problems
- BCQ and strong BCQ for nonconvex generalized equations with applications to metric subregularity
- Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems
- Strong CHIP, normality, and linear regularity of convex sets
- Convergence Rate Analysis of a Dykstra-Type Projection Algorithm
- A unified approach to error bounds for structured convex optimization problems
- Strong convergence of the composition of firmly nonexpansive mappings
- About \([q]\)-regularity properties of collections of sets
- 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
- 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
- Exact penalization of generalized Nash equilibrium problems
- Augmented Lagrangian methods for convex matrix optimization problems
- Strong calmness of perturbed KKT system for a class of conic programming with degenerate solutions
- A fully stochastic primal-dual algorithm
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)
