Pages that link to "Item:Q1861916"
From MaRDI portal
The following pages link to A finite algorithm for a particular D.C. quadratic programming problem (Q1861916):
Displaying 14 items.
- A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs (Q408205) (← links)
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience (Q613323) (← links)
- A branch and reduce approach for solving a class of low rank d.c. programs (Q732158) (← links)
- Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889) (← links)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- Outer approximation method incorporating a quadratic approximation for a DC programming problem (Q848730) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- Underestimation functions for a rank-two partitioning method (Q2026521) (← links)
- A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues (Q2112679) (← links)
- Global optimization of a rank-two nonconvex program (Q2379188) (← links)
- A sequential method for a class of box constrained quadratic programming problems (Q2483014) (← links)
- A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity (Q5084603) (← links)
- Rank-two programs involving linear fractional functions (Q6581918) (← links)
- An algorithm to solve multi-objective integer quadratic programming problem (Q6596965) (← links)
