Invariance and efficiency of convex representations
From MaRDI portal
Publication:2467162
DOI10.1007/s10107-006-0072-6zbMath1157.90010OpenAlexW2093605433MaRDI QIDQ2467162
Chek Beng Chua, Tunçel, Levent
Publication date: 21 January 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0072-6
Semidefinite programming (90C22) Convex programming (90C25) Interior-point methods (90C51) Convex functions and convex programs in convex geometry (52A41)
Related Items
On strong duality in linear copositive programming ⋮ Convex sets with semidefinite representation ⋮ Sensor network localization, Euclidean distance matrix completions, and graph realization ⋮ Strong duality and minimal representations for cone optimization ⋮ Linear optimization over homogeneous matrix cones ⋮ Bad Semidefinite Programs: They All Look the Same ⋮ Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming ⋮ Semidefinite descriptions of low-dimensional separable matrix cones ⋮ Amenable cones: error bounds without constraint qualifications ⋮ Euclidean Distance Matrices and Applications ⋮ Facially Dual Complete (Nice) Cones and Lexicographic Tangents ⋮ Exact Duality in Semidefinite Programming Based on Elementary Reformulations ⋮ Amenable Cones Are Particularly Nice
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Self-adjoint determinantal representations of real plane curves
- Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming
- On Nesterov's approach to semi-infinite programming
- Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers
- Hyperbolic programs, and their derivative relaxations
- Lectures on Modern Convex Optimization
- General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems
- Linear matrix inequality representation of sets
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Hyperbolic Polynomials and Interior Point Methods for Convex Programming
- Relating Homogeneous Cones and Positive Definite Cones via T-Algebras
- Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants
- The Lax conjecture is true
- Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming
- A New Notion of Weighted Centers for Semidefinite Programming
- Convex Analysis
- On Homogeneous Convex Cones, The Carathéodory Number, and the Duality Mapping
