A comparison of modified Newton methods for unconstrained optimisation

DOI10.1093/COMJNL/14.3.293MaRDI QIDQ5630532zbMATH OpenOpenAlexFDO

Authors

Publication date 1971

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/14.3.293

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Methods of reduced gradient type (90C52)

Cited in

(10)

• A hybrid variable penalty method for nonlinear programming
• A class of generalized variable penalty methods for nonlinear programming
• Variable penalty methods for constrained minimization
• An improved variable penalty algorithm for automated structural design
• A modified Newton method for minimization
• Approximation methods for the unconstrained optimization
• A numerically stable and efficient technique for the maintenance of positive definiteness in the Hessian for Newton-type methods
• Unified approach to unconstrained minimization via basic matrix factorizations
• Newton-type methods for unconstrained and linearly constrained optimization
• A superlinearly convergent algorithm for minimization without evaluating derivatives

This page was built for publication: A comparison of modified Newton methods for unconstrained optimisation

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