An accelerated proximal algorithm for regularized nonconvex and nonsmooth bi-level optimization

DOI10.1007/s10994-023-06329-6arXiv2203.16615OpenAlexW4362697005MaRDI QIDQ6161202

Yi Zhou, Bhavya Kailkhura, Zi-Yi Chen

Publication date: 27 June 2023

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.16615

zbMATH Keywords

bilevel optimizationproximal algorithmnonconvex regularizationNesterov's momentum

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• On local convergence of the method of alternating projections
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Introductory lectures on convex optimization. A basic course.
• An extended Kuhn-Tucker approach for linear bilevel programming
• Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• New Branch-and-Bound Rules for Linear Bilevel Programming
• OnActor-Critic Algorithms
• Distributed Proximal Gradient Algorithm for Partially Asynchronous Computer Clusters
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Mathematical Programs with Optimization Problems in the Constraints
• A Two-Timescale Stochastic Algorithm Framework for Bilevel Optimization: Complexity Analysis and Application to Actor-Critic

This page was built for publication: An accelerated proximal algorithm for regularized nonconvex and nonsmooth bi-level optimization