Invariance and efficiency of convex representations

DOI10.1007/S10107-006-0072-6MaRDI QIDQ2467162zbMATH OpenOpenAlexFDO

Authors Chek Beng Chua, Levent Tunçel

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

zbMATH Keywords

central pathsemidefinite representations

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51) Semidefinite programming (90C22) Convex functions and convex programs in convex geometry (52A41)

Recommendations

• Limitations on the Expressive Power of Convex Cones without Long Chains of Faces
• Lifts of Convex Sets and Cone Factorizations
• Spectrahedral lifts of convex sets
• On representations of the feasible set in convex optimization
• Polynomial representations of polyhedra

Cites work

• scientific article; zbMATH DE number 715155 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 3225176 (Why is no real title available?)
• A New Notion of Weighted Centers for Semidefinite Programming
• Convex Analysis
• General interior-point maps and existence of weighted paths for nonlinear semidefinite complementarity problems.
• Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers
• Hyperbolic Polynomials and Interior Point Methods for Convex Programming
• Hyperbolic programs, and their derivative relaxations
• Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Linear matrix inequality representation of sets
• On Homogeneous Convex Cones, The Carathéodory Number, and the Duality Mapping
• On Nesterov's approach to semi-infinite programming
• Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming
• Relating Homogeneous Cones and Positive Definite Cones via T-Algebras
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Self-adjoint determinantal representations of real plane curves
• Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming
• The Lax conjecture is true

Cited in

(14)

• On minimal extended representations of generalized power cones
• Euclidean distance matrices and applications
• Bad semidefinite programs: they all look the same
• Linear optimization over homogeneous matrix cones
• Sensor network localization, Euclidean distance matrix completions, and graph realization
• Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
• Amenable cones: error bounds without constraint qualifications
• Semidefinite descriptions of low-dimensional separable matrix cones
• Facially dual complete (nice) cones and lexicographic tangents
• Exact Duality in Semidefinite Programming Based on Elementary Reformulations
• Convex sets with semidefinite representation
• Amenable cones are particularly nice
• Strong duality and minimal representations for cone optimization
• On strong duality in linear copositive programming

This page was built for publication: Invariance and efficiency of convex representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467162)