Error bounds, facial residual functions and applications to the exponential cone
From MaRDI portal
Publication:6044980
DOI10.1007/s10107-022-01883-8zbMath1519.90173arXiv2010.16391OpenAlexW3097101327WikidataQ115606174 ScholiaQ115606174MaRDI QIDQ6044980
Scott B. Lindstrom, Ting Kei Pong, Bruno F. Lourenço
Publication date: 25 May 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.16391
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Facial reduction algorithms for conic optimization problems
- Relative entropy optimization and its applications
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
- A study of projectionally exposed cones
- Theory of cones
- Regularizing the abstract convex program
- Error bounds in mathematical programming
- From error bounds to the complexity of first-order descent methods for convex functions
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Completely positive cones: are they facially exposed?
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- On the connection of facially exposed and nice cones
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Global error bounds for piecewise convex polynomials
- Amenable cones: error bounds without constraint qualifications
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- The lattice of faces of a finite dimensional cone
- Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems
- On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials
- Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Clarke Subgradients of Stratifiable Functions
- Several Jordan-algebraic aspects of optimization†
- Error Bounds for Linear Matrix Inequalities
- Facial Reduction and Partial Polyhedrality
- On Projection Algorithms for Solving Convex Feasibility Problems
- Error Bounds for Abstract Linear Inequality Systems
- Variational Analysis of Regular Mappings
- Facially Exposed Cones Are Not Always Nice
- Solving Natural Conic Formulations with Hypatia.jl
- Alfonso: Matlab Package for Nonsymmetric Conic Optimization
- The Generalized Bregman Distance
- Lifts of Convex Sets and Cone Factorizations
- Facially Dual Complete (Nice) Cones and Lexicographic Tangents
- On the Closedness of the Linear Image of a Closed Convex Cone
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
- Amenable Cones Are Particularly Nice
