Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints

Cites Work

Optimal deleveraging with nonlinear temporary price impact
A breakpoint search approach for convex resource allocation problems with bounded variables
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
Quadratic resource allocation with generalized upper bounds
Approximating quadratic programming with bound and quadratic constraints
New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
Globally solving nonconvex quadratic programming problems via completely positive programming
A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
Hidden convexity in some nonconvex quadratically constrained quadratic programming
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation
On the solution of concave knapsack problems
Hidden conic quadratic representation of some nonconvex quadratic optimization problems
Breakpoint searching algorithms for the continuous quadratic knapsack problem
A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
Optimal Portfolio Liquidation with Distress Risk
A Parallel Projection for the Multicommodity Network Model
Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
Necessary conditions for ε-optimality
Computational development of a lagrangian dual approach for quadratic networks
Massively Parallel Algorithms for Singly Constrained Convex Programs
Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
Semidefinite relaxation and nonconvex quadratic optimization
Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
Analytical Results and Efficient Algorithm for Optimal Portfolio Deleveraging with Market Impact
Computationally Related Problems
A Survey of the S-Lemma

This page was built for publication: Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints