Projection Method of Approximation Gradient for Convex Programming Problems

Autor:	Vladimir A. Tyulyukin
Rok vydání:	1998
Předmět:	Convex analysis Convex hull Convex optimization Mathematical analysis Convex set Proper convex function Proximal Gradient Methods Convex combination Subderivative Mathematics
Zdroj:	IFAC Proceedings Volumes. 31:215-217
ISSN:	1474-6670
DOI:	10.1016/s1474-6670(17)36026-3
Popis:	In this report the problem of minimization of a convex function f ( x ) on a convex closed and bounded set Q ⊂ R n is considered. The method described below concerns gradient methods of the search of extremum of convex functions. The discrete analogue of the approximation gradient plays here the role of the gradient (Batukhtin and Maiboroda, 1984; Batukhtin and Maiboroda, 1995).
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::61ff1e7d88e5bbf4acf747c9ecce5d5c https://doi.org/10.1016/s1474-6670(17)36026-3 Zobrazit plný text záznamu