Optimalizácia -rozmernej spojitej funkcie
An imperfect conjugate gradient algorithm
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 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.
Nonlinear iterative methods and parallel computation
Parallel method of conjugate directions for minimization
A parallel projection method for linear algebraic systems
A direct projection method for solving systems of linear algebraic equations is described. The algorithm is equivalent to the algorithm for minimization of the corresponding quadratic function and can be generalized for the minimization of a strictly convex function.
Note about the parallel projection method for solution of system of linear algebraic equations
Imperfect Conjugate Gradient Algorithms for Extended Quadratic Functions.
Page 1