Reformulations of separable quadratic optimization problems with symmetric structures via variable aggregation

DOI10.1007/S10957-026-03016-ZMaRDI QIDQ7254693zbMATH OpenFDO

Authors Guangtai Qu, Cheng Lu, Junhao Wu, Shaoze Li, Zhibin Deng, Shu-Cherng Fang

Publication date 28 May 2026

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10957-026-03016-Z

zbMATH Keywords

mixed integer programmingseparable quadratic optimizationsymmetry breaking

Mathematics Subject Classification ID

Mixed integer programming (90C11) Quadratic programming (90C20) Nonconvex programming, global optimization (90C26)

Cites work

• 50 Years of Integer Programming 1958-2008
• A branch and search algorithm for a class of nonlinear knapsack problems
• A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
• A note on multi-item inventory systems with limited capacity
• A survey on the continuous nonlinear resource allocation problem
• A unified framework for symmetry handling
• Algorithms for highly symmetric linear and integer programs
• An efficient global algorithm for a class of indefinite separable quadratic programs
• An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
• Analytical results and efficient algorithm for optimal portfolio deleveraging with market impact
• Convex Analysis
• Covering a line segment with variable radius discs
• Demand allocation with latency cost functions
• Exploiting orbits in symmetric ILP
• Exploiting symmetry in integer convex optimization using core points
• Fast computation of global solutions to the single-period unit commitment problem
• Fundamental Domains for Integer Programs with Symmetries
• Fundamental domains for symmetric optimization: construction and search
• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• Measuring the impact of primal heuristics
• Modified orbital branching for structured symmetry with an application to unit commitment
• Orbital branching
• Orbital shrinking
• Orbital shrinking: theory and applications
• Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
• Packing, partitioning, and covering symresacks
• Polytopes associated with symmetry handling
• Projected perspective reformulations with applications in design problems
• Pruning by isomorphism in branch-and-cut
• Quadratic programming with one negative eigenvalue is NP-hard
• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• Stabilizer-based symmetry breaking constraints for mathematical programs
• Symmetry groups, semidefinite programs, and sums of squares
• Symmetry in mathematical programming
• Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time

This page was built for publication: Reformulations of separable quadratic optimization problems with symmetric structures via variable aggregation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7254693)