A finite algorithm for a particular D.C. quadratic programming problem

DOI10.1023/A:1021509220392MaRDI QIDQ1861916zbMATH OpenOpenAlexFDO

Authors Riccardo Cambini, Claudio Sodini

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

zbMATH Keywords

optimal level solution method

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• An algorithm for solving general D. C. programming problems
• On solving a d.c. programming problem by a sequence of linear programs
• A modified version of Tuy's method for solving d.c. programing problem
• Properties of two DC algorithms in quadratic programming
• A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem

Cited in

(20)

• A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
• A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
• Global optimization of a rank-two nonconvex program
• A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs
• A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues
• Outer approximation method incorporating a quadratic approximation for a DC programming problem
• Rank-two programs involving linear fractional functions
• An algorithm to solve multi-objective integer quadratic programming problem
• A branch and reduce approach for solving a class of low rank d.c. programs
• Underestimation functions for a rank-two partitioning method
• Properties of two DC algorithms in quadratic programming
• The convergence of the steepest descent algorithm for D.C.optimization
• Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience
• A sequential method for a class of box constrained quadratic programming problems
• Decomposition methods for solving nonconvex quadratic programs via branch and bound
• An optimal D.C. decomposition algorithm for quadratic program with a single quadratic constraint
• The optimal solution set of non-convex quadratic minimization problem over a D.C. set
• On solution of one equation with d.c. function
• New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
• A class of differential quadratic programming problems

This page was built for publication: A finite algorithm for a particular D.C. quadratic programming problem

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