A modified secant method for unconstrained minimization
From MaRDI portal
Publication:4775705
DOI10.1007/BF01580245zbMath0287.90025MaRDI QIDQ4775705
No author found.
Publication date: 1974
Published in: Mathematical Programming (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Related Items (5)
A robust secant method for optimization problems with inequality constraints ⋮ A new arc algorithm for unconstrained optimization ⋮ A restricted trust region algorithm for unconstrained optimization ⋮ The application of optimal control methodology to nonlinear programming problems ⋮ Spline and weighted random directions method for nonlinear optimization
Cites Work
- Minimization of functions having Lipschitz continuous first partial derivatives
- The Secant method for simultaneous nonlinear equations
- Iterative Solution of Nonlinear Equations in Several Variables
- A KDF9 ALGOL list-processing scheme
- Some Efficient Algorithms for Solving Systems of Nonlinear Equations
- Unnamed Item
- Unnamed Item
This page was built for publication: A modified secant method for unconstrained minimization
