On some mirror descent methods for strongly convex programming problems with Lipschitz functional constraints

Savchuk O.S., Alkousa M.S., Stonyakin F.S.
 pdf (276K)

The paper is devoted to one approach to constructing subgradient methods for strongly convex programming problems with several functional constraints. More precisely, the strongly convex minimization problem with several strongly convex (inequality-type) constraints is considered, and first-order optimization methods for this class of problems are proposed. The special feature of the proposed methods is the possibility of using the strong convexity parameters of the violated functional constraints at nonproductive iterations, in theoretical estimates of the quality of the produced solution by the methods. The main task, to solve the considered problem, is to propose a subgradient method with adaptive rules for selecting steps and stopping rule of the method. The key idea of the proposed methods in this paper is to combine two approaches: a scheme with switching on productive and nonproductive steps and recently proposed modifications of mirror descent for convex programming problems, allowing to ignore some of the functional constraints on nonproductive steps of the algorithms. In the paper, it was described a subgradient method with switching by productive and nonproductive steps for strongly convex programming problems in the case where the objective function and functional constraints satisfy the Lipschitz condition. An analog of the proposed subgradient method, a mirror descent scheme for problems with relatively Lipschitz and relatively strongly convex objective functions and constraints is also considered. For the proposed methods, it obtained theoretical estimates of the quality of the solution, they indicate the optimality of these methods from the point of view of lower oracle estimates. In addition, since in many problems, the operation of finding the exact subgradient vector is quite expensive, then for the class of problems under consideration, analogs of the mentioned above methods with the replacement of the usual subgradient of the objective function or functional constraints by the $\delta$-subgradient were investigated. The noted approach can save computational costs of the method by refusing to require the availability of the exact value of the subgradient at the current point. It is shown that the quality estimates of the solution change by $O(\delta)$. The results of numerical experiments illustrating the advantages of the proposed methods in comparison with some previously known ones are also presented.

Keywords: subgradient method, mirror descent, strongly convex function, Lipschitz-continuous function, $\delta$-subgradient, productive step, nonproductive step
Citation in English: Savchuk O.S., Alkousa M.S., Stonyakin F.S. On some mirror descent methods for strongly convex programming problems with Lipschitz functional constraints // Computer Research and Modeling, 2024, vol. 16, no. 7, pp. 1727-1746
Citation in English: Savchuk O.S., Alkousa M.S., Stonyakin F.S. On some mirror descent methods for strongly convex programming problems with Lipschitz functional constraints // Computer Research and Modeling, 2024, vol. 16, no. 7, pp. 1727-1746
DOI: 10.20537/2076-7633-2024-16-7-1727-1746
URL: http://crm-en.ics.org.ru/journal/article/3565/
Creative Commons License This work is licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License.

Indexed in Scopus

Full-text version of the journal is also available on the web site of the scientific electronic library eLIBRARY.RU

The journal is included in the Russian Science Citation Index

The journal is included in the RSCI

International Interdisciplinary Conference "Mathematics. Computing. Education"

Copyright © 2009–2024 Institute of Computer Science