Cover Image

Everything is possible: constructing spectrahedra with prescribed facial dimensions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Roshchina, Vera, Tunçel, Levent
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control Combinatorics 90C22, 90C25, 52A38
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On generators of $k$-PSD closures of the positive semidefinite cone
by: Bhardwaj, Avinash, et al.
Published: (2024)

A Computational Search for Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
by: Au, Yu Hin, et al.
Published: (2025)

Two Proofs of a Structural Theorem of Decreasing Minimization on Integrally Convex Sets
by: Murota, Kazuo, et al.
Published: (2025)

Stable Set Polytopes with Rank $|V(G)|/3$ for the Lovász--Schrijver SDP Operator
by: Au, Yu Hin, et al.
Published: (2025)

Generalizations of Total Dual Integrality
by: Guenin, Bertrand, et al.
Published: (2025)

New complexity bounds for primal--dual interior-point algorithms in conic optimization
by: Dahl, Joachim, et al.
Published: (2025)

On the geometry of circumcentric directions of cones
by: Bello-Cruz, Yunier
Published: (2026)

Fast convergence of Frank-Wolfe algorithms on polytopes
by: Wirth, Elias, et al.
Published: (2024)

Exposed extreme rays of the SONC cone
by: Dressler, Mareike, et al.
Published: (2025)

Aggregating regular norms
by: Juditsky, Anatoli, et al.
Published: (2022)

Linear Threshold for Oertel's Conjecture on the Mixed-Integer Volume
by: Cheng, Hongyu, et al.
Published: (2026)

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions
by: Tauheed, et al.
Published: (2026)

Sparsification of sums with respect to convex cones
by: Saunderson, James
Published: (2025)

Gauges and Accelerated Optimization over Smooth and/or Strongly Convex Sets
by: Liu, Ning, et al.
Published: (2023)

Solving exact and noisy rank-one tensor completion with semidefinite programming
by: Cifuentes, Diego, et al.
Published: (2025)

A squared smoothing Newton method for semidefinite programming
by: Liang, Ling, et al.
Published: (2023)

On Second-Order Cone Functions
by: Jibrin, Shafiu, et al.
Published: (2023)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
by: Hou, Di, et al.
Published: (2025)

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
by: Namchaisiri, Charles, et al.
Published: (2024)

Solving Sparsity Constrained PCA, Regression, and QCQP via the Spartrahedron
by: Cifuentes, Diego, et al.
Published: (2026)

Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
by: Tang, Tianyun, et al.
Published: (2024)

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
by: Namchaisiri, Charles, et al.
Published: (2024)

Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation
by: Wang, Jie
Published: (2022)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
by: Marumo, Hiroki, et al.
Published: (2024)

Determining inscribability of polytopes via rank minimization based on slack matrices
by: Chen, Yiwen, et al.
Published: (2025)

Non-facial exposedness of copositive cones over symmetric cones
by: Nishijima, Mitsuhiro, et al.
Published: (2024)

Faster Parametric Submodular Function Minimization by Exploiting Duality
by: Gupta, Swati, et al.
Published: (2026)

Shapley-Folkman-type Theorem for Integrally Convex Sets
by: Murota, Kazuo, et al.
Published: (2023)

Sum-of-squares certificates for symmetric polynomials on the hypercube: a counterexample to a conjecture of De Klerk and Laurent
by: Polak, Sven
Published: (2026)

A Level Set Method with Secant Iterations for the Least-Squares Constrained Nuclear Norm Minimization
by: Ma, Chiyu, et al.
Published: (2026)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
by: Arima, Naohiko, et al.
Published: (2023)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
by: Im, Haesol, et al.
Published: (2024)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
by: Arima, Naohiko, et al.
Published: (2024)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
by: Kojima, Masakazu, et al.
Published: (2025)

Separable QCQPs and Their Exact SDP Relaxations
by: Kojima, Masakazu, et al.
Published: (2026)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
by: Kojima, Masakazu, et al.
Published: (2025)

Strong Variational Sufficiency for Nonlinear Semidefinite Programming and its Implications
by: Wang, Shiwei, et al.
Published: (2022)

Hidden convexity, optimization, and algorithms on rotation matrices
by: Ramachandran, Akshay, et al.
Published: (2023)

Copositive and completely positive cones over symmetric cones of rank at least 5
by: Nishijima, Mitsuhiro
Published: (2026)

Average-case thresholds for exact regularization of linear programs
by: Friedlander, Michael P., et al.
Published: (2025)