Amenable cones: error bounds without constraint qualifications
From MaRDI portal
Publication:2227528
DOI10.1007/s10107-019-01439-3zbMath1459.90205arXiv1712.06221OpenAlexW2778468193MaRDI QIDQ2227528
Publication date: 15 February 2021
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.06221
error boundssymmetric conesfeasibility problemfacial reductionsubtransversalitysingularity degreeamenable cones
Sensitivity, stability, parametric optimization (90C31) Finite-dimensional structures of Jordan algebras (17C55) Error analysis and interval analysis (65G99)
Related Items (8)
A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms ⋮ Error bounds, facial residual functions and applications to the exponential cone ⋮ Self-Dual Polyhedral Cones and Their Slack Matrices ⋮ Hyperbolicity cones are amenable ⋮ A strict complementarity approach to error bound and sensitivity of solution of conic programs ⋮ How Do Exponential Size Solutions Arise in Semidefinite Programming? ⋮ Solving SDP completely with an interior point oracle ⋮ Amenable Cones Are Particularly Nice
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Facial reduction algorithms for conic optimization problems
- A note on alternating projections for ill-posed semidefinite feasibility problems
- A robust Lagrangian-DNN method for a class of quadratic optimization problems
- A study of projectionally exposed cones
- Schur complements, Schur determinantal and Haynsworth inertia formulas in Euclidean Jordan algebras
- Regularizing the abstract convex program
- Perfect cones
- The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
- Error bounds in mathematical programming
- Similarity and other spectral relations for symmetric cones
- The automorphism group and the non-self-duality of \(p\)-cones
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- A relaxed-certificate facial reduction algorithm based on subspace intersection
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- On Nesterov's approach to semi-infinite programming
- Strong duality and minimal representations for cone optimization
- On the connection of facially exposed and nice cones
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- A bound on the Carathéodory number
- The \(p\)-cones in dimension \(n\geq 3\) are not homogeneous when \(p\neq 2\)
- Invariance and efficiency of convex representations
- Jordan‐Algebraic Approach to Convexity Theorems for Quadratic Mappings
- A Lipschitzian error bound for monotone symmetric cone linear complementarity problem
- Several Jordan-algebraic aspects of optimization†
- Interior Point Methods for Nonlinear Optimization
- Characterizations of optimality without constraint qualification for the abstract convex program
- Relating Homogeneous Cones and Positive Definite Cones via T-Algebras
- Error Bounds for Linear Matrix Inequalities
- Facial Reduction and Partial Polyhedrality
- Variational Analysis of Regular Mappings
- Facially Exposed Cones Are Not Always Nice
- Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method
- Facially Dual Complete (Nice) Cones and Lexicographic Tangents
- Coordinate Shadows of Semidefinite and Euclidean Distance Matrices
- Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
- ``Efficient” Subgradient Methods for General Convex Optimization
- Convex Analysis
- Preprocessing and Regularization for Degenerate Semidefinite Programs
- Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: Amenable cones: error bounds without constraint qualifications
