Image de couverture de livre

Tight semidefinite programming relaxations for sparse box-constrained quadratic programs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Khajavirad, Aida
Format:	Preprint
Publié:	2026
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A polynomial-time solvable class of sparse box-constrained polynomial optimization problems
par: Khajavirad, Aida
Publié: (2026)

A second-order cone representable class of nonconvex quadratic programs
par: Dey, Santanu S., et autres
Publié: (2025)

Superlinear and quadratic convergence of a stabilized sequential quadratic semidefinite programming method for nonlinear semidefinite programming problems
par: Yamakawa, Yuya
Publié: (2022)

On semidefinite descriptions for convex hulls of quadratic programs
par: Wang, Alex L., et autres
Publié: (2024)

Model-free stochastic linear quadratic design by semidefinite programming
par: Guo, Jing, et autres
Publié: (2024)

The complete edge relaxation for binary polynomial optimization
par: Del Pia, Alberto, et autres
Publié: (2025)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
par: Marumo, Hiroki, et autres
Publié: (2024)

The circle packing problem: a theoretical comparison of various convexification techniques
par: Khajavirad, Aida
Publié: (2024)

A quadratically convergent semismooth Newton method for nonlinear semidefinite programming without generalized Jacobian regularity
par: Feng, Fuxiaoyue, et autres
Publié: (2024)

Uncertainty relation and the constrained quadratic programming
par: Zhang, Lin, et autres
Publié: (2024)

On the strength of Burer's lifted convex relaxation to quadratic programming with ball constraints
par: Kılınç-Karzan, Fatma, et autres
Publié: (2024)

Inference in higher-order undirected graphical models and binary polynomial optimization
par: Khajavirad, Aida, et autres
Publié: (2024)

Tight SDP relaxations for cardinality-constrained problems
par: Wiegele, Angelika, et autres
Publié: (2021)

Tilt stability of a class of nonlinear semidefinite programs
par: Liu, Yulan, et autres
Publié: (2024)

Model-free stochastic linear quadratic control for discrete-time systems with multiplicative and additive noises via semidefinite programming
par: Guo, Jing, et autres
Publié: (2025)

A combinatorial approach to Ramana's exact dual for semidefinite programming
par: Pataki, Gabor
Publié: (2025)

An efficient primal dual semismooth Newton method for semidefinite programming
par: Deng, Zhanwang, et autres
Publié: (2025)

Shannon-and von neumann-entropy regularizations of linear and semidefinite programs
par: Chhatoi, Saroj Prasad, et autres
Publié: (2025)

Fix and Bound: An efficient approach for solving large-scale quadratic programming problems with box constraints
par: Locatelli, Marco, et autres
Publié: (2022)

On the power of linear programming for K-means clustering
par: De Rosa, Antonio, et autres
Publié: (2024)

Rank-one Boolean tensor factorization and the multilinear polytope
par: Del Pia, Alberto, et autres
Publié: (2022)

Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization
par: Del Pia, Alberto, et autres
Publié: (2024)

Extended formulations for the multilinear polytope of acyclic hypergraphs
par: Del Pia, Alberto, et autres
Publié: (2025)

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
par: Del Pia, Alberto, et autres
Publié: (2023)

Truss topology design under harmonic loads: Peak power minimization with semidefinite programming
par: Ma, Shenyuan, et autres
Publié: (2024)

A class of nonconvex semidefinite programming in which every KKT point is globally optimal
par: Nishioka, Akatsuki, et autres
Publié: (2025)

Instance-specific linear relaxations of semidefinite optimization problems
par: de Roux, Daniel, et autres
Publié: (2023)

Rank conditions for exactness of semidefinite relaxations in polynomial optimization
par: Lasserre, Jean B
Publié: (2025)

Understanding Christensen-Sinclair factorization via semidefinite programming
par: Escudero-Gutiérrez, Francisco
Publié: (2024)

Accelerated first-order methods for a class of semidefinite programs
par: Wang, Alex L., et autres
Publié: (2022)

A twice continuously differentiable penalty function for nonlinear semidefinite programming problems and its application
par: Yamakawa, Yuya
Publié: (2025)

Sensitivity analysis for mixed binary quadratic programming
par: Cifuentes, Diego, et autres
Publié: (2023)

Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
par: Tang, Tianyun, et autres
Publié: (2024)

The Mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints
par: Wang, Po-Wei, et autres
Publié: (2017)

Breaking barriers in two-party quantum cryptography via stochastic semidefinite programming
par: Bansal, Akshay, et autres
Publié: (2023)

Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming
par: Cai, Yuhang, et autres
Publié: (2025)

Optimality of spherical codes via exact semidefinite programming bounds
par: Cohn, Henry, et autres
Publié: (2024)

Certifying solutions of degenerate semidefinite programs
par: Kolmogorov, Vladimir, et autres
Publié: (2024)

Curvature batching gives single-exponential integer quadratic programming
par: Ari, Cinar, et autres
Publié: (2026)

Clarabel: An interior-point solver for conic programs with quadratic objectives
par: Goulart, Paul J., et autres
Publié: (2024)