An online convex optimization-based framework for convex bilevel optimization
- 13 October 2022
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 198 (2) , 1519-1582
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problemsMathematical Programming, 2017
- ϵ-subgradient algorithms for bilevel convex optimization *Inverse Problems, 2017
- A First Order Method for Solving Convex Bilevel Optimization ProblemsSIAM Journal on Optimization, 2017
- A first order method for finding minimal norm-like solutions of convex optimization problemsMathematical Programming, 2013
- Regularized Iterative Stochastic Approximation Methods for Stochastic Variational Inequality ProblemsIEEE Transactions on Automatic Control, 2012
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient MethodsSIAM Journal on Optimization, 2009
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization ProblemsSIAM Journal on Optimization, 2007
- Regularization and Variable Selection Via the Elastic NetJournal of the Royal Statistical Society Series B: Statistical Methodology, 2005
- Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical MinimizationSIAM Journal on Optimization, 2005
- REGULARIZATION TOOLS: A Matlab package for analysis and solution of discrete ill-posed problemsNumerical Algorithms, 1994