Solving generalized CDT problems via two-parameter eigenvalues
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3903874 (Why is no real title available?)
- scientific article; zbMATH DE number 51877 (Why is no real title available?)
- scientific article; zbMATH DE number 1534299 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 5019718 (Why is no real title available?)
- scientific article; zbMATH DE number 2218045 (Why is no real title available?)
- A note on polynomial solvability of the CDT problem
- A trust region algorithm for equality constrained optimization
- A two-variable approach to the two-trust-region subproblem
- Accuracy and Stability of Numerical Algorithms
- An Algorithm for Generalized Matrix Eigenvalue Problems
- Backward error and condition of polynomial eigenvalue problems
- Computing the common zeros of two bivariate functions via Bézout resultants
- Computing the signed distance between overlapping ellipsoids
- Feasibility testing for systems of real quadratic equations
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Matrix Polynomials
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- Numerical Optimization
- On Cones of Nonnegative Quadratic Functions
- On Local Solutions of the Celis--Dennis--Tapia Subproblem
- On a subproblem of trust region algorithms for constrained optimization
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- Second-order-cone constraints for extended trust-region subproblems
- Solving the trust-region subproblem by a generalized eigenvalue problem
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- The Bezoutian and the eigenvalue-separation problem for matrix polynomials
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
Cited in
(30)- On the tightness of an SDP relaxation for homogeneous QCQP with three real or four complex homogeneous constraints
- Efficient local search procedures for quadratic fractional programming problems
- Semidefinite representable reformulations for two variants of the trust-region subproblem
- A hybrid algorithm for the two-trust-region subproblem
- An efficient splitting algorithm for solving the CDT subproblem
- Solving two-parameter eigenvalue problems using an alternating method
- On convergence of the block Lanczos method for the CDT subproblem
- Solving the trust-region subproblem by a generalized eigenvalue problem
- A Newton method for solving locally definite multiparameter eigenvalue problems by multi-index
- Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem
- Comment on: ``Approximation algorithms for quadratic programming
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- On local non-global minimizers of quadratic optimization problem with a single quadratic constraint
- A survey of hidden convex optimization
- On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints
- An optimality gap test for a semidefinite relaxation of a quadratic program with two quadratic constraints
- A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints
- Non-convex optimization problems with linear KKT subsystem
- How Do Exponential Size Solutions Arise in Semidefinite Programming?
- New results on narrowing the duality gap of the extended Celis-Dennis-Tapia problem
- Tilt stability for quadratic programs with one or two quadratic inequality constraints
- Quadratic optimization with two ball constraints
- On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem
- A note on polynomial solvability of the CDT problem
- KKT-based primal-dual exactness conditions for the Shor relaxation
- Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere
- On Chebyshev center of the intersection of two ellipsoids
- (Global) optimization: historical notes and recent developments
- Finding second-order stationary points in constrained minimization: a feasible direction approach
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
This page was built for publication: Solving generalized CDT problems via two-parameter eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817837)
