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 15 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)
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension (Q2045012) (← 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)
- Branch-and-bound method for the minimization problem for a nonconvex quadratic function under convex quadratic constraints (Q2713937) (← links)
- The optimal ball algorithm for nonlinear equations of quasi-strongly monotone operators (Q4876367) (← 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)
- New results on eliminating the duality gap of the second-order-cone reformulation for extended trust-region subproblem with two intersecting cuts (Q6639477) (← links)
