Image de couverture de livre

New reformulations for 0-1 quadratic programming problem using quadratic nonconvex reformulation techniques and valid inequalities

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lu, Cheng, Fei, Yu, Zhou, Jing, Deng, Zhibin, Qu, Guangtai
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

Concave tents: a new tool for constructing concave reformulations of a large class of nonconvex optimization problems
par: Gabl, Markus
Publié: (2024)

Theoretical and numerical comparison of seven single-level reformulations for bilevel programs
par: Li, Yu-Wei, et autres
Publié: (2025)

Optimality conditions for bilevel programs via Moreau envelope reformulation
par: Bai, Kuang, et autres
Publié: (2023)

An equivalent reformulation and multi-proximity gradient algorithms for a class of nonsmooth fractional programming
par: Zhou, Junpeng, et autres
Publié: (2023)

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

Finding quadratic underestimators for optimal value functions of nonconvex all-quadratic problems via copositive optimization
par: Gabl, Markus, et autres
Publié: (2024)

Tractable reformulations of DRO problems over structured optimal transport ambiguity sets
par: Chaouach, Lotfi M., et autres
Publié: (2025)

A reformulation to Embedding a Neural Network in a linear program without integer variables
par: -de-Alba, Héctor G., et autres
Publié: (2024)

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

A reformulation-enumeration MINLP algorithm for gas network design
par: Li, Yijiang, et autres
Publié: (2023)

The large-scale charging scheduling problem for fleet batteries: Lagrangian decomposition with time-block reformulations
par: Fotedar, Sunney, et autres
Publié: (2025)

MIQCQP reformulation of the ReLU neural networks Lipschitz constant estimation problem
par: Sbihi, Mohammed, et autres
Publié: (2024)

First-order algorithms for robust optimization problems via convex-concave saddle-point Lagrangian reformulation
par: Postek, Krzysztof, et autres
Publié: (2021)

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

An ideal-sparse generalized moment problem reformulation for completely positive tensor decomposition exploiting maximal cliques of multi-hypergraphs
par: Huang, Pengfei, et autres
Publié: (2025)

Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations
par: Buchheim, Christoph
Publié: (2023)

A novel strong duality-based reformulation for trilevel infrastructure models in energy systems development
par: Herrala, Olli, et autres
Publié: (2023)

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

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

Duality-based single-level reformulations of bilevel optimization problems
par: Dempe, Stephan, et autres
Publié: (2024)

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

Fast algorithm for sparse least trimmed squares via trimmed-regularized reformulation
par: Yagishita, Shotaro
Publié: (2024)

PolyFormer: learning efficient reformulations for scalable optimization under complex physical constraints
par: Wen, Yilin, et autres
Publié: (2026)

A convex reformulation for speed planning of a vehicle under the travel time and energy consumption objectives
par: Consolini, Luca, et autres
Publié: (2025)

Tight semidefinite programming relaxations for sparse box-constrained quadratic programs
par: Khajavirad, Aida
Publié: (2026)

Local convergence analysis of stabilized sequential quadratic programming methods for optimization problems in Banach spaces
par: Yamakawa, Yuya
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)

Convex NMPC reformulations for a special class of nonlinear multi-input systems with application to rank-one bilinear networks
par: Klädtke, Manuel, et autres
Publié: (2023)

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)

Chebyshev centers and radii for sets induced by quadratic matrix inequalities
par: Shakouri, Amir, et autres
Publié: (2024)

On the required number of electrodes for uniqueness and convex reformulation in an inverse coefficient problem
par: Brojatsch, Andrej, et autres
Publié: (2024)

A more efficient reformulation of complex SDP as real SDP
par: Wang, Jie
Publié: (2023)

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)

Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems
par: Zeng, Liaoyuan, et autres
Publié: (2021)

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)

Parallel splitting method for large-scale quadratic programs
par: Vandelli, Matteo, et autres
Publié: (2025)

Provably data-driven projection method for quadratic programming
par: Nguyen, Anh Tuan, et autres
Publié: (2025)

Adaptive projected SOR algorithms for nonnegative quadratic programming
par: Miyatake, Yuto, et autres
Publié: (2021)

Necessary conditions for turnpike property for generalized linear-quadratic problems
par: Guglielmi, Roberto, et autres
Publié: (2024)