Computing Modified Newton Directions Using a Partial Cholesky Factorization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4172744
- An algorithm for indefinite quadratic programming based on a partial Cholesky factorization
- A Newton method with a two-dimensional line search
- Modified Cholesky algorithms: A catalog with new approaches
- A new structured quasi-Newton algorithm using partial information on Hessian
Cited in
(13)- Exploiting negative curvature in deterministic and stochastic optimization
- An algorithm for nonlinear optimization problems with binary variables
- Nonmonotonic projected algorithm with both trust region and line search for constrained optimization
- Block pivoting and shortcut strategies for detecting copositivity
- A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization
- Exploiting negative curvature in conjunction with adaptive sampling: theoretical results and a practical algorithm
- An algorithm for indefinite quadratic programming based on a partial Cholesky factorization
- Improving directions of negative curvature in an efficient manner
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems
- Nonmonotone curvilinear line search methods for unconstrained optimization
- scientific article; zbMATH DE number 6008490 (Why is no real title available?)
- Modified Cholesky algorithms: A catalog with new approaches
- Preconditioning regularized least squares problems arising from high-resolution image reconstruction from low-resolution frames
This page was built for publication: Computing Modified Newton Directions Using a Partial Cholesky Factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4325706)