:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Lu, Cheng, Fei, Yu, Zhou, Jing, Deng, Zhibin, Qu, Guangtai
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2602.19051
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Theoretical and numerical comparison of seven single-level reformulations for bilevel programs
by: Li, Yu-Wei, et al.
Published: (2025)

Optimality conditions for bilevel programs via Moreau envelope reformulation
by: Bai, Kuang, et al.
Published: (2023)

An equivalent reformulation and multi-proximity gradient algorithms for a class of nonsmooth fractional programming
by: Zhou, Junpeng, et al.
Published: (2023)

A second-order cone representable class of nonconvex quadratic programs
by: Dey, Santanu S., et al.
Published: (2025)

Finding quadratic underestimators for optimal value functions of nonconvex all-quadratic problems via copositive optimization
by: Gabl, Markus, et al.
Published: (2024)

Tractable reformulations of DRO problems over structured optimal transport ambiguity sets
by: Chaouach, Lotfi M., et al.
Published: (2025)

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

MIQCQP reformulation of the ReLU neural networks Lipschitz constant estimation problem
by: Sbihi, Mohammed, et al.
Published: (2024)

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

A reformulation-enumeration MINLP algorithm for gas network design
by: Li, Yijiang, et al.
Published: (2023)

The large-scale charging scheduling problem for fleet batteries: Lagrangian decomposition with time-block reformulations
by: Fotedar, Sunney, et al.
Published: (2025)

First-order algorithms for robust optimization problems via convex-concave saddle-point Lagrangian reformulation
by: Postek, Krzysztof, et al.
Published: (2021)

Duality-based single-level reformulations of bilevel optimization problems
by: Dempe, Stephan, et al.
Published: (2024)

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

An ideal-sparse generalized moment problem reformulation for completely positive tensor decomposition exploiting maximal cliques of multi-hypergraphs
by: Huang, Pengfei, et al.
Published: (2025)

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

Uncertainty relation and the constrained quadratic programming
by: Zhang, Lin, et al.
Published: (2024)

PolyFormer: learning efficient reformulations for scalable optimization under complex physical constraints
by: Wen, Yilin, et al.
Published: (2026)

Fast algorithm for sparse least trimmed squares via trimmed-regularized reformulation
by: Yagishita, Shotaro
Published: (2024)

A novel strong duality-based reformulation for trilevel infrastructure models in energy systems development
by: Herrala, Olli, et al.
Published: (2023)

On the required number of electrodes for uniqueness and convex reformulation in an inverse coefficient problem
by: Brojatsch, Andrej, et al.
Published: (2024)

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

On semidefinite descriptions for convex hulls of quadratic programs
by: Wang, Alex L., et al.
Published: (2024)

A convex reformulation for speed planning of a vehicle under the travel time and energy consumption objectives
by: Consolini, Luca, et al.
Published: (2025)

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

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

Local convergence analysis of stabilized sequential quadratic programming methods for optimization problems in Banach spaces
by: Yamakawa, Yuya
Published: (2025)

Fix and Bound: An efficient approach for solving large-scale quadratic programming problems with box constraints
by: Locatelli, Marco, et al.
Published: (2022)

Convex NMPC reformulations for a special class of nonlinear multi-input systems with application to rank-one bilinear networks
by: Klädtke, Manuel, et al.
Published: (2023)

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

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

Chebyshev centers and radii for sets induced by quadratic matrix inequalities
by: Shakouri, Amir, et al.
Published: (2024)

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)

Parallel splitting method for large-scale quadratic programs
by: Vandelli, Matteo, et al.
Published: (2025)

Provably data-driven projection method for quadratic programming
by: Nguyen, Anh Tuan, et al.
Published: (2025)

Adaptive projected SOR algorithms for nonnegative quadratic programming
by: Miyatake, Yuto, et al.
Published: (2021)

Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems
by: Zeng, Liaoyuan, et al.
Published: (2021)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
by: Zhou, Junpeng, et al.
Published: (2025)

Necessary conditions for turnpike property for generalized linear-quadratic problems
by: Guglielmi, Roberto, et al.
Published: (2024)