Solving two-trust-region subproblems using semidefinite optimization with eigenvector branching
From MaRDI portal
Publication:6596338
DOI10.1007/s10957-022-02064-5MaRDI QIDQ6596338
Publication date: 2 September 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
semidefinite programmingnonconvex quadratic programmingsemidefinite optimizationconic optimizationtrust region subproblem
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Cites Work
- Unnamed Item
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- Approximation algorithms for quadratic programming
- BARON: A general purpose global optimization software package
- On maximization of quadratic form over intersection of ellipsoids with common center
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- Feasibility testing for systems of real quadratic equations
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- A Note on Polynomial Solvability of the CDT Problem
- A Two-Variable Approach to the Two-Trust-Region Subproblem
- Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem
- Branching and bounds tighteningtechniques for non-convex MINLP
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- New Results on Quadratic Minimization
- Trust Region Methods
- Semidefinite Programming
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- Mixed-integer nonlinear optimization
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem
This page was built for publication: Solving two-trust-region subproblems using semidefinite optimization with eigenvector branching
