Abstract
AbstractComposite optimization offers a powerful modeling tool for a variety of applications and is often numerically solved by means of proximal gradient methods. In this paper, we consider fully nonconvex composite problems under only local Lipschitz gradient continuity for the smooth part of the objective function. We investigate an adaptive scheme for PANOC-type methods (Stella et al. in Proceedings of the IEEE 56th CDC, 2017), namely accelerated linesearch algorithms requiring only the simple oracle of proximal gradient. While including the classical proximal gradient method, our theoretical results cover a broader class of algorithms and provide convergence guarantees for accelerated methods with possibly inexact computation of the proximal mapping. These findings have also significant practical impact, as they widen scope and performance of existing, and possibly future, general purpose optimization software that invoke PANOC as inner solver.
Funder
Japan Society for the Promotion of Science
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization
Reference34 articles.
1. Ahookhosh, M., Themelis, A., Patrinos, P.: A Bregman forward–backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima. SIAM J. Optim. 31(1), 653–685 (2021)
2. Antonello, N., Stella, L., Patrinos, P., van Waterschoot, T.: Proximal gradient algorithms: applications in signal processing. arXiv:1803.01621 (2020)
3. Astudillo, A., Gillis, J., Decré, W., Pipeleers, G., Swevers, J.: Towards an open toolchain for fast nonlinear MPC for serial robots. IFAC-PapersOnLine 53(2), 9814–9819 (2020)
4. Berlin, J., Hess, G., Karlsson, A., Ljungbergh, W., Zhang, Z., Åkesson, K., Götvall, P.-L.: Trajectory generation for mobile robots in a dynamic environment using nonlinear model predictive control. In: 2021 IEEE 17th International Conference on Automation Science and Engineering (CASE), pp. 942–947 (2021)
5. Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Athena Scientific, Belmont (1996)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献