Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
From MaRDI portal
Publication:2349132
DOI10.1007/s10107-014-0836-3zbMath1328.90095OpenAlexW2141421695MaRDI QIDQ2349132
Immanuel M. Bomze, Michael L. Overton
Publication date: 19 June 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-014-0836-3
non-convex optimizationpolynomial optimizationcopositive matricesglobal optimality conditiontrust region problem
Related Items
A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program, Computing the Signed Distance Between Overlapping Ellipsoids, A computational study of global optimization solvers on two trust region subproblems, On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem, Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems, Optimization under uncertainty and risk: quadratic and copositive approaches, Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem, Subspace choices for the Celis-Dennis-Tapia problem, Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem, Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem, A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs, An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem, A Note on Polynomial Solvability of the CDT Problem, Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations, An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem, A Two-Variable Approach to the Two-Trust-Region Subproblem, Copositivity for second-order optimality conditions in general smooth optimization problems, Solving Generalized CDT Problems via Two-Parameter Eigenvalues, A hybrid algorithm for the two-trust-region subproblem, Tilt stability for quadratic programs with one or two quadratic inequality constraints, Quadratic optimization with two ball constraints, Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems, An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonsmooth optimization via quasi-Newton methods
- On the computational complexity of membership problems for the completely positive cone and its dual
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- On a subproblem of trust region algorithms for constrained optimization
- Une caractérisation complete des minima locaux en programmation quadratique
- Polynomial-time computing over quadratic maps i: sampling in real algebraic sets
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- A Two-Variable Approach to the Two-Trust-Region Subproblem
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
- Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Some NP-complete problems in quadratic and nonlinear programming
- 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
- On Local Solutions of the Celis--Dennis--Tapia Subproblem
- Necessary and sufficient conditions for quadratic minimality
- Accuracy and Stability of Numerical Algorithms
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- Optimality conditions for quadratic programming
- Indefinite copositive matrices with exactly one positive eigenvalue or exactly one negative eigenvalue
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- A Survey of the S-Lemma
