Linear optimization over homogeneous matrix cones (Q6047504)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7736660

Language	Label	Description	Also known as
English	Linear optimization over homogeneous matrix cones	scientific article; zbMATH DE number 7736660

Statements

scholarly article

0 references

Linear optimization over homogeneous matrix cones (English)

0 references

Tunçel, Levent

0 references

Lieven Vandenberghe

0 references

0 references

publication date

12 September 2023

0 references

full work available at URL

https://arxiv.org/abs/2211.00761

0 references

MaRDI profile type

MaRDI publication profile

0 references

Positive semidefinite matrices with a given sparsity pattern

0 references

Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones

0 references

Logarithmic barriers for sparse matrix cones

0 references

Wishart distributions on homogeneous cones

0 references

Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization

0 references

A good submatrix is hard to find

0 references

Lectures on Modern Convex Optimization

0 references

0 references

Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization

0 references

0 references

0 references

EXTENSION OF THE OLKIN AND RUBIN CHARACTERIZATION TO THE WISHART DISTRIBUTION ON HOMOGENEOUS CONES

0 references

0 references

Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices

0 references

Estimation of a covariance matrix with zeros

0 references

A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements

0 references

Relating Homogeneous Cones and Positive Definite Cones via <i>T</i>-Algebras

0 references

A <i>T</i>-Algebraic Approach to Primal-Dual Interior-Point Algorithms

0 references

Invariance and efficiency of convex representations

0 references

Graph-Theoretic Concepts in Computer Science

0 references

A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization

0 references

CVXPY: A Python-Embedded Modeling Language for Convex Optimization

0 references

Graphical methods for efficient likelihood inference in Gaussian covariance models

0 references

The Multifrontal Solution of Indefinite Sparse Symmetric Linear

0 references

Direct Methods for Sparse Matrices

0 references

Robust Solutions to Least-Squares Problems with Uncertain Data

0 references

The complexity of some edge deletion problems

0 references

On Nesterov's approach to semi-infinite programming

0 references

Long-step path-following algorithm for quantum information theory: some numerical aspects and applications

0 references

Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework

0 references

Incidence matrices and interval graphs

0 references

0 references

0 references

Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition

0 references

Trivially perfect graphs

0 references

Algorithmic graph theory and perfect graphs

0 references

Lifts of Convex Sets and Cone Factorizations

0 references

On the existence of convex decompositions of partially separable functions

0 references

Positive definite completions of partial Hermitian matrices

0 references

Barrier Functions in Interior Point Methods

0 references

Hyperbolic Polynomials and Interior Point Methods for Convex Programming

0 references

Characterization of the barrier parameter of homogeneous convex cones

0 references

Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing

0 references

Semidefinite representation of convex sets

0 references

Linear matrix inequality representation of sets

0 references

Matrix Realization of a Homogeneous Cone

0 references

A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming

0 references

Primal-Dual Interior-Point Methods for Domain-Driven Formulations

0 references

Wishart distributions for decomposable covariance graph models

0 references

Sparse matrix decompositions and graph characterizations

0 references

Decomposition of arrow type positive semidefinite matrices with application to topology optimization

0 references

A unified approach to interior point algorithms for linear complementarity problems: A summary

0 references

Existence and uniqueness of solutions for homogeneous cone complementarity problems

0 references

0 references

Wishart distributions for decomposable graphs

0 references

The Role of Elimination Trees in Sparse Factorization

0 references

The Multifrontal Method for Sparse Matrix Solution: Theory and Practice

0 references

On Finding Supernodes for Sparse Matrix Computations

0 references

A Polynomial Approximation Algorithm for the Minimum Fill-In Problem

0 references

0 references

Interior-point methods for optimization

0 references

0 references

Parabolic target space and primal-dual interior-point methods

0 references

Towards non-symmetric conic optimization

0 references

0 references

Self-Scaled Barriers and Interior-Point Methods for Convex Programming

0 references

Primal-Dual Interior-Point Methods for Self-Scaled Cones

0 references

On the Riemannian geometry defined by self-concordant barriers and interior-point methods.

0 references

Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems

0 references

Semidefinite Characterization of Sum-of-Squares Cones in Algebras

0 references

Alfonso: Matlab Package for Nonsymmetric Conic Optimization

0 references

0 references

A Mathematical View of Interior-Point Methods in Convex Optimization

0 references

Convex Analysis

0 references

Algorithmic Aspects of Vertex Elimination on Graphs

0 references

The construction of homogeneous convex cones

0 references

The construction of homogeneous convex cones

0 references

Correction to 'The construction of homogeneous convex cones'

0 references

On self-concordant barriers for generalized power cones

0 references

Spectrahedral Shadows

0 references

A homogeneous interior-point algorithm for nonsymmetric convex conic optimization

0 references

Collinear scaling and sequential estimation in sparse optimization algorithms

0 references

Symmetric primal-dual path-following algorithms for semidefinite programming

0 references

Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs

0 references

Largest dual ellipsoids inscribed in dual cones

0 references

Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers

0 references

Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization

0 references

Generalization of primal-dual interior-point methods to convex optimization problems in conic form

0 references

0 references

0 references

The Comparability Graph of a Tree

0 references

A Note on "The Comparability Graph of a Tree"

0 references

REALIZATION OF HOMOGENEOUS CONES THROUGH ORIENTED GRAPHS

0 references

Quasi-threshold graphs

0 references

Computing the Minimum Fill-In is NP-Complete

0 references

Identifiers

0 references

10.1017/s0962492922000113

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6047504

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6047504&oldid=37557827"