Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming

DOI10.1080/02331930801987607zbMath1195.90065OpenAlexW1978229919MaRDI QIDQ2786313

No author found.

Publication date: 21 September 2010

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930801987607

zbMATH Keywords

lower boundsLagrangian decompositionconvex relaxationbranch-and-bound methodindefinite integer quadratic programming

Mathematics Subject Classification ID

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

Related Items (1)

An exact penalty function method for nonlinear mixed discrete programming problems

Cites Work

• Unnamed Item
• The indefinite zero-one quadratic problem
• Global minimization of indefinite quadratic problems
• A polyhedral approach for nonconvex quadratic programming problems with box constraints
• A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
• A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals
• New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
• Primal-relaxed dual global optimization approach
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• Global optimization techniques for solving the general quadratic integer programming problem
• A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
• An algorithm for global minimization of linearly constrained quadratic functions
• A branch and cut algorithm for hub location problems with single assignment
• A polyhedral study of nonconvex quadratic programs with box constraints
• An algorithm for indefinite integer quadratic programming
• Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function
• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• Numerically stable methods for quadratic programming
• The Indefinite Quadratic Programming Problem
• OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION

This page was built for publication: Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming