Pages that link to "Item:Q1724769"
From MaRDI portal
The following pages link to A novel optimization method for nonconvex quadratically constrained quadratic programs (Q1724769):
Displaying 18 items.
- An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- A generalized design approach to solution of the non-convex quadratic programming problem (Q1095032) (← links)
- A non-interior path following method for convex quadratic programming problems with bound constraints (Q1430274) (← links)
- An effective algorithm for globally solving quadratic programs using parametric linearization technique (Q1738251) (← links)
- Nonmonotone strategy for minimization of quadratics with simple constraints. (Q1771833) (← links)
- On solving quadratically constrained quadratic programming problem with one non-convex constraint (Q1790405) (← links)
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs (Q2088967) (← 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)
- A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs (Q2389836) (← links)
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs (Q2409582) (← links)
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems (Q2572774) (← links)
- Computational methods for solving nonconvex block-separable constrained quadratic problems (Q2810546) (← links)
- An unconstrained convex programming approach to solving convex quadratic programming problems (Q3835665) (← links)
- (Q4397866) (← links)
- A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints (Q5057970) (← links)
- An efficient algorithm for computing a class of multiplicative optimization problem (Q5069808) (← links)
