Semidefinite representable reformulations for two variants of the trust-region subproblem
type: Item
instance of: scholarly article
title: Semidefinite representable reformulations for two variants of the trust-region subproblem
author: Sarah Kelly
author: Yuyuan Ouyang
author: Boshi Yang
published in: Operations Research Letters
publication date: 2024-06-17T00:00:00Z
Mathematics Subject Classification ID: 90-XX
zbMATH DE Number: 7865928
zbMATH Keywords: convex hull
zbMATH Keywords: semidefinite programming
zbMATH Keywords: quadratically constrained quadratic programming
zbMATH Keywords: trust-region subproblem
MaRDI profile type: MaRDI publication profile
cites work: On indefinite quadratic optimization over the intersection of balls and linear constraints
cites work: Quadratic optimization with two ball constraints
cites work: On the branch and bound algorithm for the extended trust-region subproblem
cites work: Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem
cites work: Polynomial Solvability of Variants of the Trust-Region Subproblem
cites work: Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
cites work: A gentle, geometric introduction to copositive optimization
cites work: Second-Order-Cone Constraints for Extended Trust-Region Subproblems
cites work: The trust region subproblem with non-intersecting linear constraints
cites work: On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
cites work: Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow
cites work: Solving the Trust-Region Subproblem using the Lanczos Method
cites work: A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants
cites work: Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
cites work: Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem
cites work: Exact computable representation of some second-order cone constrained quadratic programming problems
cites work: KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems
cites work: A computational study of global optimization solvers on two trust region subproblems
cites work: Computing a Trust Region Step
cites work: The generalized trust region subproblem
cites work: A semidefinite framework for trust region subproblems with applications to large scale minimization
cites work: Solving generalized CDT problems via two-parameter eigenvalues
cites work: On Cones of Nonnegative Quadratic Functions
cites work: The generalized trust region subproblem: solution complexity and convex hull results
cites work: Strong duality for generalized trust region subproblem: S-lemma with interval bounds
cites work: Quadratic programs with hollows
cites work: A two-variable approach to the two-trust-region subproblem
cites work: New Results on Quadratic Minimization
DOI: 10.1016/J.ORL.2023.11.006
description: scientific article; zbMATH DE number 7865928