A modified secant method for unconstrained minimization

DOI10.1007/BF01580245MaRDI QIDQ4775705zbMATH OpenFDO

Authors

Publication date 1974

Published in Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3302906 (Why is no real title available?)
• scientific article; zbMATH DE number 3407464 (Why is no real title available?)
• A KDF9 ALGOL list-processing scheme
• Iterative Solution of Nonlinear Equations in Several Variables
• Minimization of functions having Lipschitz continuous first partial derivatives
• Some Efficient Algorithms for Solving Systems of Nonlinear Equations
• The Secant method for simultaneous nonlinear equations

Cited in

(5)

• The application of optimal control methodology to nonlinear programming problems
• A restricted trust region algorithm for unconstrained optimization
• A robust secant method for optimization problems with inequality constraints
• Spline and weighted random directions method for nonlinear optimization
• A new arc algorithm for unconstrained optimization

This page was built for publication: A modified secant method for unconstrained minimization

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