A first-order method for solving bilevel convex optimization problems in Banach space
From MaRDI portal
Publication:6565292
DOI10.1080/02331934.2023.2192232MaRDI QIDQ6565292
Publication date: 1 July 2024
Published in: Optimization (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A first order method for finding minimal norm-like solutions of convex optimization problems
- Dualization of signal recovery problems
- Averaged mappings and the gradient-projection algorithm
- Finite perturbation of convex programs
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- Nonlinear Ill-posed Problems of Monotone Type
- A forward–backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Signal Recovery by Proximal Forward-Backward Splitting
This page was built for publication: A first-order method for solving bilevel convex optimization problems in Banach space