Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function
From MaRDI portal
Publication:6071890
DOI10.1137/22m1533608arXiv2307.08245OpenAlexW4388631464MaRDI QIDQ6071890
Publication date: 29 November 2023
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2307.08245
Convex programming (90C25) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Linear programming (90C05) Methods of reduced gradient type (90C52)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A first order method for finding minimal norm-like solutions of convex optimization problems
- Averaged mappings and the gradient-projection algorithm
- Iterative regularization via dual diagonal descent
- Bilevel optimization. Advances and next challenges
- An online convex optimization-based framework for convex bilevel optimization
- Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings
- First-Order Methods in Optimization
- A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints
- ϵ-subgradient algorithms for bilevel convex optimization
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
- A First Order Method for Solving Convex Bilevel Optimization Problems
- An inertial extrapolation method for convex simple bilevel optimization
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function