Pages that link to "Item:Q820743"
From MaRDI portal
The following pages link to A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743):
Displaying 13 items.
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints (Q1774170) (← links)
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming (Q1970300) (← links)
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming (Q2124794) (← links)
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (Q2244199) (← links)
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems (Q2572774) (← links)
- A new global algorithm for factor-risk-constrained mean-variance portfolio selection (Q6064034) (← links)
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (Q6166654) (← links)
- An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs (Q6581973) (← links)
- A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming (Q6601128) (← links)
