Facially Dual Complete (Nice) Cones and Lexicographic Tangents

DOI10.1137/17M1126643zbMath1425.52004arXiv1704.06368OpenAlexW2973274914WikidataQ127227234 ScholiaQ127227234MaRDI QIDQ5234283

Vera Roshchina, Tunçel, Levent

Publication date: 26 September 2019

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.06368

zbMATH Keywords

convex conesduality theorytangent coneboundary structurefacially dual completefacially exposedlexicographic tangent

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15) Convex sets in (3) dimensions (including convex surfaces) (52A15) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (4)

Error bounds, facial residual functions and applications to the exponential cone ⋮ The homogenization cone: polar cone and projection ⋮ Amenable cones: error bounds without constraint qualifications ⋮ Amenable Cones Are Particularly Nice

Uses Software

• Sieve-SDP
• frlib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Facial reduction algorithms for conic optimization problems
• A facial reduction algorithm for finding sparse SOS representations
• An exact duality theory for semidefinite programming and its complexity implications
• Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
• Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
• Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers
• 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
• Hyperbolic programs, and their derivative relaxations
• Invariance and efficiency of convex representations
• Lexicographic differentiation of nonsmooth functions
• Euclidean Distance Matrices and Applications
• Hyperbolic Polynomials and Interior Point Methods for Convex Programming
• Variational Analysis
• Facial Reduction and Partial Polyhedrality
• Variational Analysis of Regular Mappings
• Facially Exposed Cones Are Not Always Nice
• Lifts of Convex Sets and Cone Factorizations
• Coordinate Shadows of Semidefinite and Euclidean Distance Matrices
• Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
• On the Closedness of the Linear Image of a Closed Convex Cone
• Exact Duality in Semidefinite Programming Based on Elementary Reformulations
• Convex Analysis
• On Homogeneous Convex Cones, The Carathéodory Number, and the Duality Mapping
• Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals

This page was built for publication: Facially Dual Complete (Nice) Cones and Lexicographic Tangents