Ellipsoidal approach to box-constrained quadratic problems

DOI10.1023/B:JOGO.0000006654.34226.FEMaRDI QIDQ1424957zbMATH OpenFDO

Authors Pasquale L. De Angelis, Immanuel M. Bomze, Gerardo Toraldo

Publication date 15 March 2004

Published in Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

Global optimizationNonconvex quadratic programmingEllipsoidal constraints

Mathematics Subject Classification ID

Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1057696
• scientific article; zbMATH DE number 724207
• A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
• A binarisation heuristic for non-convex quadratic programming with box constraints
• Approximation algorithms for quadratic programming

Cited in

(9)

• Constructing test functions for global optimization using continuous formulations of graph problems
• Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
• Extensions on ellipsoid bounds for quadratic integer programming
• Ellipsoidal one-class constraint acquisition for quadratically constrained programming
• On a polynomial fractional formulation for independence number of a graph
• Convex programming with single separable constraint and bounded variables
• Lower bound improvement and forcing rule for quadratic binary programming
• On characterization of maximal independent sets via quadratic optimization
• (Global) optimization: historical notes and recent developments

This page was built for publication: Ellipsoidal approach to box-constrained quadratic problems

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