A projection-free method for solving convex bilevel optimization problems

DOI10.1007/S10107-024-02157-1MaRDI QIDQ6932176zbMATH OpenFDO

Authors Khanh-Hung Giang-Tran, Nam Ho-Nguyen, Dabeen Lee

Publication date 9 September 2025

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10107-024-02157-1

zbMATH Keywords

bilevel optimizationconditional gradientprojection-free

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Cites work

• -subgradient algorithms for bilevel convex optimization
• 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 method with convergence rates for optimization problems with variational inequality constraints
• Algorithms for simple bilevel programming
• An inertial extrapolation method for convex simple bilevel optimization
• An online convex optimization-based framework for convex bilevel optimization
• Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function
• Error bounds, quadratic growth, and linear convergence of proximal methods
• Exact Regularization of Convex Programs
• Fast projection onto the simplex and the l₁ ball
• First-order methods in optimization
• Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute gradient for structured convex optimization
• Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem
• scientific article; zbMATH DE number 3551792 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• scientific article; zbMATH DE number 5176444 (Why is no real title available?)
• Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems
• No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization
• On general minimax theorems
• Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
• Restarting Frank-Wolfe: faster rates under Hölderian error bounds
• Strong Convexity of Feasible Sets in Off-line and Online Optimization

Cited in

(2)

• Splitting the conditional gradient algorithm
• On the convergence rates of iterative regularization algorithms for composite bilevel optimization

This page was built for publication: A projection-free method for solving convex bilevel optimization problems

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