An algorithm that minimizes homogeneous functions of \(n\) variables in \(n + 2\) iterations and rapidly minimizes general functions

DOI10.1016/0022-247X(72)90067-4zbMath0202.16501OpenAlexW2159303706MaRDI QIDQ2540947

W. Oksman, David H. Jacobson

Publication date: 1972

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(72)90067-4

Mathematics Subject Classification ID

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

Related Items

Parallel algorithms for nonlinear programming problems ⋮ A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems ⋮ Some computational advances in unconstrained optimization ⋮ A homogeneous method for unconstrained optimization ⋮ A new conic method for unconstrained minimization ⋮ Unconstrained optimization based on homogeneous models ⋮ A Newton-type curvilinear search method for optimization ⋮ Matrix conditioning and nonlinear optimization ⋮ A robust conjugate-gradient algorithm which minimizes L-functions ⋮ Approximation methods for the unconstrained optimization ⋮ Nonlinear programming on a microcomputer ⋮ The effect of data grid size on certain interpolation methods for unconstrained function minimization ⋮ Fast Givens transformtions applied to the homogeneous optimization method ⋮ Differential gradient methods ⋮ A modified homogeneous algorithm for function minimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Rapidly Convergent Descent Method for Minimization
• An Algorithm for the Calculation of the Pseudo-Inverse of a Singular Matrix
• Quasi-Newton Methods and their Application to Function Minimisation
• Variance algorithm for minimization
• Computational experience with quadratically convergent minimisation methods