The following pages link to (Q3641206):
Displaying 14 items.
- Linear decomposition approach for a class of nonconvex programming problems (Q523884) (← links)
- Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889) (← links)
- An accelerating algorithm for globally solving nonconvex quadratic programming (Q824677) (← links)
- A global optimization algorithm using parametric linearization relaxation (Q876659) (← links)
- Global and local quadratic minimization (Q1359045) (← links)
- A decomposition method for global and local quadratic minimization (Q1580439) (← links)
- Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions (Q1892595) (← links)
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs (Q2010085) (← links)
- On a decomposition method for nonconvex global optimization (Q2463828) (← links)
- (Q4349515) (← links)
- On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method (Q4888148) (← links)
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
- A graph-based decomposition method for convex quadratic optimization with indicators (Q6102761) (← links)
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (Q6166654) (← links)
