Globally solving extended trust region subproblems with two intersecting cuts
From MaRDI portal
Publication:2228371
DOI10.1007/s11590-019-01484-zzbMath1459.90144OpenAlexW2975287029WikidataQ127246017 ScholiaQ127246017MaRDI QIDQ2228371
Cheng Lu, Jian Luo, Ye Tian, Zhi-bin Deng
Publication date: 17 February 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-019-01484-z
extended trust region subproblemsemidefinite programming relaxationsecond-order cone constraintsintersecting cuts
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Trust region subproblem with an additional linear inequality constraint
- Exactness conditions for an SDP relaxation of the extended trust region problem
- Exact computable representation of some second-order cone constrained quadratic programming problems
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- A linear-time algorithm for the trust region subproblem based on hidden convexity
- Conic approximation to nonconvex quadratic programming with convex quadratic constraints
- Recent advances in trust region algorithms
- The trust region subproblem with non-intersecting linear constraints
- Some NP-complete problems in quadratic and nonlinear programming
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- New Results on Quadratic Minimization
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- On Cones of Nonnegative Quadratic Functions
This page was built for publication: Globally solving extended trust region subproblems with two intersecting cuts
