On some methods of descent over groups of variables
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.
- The descent method for equations over groups
- Methods of descent over groups of variables for a class of constrained minimization problems
- Descent on Picard groups using functions on curves
- scientific article; zbMATH DE number 4087805
- scientific article; zbMATH DE number 1443332
- scientific article; zbMATH DE number 4087804
- Descent cohomology and factorizations of groups
- The descending chain condition on solution sets for systems of equations in groups
- scientific article; zbMATH DE number 4023439
- A generalization of descent polynomials
This page was built for publication: On some methods of descent over groups of variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1912428)
