Factorizing symmetric indefinite matrices
From MaRDI portal
Cites work
Cited in
(13)- An iterative working-set method for large-scale nonconvex quadratic programming
- A numerical approximation for the simple bifurcation problems
- A restricted trust region algorithm for unconstrained optimization
- Krylov Subspace Solvers and Preconditioners
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- A modified Newton method for minimization
- On solving three classes of nonlinear programming problems via simple differentiable penalty functions
- A method for computing all the zeros of a polynomial with real coefficients
- Primal and dual active-set methods for convex quadratic programming
- Partial pivoting strategies for symmetric gaussian elimination
- On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem
- Inertia-controlling factorizations for optimization algorithms
- The growth factor and efficiency of Gaussian elimination with rook pivoting
This page was built for publication: Factorizing symmetric indefinite matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1230352)