A first-order method for solving bilevel convex optimization problems in Banach space
From MaRDI portal
(Redirected from Publication:6565292)
Recommendations
- A first order method for solving convex bilevel optimization problems
- A first order method for finding minimal norm-like solutions of convex optimization problems
- scientific article; zbMATH DE number 5176444
- -subgradient algorithms for bilevel convex optimization
- scientific article; zbMATH DE number 2208669
Cites work
- A first order method for finding minimal norm-like solutions of convex optimization problems
- A forward–backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space
- Averaged mappings and the gradient-projection algorithm
- Convex analysis \& approximation of fixed points
- Dualization of signal recovery problems
- Finite perturbation of convex programs
- scientific article; zbMATH DE number 48239 (Why is no real title available?)
- scientific article; zbMATH DE number 3551792 (Why is no real title available?)
- scientific article; zbMATH DE number 1522774 (Why is no real title available?)
- scientific article; zbMATH DE number 5176444 (Why is no real title available?)
- Nonlinear Ill-posed Problems of Monotone Type
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- Signal Recovery by Proximal Forward-Backward Splitting
- Splitting Algorithms for the Sum of Two Nonlinear Operators
This page was built for publication: A first-order method for solving bilevel convex optimization problems in Banach space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565292)
