On some methods of descent over groups of variables.

*(English. Russian original)*Zbl 0842.65043
J. Math. Sci., New York 74, No. 5, 1219-1224 (1995); translation from Issled. Prikl. Mat. 19, 24-33 (1992).

This paper is devoted to the study of the convergence of certain methods for unconstrained optimization belonging to a class of decomposition methods of nonlinear programming. The methods of this class are characterized by the property that at each step the transition from one point to another is carried out not over all the variables of the problem, but only over a group of variables. The ideas of descent over groups of variables are implicit, for example in the methods of coordinatewise descent, gradient descent over fast and slow variables, and others. We give sufficient conditions for convergence of methods of this type.

##### Keywords:

methods of descent over groups of variables; convergence; unconstrained optimization; decomposition methods; nonlinear programming
PDF
BibTeX
XML
Cite

\textit{I. Ya. Zabotin}, J. Math. Sci., New York 74, No. 5, 1 (1992; Zbl 0842.65043); translation from Issled. Prikl. Mat. 19, 24--33 (1992)

Full Text:
DOI

##### References:

[1] | V. G. Karmanov,Mathematical Programming [in Russian], Moscow (1986). |

[2] | N. N. Moiseev,Numerical Methods in the Theory of Optimal Systems [in Russian], Moscow (1971). · Zbl 0224.35071 |

[3] | N. N. Moiseev, Yu. P. Ivanilov, and E. M. Stolyarova,Optimization Methods [in Russian], Moscow (1978). |

[4] | E. G. Gol’shtein and D. B. Yudin, ”Methods of calculation and synthesis of automatic sampled-data systems,”Avtom. i Telemekh.,24, No. 12, 1643–1659 (1963). |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.