Conjugate direction algorithms for extended conic functions

Ladislav Lukšan

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Conjugate direction algorithms for extended conic functions”

Conjugate gradient algorithms for conic functions

Ladislav Lukšan (1986)

Aplikace matematiky

Similarity:

The paper contains a description and an analysis of two modifications of the conjugate gradient method for unconstrained minimization which find a minimum of the conic function after a finite number of steps. Moreover, further extension of the conjugate gradient method is given which is based on a more general class of the model functions.

An implementation of recursive quadratic programming variable metric methods for linearly constrained nonlinear minimax approximation

Ladislav Lukšan (1985)

Kybernetika

Similarity:

An imperfect conjugate gradient algorithm

Fridrich Sloboda (1982)

Aplikace matematiky

Similarity:

A new biorthogonalization algorithm is defined which does not depend on the step-size used. The algorithm is suggested so as to minimize the total error after $n$ steps if imperfect steps are used. The majority of conjugate gradient algorithms are sensitive to the exactness of the line searches and this phenomenon may destroy the global efficiency of these algorithms.