Cover Image

Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bomze, Immanuel, Peng, Bo, Qiu, Yuzhou, Yildirim, E. Alper
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C11, 90C20, 90C22
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs
by: Yildirim, E. Alper
Published: (2025)

Feature selection in linear SVMs via a hard cardinality constraint: a scalable SDP decomposition approach
by: Bomze, Immanuel, 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)

Spectral Outer-Approximation Algorithms for Binary Semidefinite Problems
by: de Roux, Daniel, et al.
Published: (2025)

A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
by: Hou, Di, et al.
Published: (2025)

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

A Safe Approximation Based on Mixed-Integer Optimization for Non-Convex Distributional Robustness Governed by Univariate Indicator Functions
by: Dienstbier, Jana, et al.
Published: (2023)

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
by: Gómez-Casares, Ignacio, et al.
Published: (2025)

A Frank-Wolfe-based primal heuristic for quadratic mixed-integer optimization
by: Mexi, Gioni, et al.
Published: (2025)

A Positive Semidefinite Safe Approximation of Multivariate Distributionally Robust Constraints Determined by Simple Functions
by: Dienstbier, J., et al.
Published: (2023)

On exactness of SDP relaxation for the maximum cut problem
by: Bhardwaj, Avinash, et al.
Published: (2025)

Beyond binarity: Semidefinite programming for ternary quadratic problems
by: de Meijer, Frank, et al.
Published: (2026)

On the convexity for the range set of two quadratic functions
by: Nguyen, Huu-Quang, et al.
Published: (2025)

Sparse convex relaxations in polynomial optimization
by: Averkov, Gennadiy, et al.
Published: (2024)

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

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
by: Borges, Jennifer C., et al.
Published: (2026)

Second-order sequential optimality conditions for nonlinear semidefinite optimization problems
by: Li, Huimin, et al.
Published: (2025)

Convex quadratic sets and the complexity of mixed integer convex quadratic programming
by: Del Pia, Alberto
Published: (2023)

An efficient proximal algorithm for squared L1 over L2 regularized sparse recovery
by: Zhang, Na, et al.
Published: (2025)

Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization
by: Deng, Kangkang, et al.
Published: (2024)

Duality attainment and strict feasibility of the generalized moment problem and its relaxations
by: Halaseh, Sami, et al.
Published: (2026)

The Maximum Clique Problem under Adversarial Uncertainty: a min-max approach
by: Bomze, Immanuel, et al.
Published: (2026)

Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel
by: Slot, Lucas
Published: (2021)

A more efficient reformulation of complex SDP as real SDP
by: Wang, Jie
Published: (2023)

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
by: Slot, Lucas, et al.
Published: (2024)

Surrogate-based categorical neighborhoods for mixed-variable blackbox optimization
by: Audet, Charles, et al.
Published: (2026)

CatMADS: Mesh Adaptive Direct Search for constrained blackbox optimization with categorical variables
by: Audet, Charles, et al.
Published: (2025)

Lagrangian cuts generated by batch to efficiently solve two-stage stochastic mixed-integer program
by: Xiaoyu, Luo, et al.
Published: (2024)

Adjustable Robust Nonlinear Network Design Without Controllable Elements under Load Scenario Uncertainties
by: Thürauf, Johannes, et al.
Published: (2024)

On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem
by: Habibi, Soodeh, et al.
Published: (2024)

Bundle methods with quadratic cuts for deterministic and stochastic strongly convex optimization problems
by: Guigues, Vincent, et al.
Published: (2017)

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

Sparse Polynomial Optimization with Unbounded Sets
by: Huang, Lei, et al.
Published: (2024)

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

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
by: Guo, Feng, et al.
Published: (2023)

Sparse Polynomial Matrix Optimization
by: Miller, Jared, et al.
Published: (2024)

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

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
by: Qu, Zheng, et al.
Published: (2023)

A minimal face constant rank constraint qualification for reducible conic programming
by: Andreani, Roberto, et al.
Published: (2023)

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