Inertia-controlling factorizations for optimization algorithms
From MaRDI portal
Publication:1862009
DOI10.1016/S0168-9274(02)00119-8zbMath1016.65039WikidataQ114121561 ScholiaQ114121561MaRDI QIDQ1862009
Publication date: 10 March 2003
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
An iterative working-set method for large-scale nonconvex quadratic programming, Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties, Inner solvers for interior point methods for large scale nonlinear programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factorizing symmetric indefinite matrices
- On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Direct Solution of Sets of Linear Equations whose Matrix is Sparse, Symmetric and Indefinite
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming
- Numerical Optimization
- CUTE
- On Modified Factorizations for Large-Scale Linearly Constrained Optimization
- The Factorization of Sparse Symmetric Indefinite Matrices
- Symmetric Quasidefinite Matrices
- On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
- Stability of Symmetric Ill-Conditioned Systems Arising in Interior Methods for Constrained Optimization
- Newton Methods for Large-Scale Linear Equality-Constrained Minimization
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
