Pages that link to "Item:Q513160"
From MaRDI portal
The following pages link to An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160):
Displayed 17 items.
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- An accelerating algorithm for globally solving nonconvex quadratic programming (Q824677) (← links)
- An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (Q2031320) (← links)
- A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues (Q2112679) (← links)
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
- Globally solving extended trust region subproblems with two intersecting cuts (Q2228371) (← links)
- Methods for estimating the global maximum point and the integral of a continuous function on a compact set (Q2243739) (← links)
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (Q2244199) (← links)
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
- On globally solving the extended trust-region subproblems (Q2661497) (← links)
- Global optimization for non-convex programs via convex proximal point method (Q2691402) (← links)
- On the Ball-Constrained Weighted Maximin Dispersion Problem (Q3187980) (← links)
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (Q4639134) (← links)
- A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program (Q5038154) (← links)
- A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity (Q5084603) (← links)
- An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem (Q6077941) (← links)
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems (Q6102175) (← links)