Subspace choices for the Celis-Dennis-Tapia problem
From MaRDI portal
Publication:1701260
DOI10.1007/s11425-016-0012-1zbMath1384.49028OpenAlexW2589711910MaRDI QIDQ1701260
Publication date: 22 February 2018
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-016-0012-1
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Numerical methods based on nonlinear programming (49M37)
Related Items (2)
On subspace properties of the quadratically constrained quadratic program ⋮ A subspace SQP method for equality constrained optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recent advances in numerical methods for nonlinear equations and nonlinear least squares
- A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization
- Subspace methods for large scale nonlinear equations and nonlinear least squares
- On a subproblem of trust region algorithms for constrained optimization
- A trust region algorithm for equality constrained optimization
- Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- On Local Solutions of the Celis--Dennis--Tapia Subproblem
- On Cones of Nonnegative Quadratic Functions
This page was built for publication: Subspace choices for the Celis-Dennis-Tapia problem
