Cover Image

On semidefinite descriptions for convex hulls of quadratic programs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wang, Alex L., Kilinc-Karzan, Fatma
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Accelerated first-order methods for a class of semidefinite programs
by: Wang, Alex L., et al.
Published: (2022)

On the strength of Burer's lifted convex relaxation to quadratic programming with ball constraints
by: Kılınç-Karzan, Fatma, et al.
Published: (2024)

From Majorization to Scaling: Advancing Convex Relaxations of Maximum Entropy Sampling Problem
by: Shen, Lingqing, et al.
Published: (2026)

Parameter-Free Non-Ergodic Extragradient Algorithms for Solving Monotone Variational Inequalities
by: Shen, Lingqing, et al.
Published: (2026)

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

Tight semidefinite programming relaxations for sparse box-constrained quadratic programs
by: Khajavirad, Aida
Published: (2026)

Efficient Online Large-Margin Classification via Dual Certificates
by: Ho-Nguyen, Nam, et al.
Published: (2025)

Model-free stochastic linear quadratic design by semidefinite programming
by: Guo, Jing, et al.
Published: (2024)

A quadratically convergent semismooth Newton method for nonlinear semidefinite programming without generalized Jacobian regularity
by: Feng, Fuxiaoyue, et al.
Published: (2024)

On disjunction convex hulls by lifting
by: Qu, Yushan, et al.
Published: (2024)

On the convex hull of the graph of a simple monomial
by: Lee, Jon, et al.
Published: (2026)

Model-free stochastic linear quadratic control for discrete-time systems with multiplicative and additive noises via semidefinite programming
by: Guo, Jing, et al.
Published: (2025)

Mistake, Manipulation and Margin Guarantees in Online Strategic Classification
by: Shen, Lingqing, et al.
Published: (2024)

Tilt stability of a class of nonlinear semidefinite programs
by: Liu, Yulan, et al.
Published: (2024)

A combinatorial approach to Ramana's exact dual for semidefinite programming
by: Pataki, Gabor
Published: (2025)

An efficient primal dual semismooth Newton method for semidefinite programming
by: Deng, Zhanwang, et al.
Published: (2025)

Shannon-and von neumann-entropy regularizations of linear and semidefinite programs
by: Chhatoi, Saroj Prasad, et al.
Published: (2025)

Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
by: Giang-Tran, Khanh-Hung, et al.
Published: (2025)

Reinforcement learning for adaptive interior point methods in convex quadratic programming
by: Bertoncini, Jeremy, et al.
Published: (2025)

Truss topology design under harmonic loads: Peak power minimization with semidefinite programming
by: Ma, Shenyuan, et al.
Published: (2024)

A class of nonconvex semidefinite programming in which every KKT point is globally optimal
by: Nishioka, Akatsuki, et al.
Published: (2025)

New numerical solutions to Newton's problem of least resistance via a convex hull approach
by: Wachsmuth, Gerd
Published: (2025)

The Mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints
by: Wang, Po-Wei, et al.
Published: (2017)

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

Dual first-order methods for efficient computation of convex hull prices
by: Tanji, Sofiane, et al.
Published: (2025)

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

New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs
by: Wang, Alex L., et al.
Published: (2021)

Breaking barriers in two-party quantum cryptography via stochastic semidefinite programming
by: Bansal, Akshay, et al.
Published: (2023)

Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming
by: Cai, Yuhang, et al.
Published: (2025)

Knapsack with compactness: a semidefinite approach
by: Villuendas, Hubert, et al.
Published: (2025)

Sensitivity analysis for mixed binary quadratic programming
by: Cifuentes, Diego, et al.
Published: (2023)

Optimality of spherical codes via exact semidefinite programming bounds
by: Cohn, Henry, et al.
Published: (2024)

Sharpness and well-conditioning of nonsmooth convex formulations in statistical signal recovery
by: Ding, Lijun, et al.
Published: (2023)

On the integrality gap of convex mixed-integer programs
by: Kocuk, Burak, et al.
Published: (2024)

Dynamic programming and dimensionality in convex stochastic optimization and control
by: Pennanen, Teemu, et al.
Published: (2025)

Closest univariate convex linear-quadratic function approximation with minimal number of Pieces
by: Kundu, Namrata, et al.
Published: (2025)

Clarabel: An interior-point solver for conic programs with quadratic objectives
by: Goulart, Paul J., et al.
Published: (2024)

Curvature batching gives single-exponential integer quadratic programming
by: Ari, Cinar, et al.
Published: (2026)

Instance-specific linear relaxations of semidefinite optimization problems
by: de Roux, Daniel, et al.
Published: (2023)

Rank conditions for exactness of semidefinite relaxations in polynomial optimization
by: Lasserre, Jean B
Published: (2025)