A two-variable approach to the two-trust-region subproblem
From MaRDI portal
Recommendations
- Second-order-cone constraints for extended trust-region subproblems
- A second-order cone based approach for solving the trust-region subproblem and its variants
- The trust region subproblem and semidefinite programming*
- A hybrid algorithm for the two-trust-region subproblem
- On globally solving the extended trust-region subproblems
Cites work
- A note on polynomial solvability of the CDT problem
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- Approximation algorithms for quadratic programming
- Computing a Trust Region Step
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
- Feasibility testing for systems of real quadratic equations
- scientific article; zbMATH DE number 3903874 (Why is no real title available?)
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- New Results on Quadratic Minimization
- On Cones of Nonnegative Quadratic Functions
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- Polynomial-time computing over quadratic maps i: sampling in real algebraic sets
- Second-order-cone constraints for extended trust-region subproblems
- Solving the Trust-Region Subproblem using the Lanczos Method
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- The trust region subproblem with non-intersecting linear constraints
- Trust Region Methods
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
Cited in
(26)- A computational study of global optimization solvers on two trust region subproblems
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
- A hybrid algorithm for the two-trust-region subproblem
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- A necessary and sufficient condition of convexity for SOC reformulation of trust-region subproblem with two intersecting cuts
- A note on polynomial solvability of the CDT problem
- Solving generalized CDT problems via two-parameter eigenvalues
- Kronecker product constraints with an application to the two-trust-region subproblem
- The trust region subproblem and semidefinite programming*
- On Chebyshev center of the intersection of two ellipsoids
- Second-order-cone constraints for extended trust-region subproblems
- A second-order cone based approach for solving the trust-region subproblem and its variants
- New results on narrowing the duality gap of the extended Celis-Dennis-Tapia problem
- A linear-time algorithm for generalized trust region subproblems
- An optimality gap test for a semidefinite relaxation of a quadratic program with two quadratic constraints
- KKT-based primal-dual exactness conditions for the Shor relaxation
- Optimization under uncertainty and risk: quadratic and copositive approaches
- (Global) optimization: historical notes and recent developments
- Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem
- Semidefinite representable reformulations for two variants of the trust-region subproblem
- An efficient splitting algorithm for solving the CDT subproblem
- Solving two-trust-region subproblems using semidefinite optimization with eigenvector branching
- On convergence of the block Lanczos method for the CDT subproblem
- On the tightness of an SDP relaxation for homogeneous QCQP with three real or four complex homogeneous constraints
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
This page was built for publication: A two-variable approach to the two-trust-region subproblem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796795)
