Generation of Conjugate Directions for Unconstrained Minimization without Derivatives

DOI10.2307/2005435MaRDI QIDQ4125668zbMATH OpenOpenAlexFDO

Authors Larry Nazareth

Publication date 1976

Full work available at URL https://doi.org/10.2307/2005435

Mathematics Subject Classification ID

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

Cites work

• A New Direction Set Method for Unconstrained Minimization without Evaluating Derivatives
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• scientific article; zbMATH DE number 3507890 (Why is no real title available?)
• scientific article; zbMATH DE number 3388498 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• Minimizing a function without calculating derivatives
• Note on the quadratic convergence of the cyclic Jacobi process
• On Cyclic Jacobi Methods
• On the convergence of the classical Jacobi method for real symmetric matrices with non-distinct eigenvalues
• On the Speed of Convergence of Cyclic and Quasicyclic Jacobi Methods for Computing Eigenvalues of Hermitian Matrices
• The Cyclic Jacobi Method for Computing the Principal Values of a Complex Matrix

Describes a project that uses

Uses Software

• BRENT

This page was built for publication: Generation of Conjugate Directions for Unconstrained Minimization without Derivatives

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