A finite algorithm for a particular D.C. quadratic programming problem
From MaRDI portal
Publication:1861916
DOI10.1023/A:1021509220392zbMath1041.90036OpenAlexW32713153MaRDI QIDQ1861916
Claudio Sodini, Riccardo Cambini
Publication date: 10 March 2003
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021509220392
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31)
Related Items (11)
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation ⋮ Global optimization of a rank-two nonconvex program ⋮ A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity ⋮ Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience ⋮ A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs ⋮ New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation ⋮ A sequential method for a class of box constrained quadratic programming problems ⋮ Underestimation functions for a rank-two partitioning method ⋮ A branch and reduce approach for solving a class of low rank d.c. programs ⋮ A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues ⋮ Decomposition methods for solving nonconvex quadratic programs via branch and bound
This page was built for publication: A finite algorithm for a particular D.C. quadratic programming problem
