An online convex optimization-based framework for convex bilevel optimization
From MaRDI portal
Publication:2693650
DOI10.1007/s10107-022-01894-5OpenAlexW4305014700MaRDI QIDQ2693650
Lingqing Shen, Fatma Kılınç-Karzan, Nam Ho-Nguyen
Publication date: 24 March 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-022-01894-5
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- A first order method for finding minimal norm-like solutions of convex optimization problems
- Lectures on convex optimization
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems
- Iterative regularization via dual diagonal descent
- Accuracy and fairness trade-offs in machine learning: a stochastic multi-objective approach
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- First-Order Methods in Optimization
- A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints
- Algorithms for Simple Bilevel Programming
- A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints
- ϵ-subgradient algorithms for bilevel convex optimization
- Regularization and Variable Selection Via the Elastic Net
- Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
- Regularized Iterative Stochastic Approximation Methods for Stochastic Variational Inequality Problems
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
- A First Order Method for Solving Convex Bilevel Optimization Problems
This page was built for publication: An online convex optimization-based framework for convex bilevel optimization
