Linear optimization over homogeneous matrix cones

DOI10.1017/s0962492922000113arXiv2211.00761OpenAlexW4376148934MaRDI QIDQ6047504

Lieven Vandenberghe, Tunçel, Levent

Publication date: 12 September 2023

Published in: Acta Numerica (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Interior-point methods (90C51) Positive matrices and their generalizations; cones of matrices (15B48) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Numerical analysis (65-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse matrix decompositions and graph characterizations
• Existence and uniqueness of solutions for homogeneous cone complementarity problems
• Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
• Positive definite completions of partial Hermitian matrices
• Semidefinite representation of convex sets
• Parabolic target space and primal-dual interior-point methods
• Largest dual ellipsoids inscribed in dual cones
• A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements
• Positive semidefinite matrices with a given sparsity pattern
• Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Trivially perfect graphs
• Characterization of the barrier parameter of homogeneous convex cones
• Symmetric primal-dual path-following algorithms for semidefinite programming
• Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
• Wishart distributions on homogeneous cones
• A good submatrix is hard to find
• On Nesterov's approach to semi-infinite programming
• On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
• Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers
• Algorithmic graph theory and perfect graphs
• Quasi-threshold graphs
• On self-concordant barriers for generalized power cones
• A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
• Decomposition of arrow type positive semidefinite matrices with application to topology optimization
• A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
• Incidence matrices and interval graphs
• Wishart distributions for decomposable covariance graph models
• Invariance and efficiency of convex representations
• The construction of homogeneous convex cones
• Correction to 'The construction of homogeneous convex cones'
• Wishart distributions for decomposable graphs
• Long-step path-following algorithm for quantum information theory: some numerical aspects and applications
• Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
• A Mathematical View of Interior-Point Methods in Convex Optimization
• Lectures on Modern Convex Optimization
• Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization
• Matrix Realization of a Homogeneous Cone
• CVXPY: A Python-Embedded Modeling Language for Convex Optimization
• Direct Methods for Sparse Matrices
• Semidefinite Characterization of Sum-of-Squares Cones in Algebras
• Graphical methods for efficient likelihood inference in Gaussian covariance models
• EXTENSION OF THE OLKIN AND RUBIN CHARACTERIZATION TO THE WISHART DISTRIBUTION ON HOMOGENEOUS CONES
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Linear matrix inequality representation of sets
• Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems
• The Role of Elimination Trees in Sparse Factorization
• Estimation of a covariance matrix with zeros
• Interior-point methods for optimization
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• The complexity of some edge deletion problems
• The Comparability Graph of a Tree
• Computing the Minimum Fill-In is NP-Complete
• The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
• On Finding Supernodes for Sparse Matrix Computations
• Algorithmic Aspects of Vertex Elimination on Graphs
• Barrier Functions in Interior Point Methods
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Hyperbolic Polynomials and Interior Point Methods for Convex Programming
• Robust Solutions to Least-Squares Problems with Uncertain Data
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices
• Relating Homogeneous Cones and Positive Definite Cones via T-Algebras
• A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
• Spectrahedral Shadows
• Collinear scaling and sequential estimation in sparse optimization algorithms
• A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
• Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
• Alfonso: Matlab Package for Nonsymmetric Conic Optimization
• Primal-Dual Interior-Point Methods for Domain-Driven Formulations
• Lifts of Convex Sets and Cone Factorizations
• On the existence of convex decompositions of partially separable functions
• A T-Algebraic Approach to Primal-Dual Interior-Point Algorithms
• Towards non-symmetric conic optimization
• REALIZATION OF HOMOGENEOUS CONES THROUGH ORIENTED GRAPHS
• Logarithmic barriers for sparse matrix cones
• A Note on "The Comparability Graph of a Tree"
• Convex Analysis
• Graph-Theoretic Concepts in Computer Science
• The construction of homogeneous convex cones
• Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization
• Generalization of primal-dual interior-point methods to convex optimization problems in conic form