Pages that link to "Item:Q1679484"
From MaRDI portal
The following pages link to A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints (Q1679484):
Displaying 11 items.
- On box-constrained total least squares problem (Q827567) (← links)
- An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (Q2031320) (← links)
- An efficient algorithm for the extended trust-region subproblem with two linear constraints (Q2119320) (← links)
- On the branch and bound algorithm for the extended trust-region subproblem (Q2141723) (← links)
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
- Finding second-order stationary points in constrained minimization: a feasible direction approach (Q2194125) (← links)
- On indefinite quadratic optimization over the intersection of balls and linear constraints (Q2671444) (← links)
- Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem (Q5116545) (← links)
- A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization (Q5124006) (← links)
- On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints (Q5883323) (← links)
- KKT-based primal-dual exactness conditions for the Shor relaxation (Q6104908) (← links)
