Invariance and efficiency of convex representations
In this paper the authors consider two notions for the representations of convex cones \(G\)-representation and lifted-\(G\)-representation. The former represents a convex cone as a slice of an another; the latter allows in addition, the usage of auxiliary variables in the representation. The authors first study the basic properties of these representations. They show that some basic properties of convex cones are invariant under one notion of representation but not the other. In particular, they prove that lifted-\(G\)-representation is closed under duality when the representing cone is self-dual. They also prove that strict complementarity of a convex optimization problem in conic form is preserved under \(G\)-representations. Then they move to study efficiency measures for representations. They evaluate the representations of homogeneous convex cones based on the ``smoothness of the transformations mapping the central path of the representation to the central path of the represented optimization problem.
- 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
- 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?)
- 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-adjoint determinantal representations of real plane curves
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming
- The Lax conjecture is true
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- Strong duality and minimal representations for cone optimization
- On strong duality in linear copositive programming
- Amenable cones: error bounds without constraint qualifications
- Convex sets with semidefinite representation
- Euclidean distance matrices and applications
- Bad semidefinite programs: they all look the same
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Facially dual complete (nice) cones and lexicographic tangents
- Exact Duality in Semidefinite Programming Based on Elementary Reformulations
- Amenable cones are particularly nice
- Linear optimization over homogeneous matrix cones
- On minimal extended representations of generalized power cones
- Minimal hyperbolic polynomials and ranks of homogeneous cones
- Non-facial exposedness of copositive cones over symmetric cones
- Semidefinite descriptions of low-dimensional separable matrix cones
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)
