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

Cites Work

A Rapidly Convergent Descent Method for Minimization
Title not available (Why is that?)
Title not available (Why is that?)
Quasi-Newton Methods and their Application to Function Minimisation
Variance algorithm for minimization
Computational experience with quadratically convergent minimisation methods
An Algorithm for the Calculation of the Pseudo-Inverse of a Singular Matrix
Title not available (Why is that?)

Cited In (15)

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

This page was built for publication: An algorithm that minimizes homogeneous functions of \(n\) variables in \(n + 2\) iterations and rapidly minimizes general functions

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