Year: 2024
Type: article
Abstract: We present a new feasible proximal gradient method for constrained optimization where both the objective and constraint functions are given by summation of a smooth, possibly nonconvex function and a convex simple function. The algorithm converts the original problem into a sequence of convex subproblems. Formulating those subproblems requires the evaluation of at most one gradient-value of the original objective and constraint functions. Either exact or approximate subproblems solutions can be computed efficiently in many cases. An important feature of the algorithm is the constraint level parameter. By carefully increasing this level for each subproblem, we provide a simple solution to overcome the challenge of bounding the Lagrangian multipliers and show that the algorithm follows a strictly feasible solution path till convergence to the stationary point. We develop a simple, proximal gradient descent type analysis, showing that the complexity bound of this new algorithm is comparable to gradient descent for the unconstrained setting which is new in the literature. Exploiting this new design and analysis technique, we extend our algorithms to some more challenging constrained optimization problems where (1) the objective is a stochastic or finite-sum function, and (2) structured nonsmooth functions replace smooth components of both objective and constraint functions. Complexity results for these problems also seem to be new in the literature. Finally, our method can also be applied to convex function constrained problems where we show complexities similar to the proximal gradient method.
Source: Mathematical Programming
Authors: Digvijay Boob, Qi Deng, Guanghui Lan
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,990
Funders: National Science Foundation, U.S. Department of Agriculture, American Heart Association, Strong, National Natural Science Foundation of China, Shanghai University of Finance and Economics, National Institute of Food and Agriculture, National Natural Science Foundation of China-China Academy of General Technology Joint Fund for Basic Research, Division of Mathematical Sciences, Division of Computing and Communication Foundations
Awards: Manage Cardiac Surgery Associated Acute Kidney Injury with Advanced Machine Learning and Decision Optimization, G2030148605, G213145320, G2362776713, G2822764157, G3985662637, G4285581263, G5262944956, CRII: AF: Variational Inequality and Saddle Point Problems with Complex Constraints, G7497115743, G828000753
OpenAlex ID: W4392510368
