On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem
From MaRDI portal
Publication:6092945
DOI10.1080/02331934.2022.2092478OpenAlexW4283777088MaRDI QIDQ6092945
Walter Gómez Bofill, Unnamed Author, Nicolas F. Armijo
Publication date: 23 November 2023
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2022.2092478
Cites Work
- Unnamed Item
- A linear-time algorithm for trust region problems
- The generalized trust region subproblem
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices
- An efficient algorithm for solving the generalized trust region subproblem
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- A new graph parameter related to bounded rank positive semidefinite matrix completions
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
- Recent advances in trust region algorithms
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- A Note on Polynomial Solvability of the CDT Problem
- CVXPY: A Python-Embedded Modeling Language for Convex Optimization
- Solving Generalized CDT Problems via Two-Parameter Eigenvalues
- A Revisit to Quadratic Programming with One Inequality Quadratic Constraint via Matrix Pencil
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- New Results on Quadratic Minimization
- Trust Region Methods
- On Local Solutions of the Celis--Dennis--Tapia Subproblem
- The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction
- The trust region subproblem and semidefinite programming*
- Solving the Trust-Region Subproblem using the Lanczos Method
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem
- Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants
- Polynomial Solvability of Variants of the Trust-Region Subproblem
- Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization
- New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem
- A Linear-Time Algorithm for Generalized Trust Region Subproblems
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem