Pages that link to "Item:Q2633541"
From MaRDI portal
The following pages link to A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541):
Displaying 11 items.
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
- Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming (Q683728) (← links)
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint (Q1717222) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (Q2031320) (← links)
- Optimization for deep learning: an overview (Q2218095) (← links)
- On subspace properties of the quadratically constrained quadratic program (Q2411152) (← links)
- Global optimization for non-convex programs via convex proximal point method (Q2691402) (← links)
- A new global algorithm for factor-risk-constrained mean-variance portfolio selection (Q6064034) (← links)
- Sustainable two stage supply chain management: a quadratic optimization approach with a quadratic constraint (Q6170034) (← links)
- A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints (Q6534829) (← links)
