Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem
From MaRDI portal
Publication:2968177
DOI10.1137/16M1078859zbMath1357.90105MaRDI QIDQ2968177
Publication date: 10 March 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
semidefinite programmingnonconvex quadratic programmingsemidefinite optimizationtrust region subproblem
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations, A computational study of global optimization solvers on two trust region subproblems, (Global) optimization: historical notes and recent developments, Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem, Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow, On the spectral structure of Jordan-Kronecker products of symmetric and skew-symmetric matrices, Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
Cites Work
- Unnamed Item
- Unnamed Item
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- Feasibility testing for systems of real quadratic equations
- A Note on Polynomial Solvability of the CDT Problem
- A Two-Variable Approach to the Two-Trust-Region Subproblem
- Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- New Results on Quadratic Minimization
- Trust Region Methods
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
- On Cones of Nonnegative Quadratic Functions
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
