Unconstrained formulation of standard quadratic optimization problems

DOI10.1007/s11750-010-0166-4zbMath1401.90141OpenAlexW2096073777MaRDI QIDQ1935878

Immanuel M. Bomze, Laura Palagi, Luigi Grippo

Publication date: 20 February 2013

Published in: Top (Search for Journal in Brave)

Full work available at URL: http://eprints.bice.rm.cnr.it/3022/1/8868.pdf

zbMATH Keywords

maximum cliqueexact penalizationstandard quadratic optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20)

Related Items

Using SVM to combine global heuristics for the standard quadratic problem, On a continuous approach for the maximum weighted clique problem, Standard bi-quadratic optimization problems and unconstrained polynomial reformulations, A class of differential quadratic programming problems, Some remarks on duality and optimality of a class of constrained convex quadratic minimization problems, A study on sequential minimal optimization methods for standard quadratic problems

Uses Software

• SDPLR
• DIMACS

Cites Work

• On standard quadratic optimization problems
• Evolution towards the maximum clique
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
• Quartic formulation of standard quadratic optimization problems
• The eigenvalue complementarity problem
• The symmetric eigenvalue complementarity problem
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item