Pages that link to "Item:Q902804"
From MaRDI portal
The following pages link to A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming (Q902804):
Displaying 14 items.
- An accelerating algorithm for globally solving nonconvex quadratic programming (Q824677) (← links)
- A global optimization algorithm using parametric linearization relaxation (Q876659) (← links)
- A parametric linearizing approach for quadratically inequality constrained quadratic programs (Q1644881) (← links)
- A new global optimization algorithm for solving a class of nonconvex programming problems (Q1714710) (← links)
- An effective algorithm for globally solving quadratic programs using parametric linearization technique (Q1738251) (← links)
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
- An effective global optimization algorithm for quadratic programs with quadratic constraints (Q2335092) (← links)
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs (Q2409582) (← links)
- A global optimization algorithm using linear relaxation (Q2507847) (← links)
- Parametric Nonlinear Programming Problems under the Relaxed Constant Rank Condition (Q3004987) (← links)
- Parametric approach to a class of nonconvex global optimization problems (Q3787803) (← links)
- Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
- An efficient algorithm for computing a class of multiplicative optimization problem (Q5069808) (← links)
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems (Q6102175) (← links)
