A finite algorithm for a particular D.C. quadratic programming problem
The authors consider a particular d.c. quadratic programming problem its objective function is the difference of two convex quadratic functions (a d.c. function). They establish a number of theoretical properties and sufficient optimality conditions for the problem to determine a solution algorithm. Basing on ``optimal level solution method, they propose a finite algorithm for solving the problem mentioned above. This algorithm starts from a certain minimal level and then scans all the greater ones looking for the optimal solution. Note that algorithm obtained here also works in case the feasible set is unbounded.
- 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
- An algorithm for solving general D. C. programming problems
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- Underestimation functions for a rank-two partitioning method
- A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues
- Global optimization of a rank-two nonconvex program
- A sequential method for a class of box constrained quadratic programming problems
- An optimal D.C. decomposition algorithm for quadratic program with a single quadratic constraint
- A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs
- On solution of one equation with d.c. function
- A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
- The convergence of the steepest descent algorithm for D.C.optimization
- The optimal solution set of non-convex quadratic minimization problem over a D.C. set
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience
- Properties of two DC algorithms in quadratic programming
- Rank-two programs involving linear fractional functions
- An algorithm to solve multi-objective integer quadratic programming problem
- A class of differential quadratic programming problems
- A branch and reduce approach for solving a class of low rank d.c. programs
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
- Outer approximation method incorporating a quadratic approximation for a DC programming problem
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)
