scientific article; zbMATH DE number 1131713

MaRDI QIDQ4382728zbMATH OpenFDO

Authors Yu Wang, Guochen Feng

Publication date 12 May 1998

zbMATH Keywords

BFGS methodCholesky factorizationunconstrained optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• A method with partitioning column updates of Cholesky factorization for large scale sparse unconstrained optimization
• scientific article; zbMATH DE number 4024658
• Can Newton method be surpassed.
• New quasi-Newton methods for unconstrained optimization problems
• A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization

Cited in

(6)

• An improved inexact Newton's method for unary optimization
• A method with partitioning column updates of Cholesky factorization for large scale sparse unconstrained optimization
• scientific article; zbMATH DE number 4024658 (Why is no real title available?)
• Can Newton method be surpassed.
• Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization
• Modified Cholesky algorithms: A catalog with new approaches

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4382728)