On the convergence of proximal gradient methods for convex simple bilevel optimization

DOI10.1007/S10957-024-02564-6MaRDI QIDQ7022487zbMATH OpenFDO

Authors Puya Latafat, Andreas Themelis, Silvia Villa, Panagiotis Patrinos

Publication date 25 February 2025

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10957-024-02564-6

zbMATH Keywords

adaptive proximal gradient methodsbilevel programmingconvex optimizationlocally Lipschitz gradient

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cites work

• -subgradient algorithms for bilevel convex optimization
• A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
• A first order method for finding minimal norm-like solutions of convex optimization problems
• A first order method for solving convex bilevel optimization problems
• A first-order method for solving bilevel convex optimization problems in Banach space
• A method with convergence rates for optimization problems with variational inequality constraints
• A Two-Timescale Stochastic Algorithm Framework for Bilevel Optimization: Complexity Analysis and Application to Actor-Critic
• Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Combining approximation and exact penalty in hierarchical programming
• Convergence of diagonally stationary sequences in convex optimization
• Convex analysis and monotone operator theory in Hilbert spaces
• Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function
• Coupling the gradient method with a general exterior penalization scheme for convex minimization
• First-order methods in optimization
• Foundations of bilevel programming
• Gradient methods for minimizing composite functions
• scientific article; zbMATH DE number 5176444 (Why is no real title available?)
• Iterative regularization via dual diagonal descent
• Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems
• On the solution of monotone nested variational inequalities
• Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
• Two-Point Step Size Gradient Methods
• VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks
• Viscosity approximation methods for fixed-points problems
• Viscosity approximation methods for nonexpansive mappings
• Viscosity Solutions of Minimization Problems

Cited in

(2)

• An iterative method for solving the bilevel monotone variational inequality problem without continuity of Lipschitz-type and applications
• On the convergence rates of iterative regularization algorithms for composite bilevel optimization

This page was built for publication: On the convergence of proximal gradient methods for convex simple bilevel optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7022487)