New optimality conditions for quadratic optimization problems with binary constraints

DOI10.1007/s11590-008-0105-6zbMath1173.90495OpenAlexW2039283839MaRDI QIDQ1024733

Yong Xia

Publication date: 17 June 2009

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-008-0105-6

zbMATH Keywords

integer programmingquadratic programmingoptimality conditionsnonconvex optimization

Mathematics Subject Classification ID

Integer programming (90C10) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

We Found 4 Related Items (max. 100)

Global optimality conditions for fixed charge quadratic programs ⋮ The unconstrained binary quadratic programming problem: a survey ⋮ A new penalty parameter for linearly constrained 0--1 quadratic programming problems ⋮ An efficient Lagrangian smoothing heuristic for max-cut

Uses Software

• GQTPAR
• HSL-VF05

Cites Work

• Topics in semidefinite and interior-point methods
• Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
• Computing a Trust Region Step
• Solving the Trust-Region Subproblem using the Lanczos Method
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New optimality conditions for quadratic optimization problems with binary constraints