On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem
From MaRDI portal
Publication:6092945
DOI10.1080/02331934.2022.2092478OpenAlexW4283777088MaRDI QIDQ6092945FDOQ6092945
Authors: Nicolas F. Armijo, Walter Gómez Bofill 
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
Recommendations
- Exactness conditions for an SDP relaxation of the extended trust region problem
- On Conic Relaxations of Generalization of the Extended Trust Region Subproblem
- Exactness Conditions for Semidefinite Programming Relaxations of Generalization of the Extended Trust Region Subproblem
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- On globally solving the extended trust-region subproblems
Cites Work
- CVXPY: a Python-embedded modeling language for convex optimization
- Solving the Trust-Region Subproblem using the Lanczos Method
- Trust Region Methods
- A revisit to quadratic programming with one inequality quadratic constraint via matrix pencil
- New Results on Quadratic Minimization
- The generalized trust region subproblem
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Recent advances in trust region algorithms
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- A linear-time algorithm for trust region problems
- A new graph parameter related to bounded rank positive semidefinite matrix completions
- The trust region subproblem and semidefinite programming*
- Title not available (Why is that?)
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- Exactness of semidefinite relaxations for nonlinear optimization problems with underlying graph structure
- An efficient algorithm for solving the generalized trust region subproblem
- On Local Solutions of the Celis--Dennis--Tapia Subproblem
- A note on polynomial solvability of the CDT problem
- Solving generalized CDT problems via two-parameter eigenvalues
- Polynomial Solvability of Variants of the Trust-Region Subproblem
- Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices
- Novel reformulations and efficient algorithms for the generalized trust region subproblem
- A linear-time algorithm for generalized trust region subproblems
- New results on narrowing the duality gap of the extended Celis-Dennis-Tapia problem
- 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 second-order cone based approach for solving the trust-region subproblem and its variants
- The solution of Euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction
This page was built for publication: On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6092945)
