Pages that link to "Item:Q1908926"
From MaRDI portal
The following pages link to A new algorithm for solving the general quadratic programming problem (Q1908926):
Displaying 17 items.
- A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints (Q697548) (← links)
- Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889) (← links)
- A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
- Generalization of Murty's direct algorithm to linear and convex quadratic programming (Q1106739) (← links)
- New theoretical results on recursive quadratic programming algorithms (Q1265011) (← links)
- A generalized problem of quadratic programming (Q1385919) (← links)
- Decomposition approach for the global minimization of biconcave functions over polytopes (Q1918288) (← links)
- A new algorithm for quadratic integer programming problems with cardinality constraint (Q2174794) (← links)
- A global optimization algorithm using linear relaxation (Q2507847) (← links)
- General complementary pivot algorithm of quadratic programming and application in securities investment (Q2714891) (← links)
- A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
- (Q3307194) (← links)
- (Q3686507) (← links)
- (Q3714907) (← links)
- (Q4215365) (← links)
- Duality bound method for the general quadratic programming problem with quadratic constraints (Q5925726) (← links)
- A new algorithm for the general quadratic programming problems with box constraints (Q5962186) (← links)
