Accelerated fixed point algorithm for convex bi-level optimization problems in Hilbert spaces with applications
From MaRDI portal
Publication:6567248
Recommendations
- A novel algorithm for convex bi-level optimization problems in Hilbert spaces with applications
- An accelerated proximal algorithm for regularized nonconvex and nonsmooth bi-level optimization
- scientific article; zbMATH DE number 7449564
- An inertial extrapolation method for convex simple bilevel optimization
- Alternating proximal algorithm for the problem of bi-level convex minimization
Cites work
- scientific article; zbMATH DE number 5154873 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first order method for solving convex bilevel optimization problems
- Approximation of common fixed points of a countable family of nonexpansive mappings in a Banach space
- Fixed Points by a New Iteration Method
- Fixed points of nonexpanding maps
- Mean Value Methods in Iteration
- Some methods of speeding up the convergence of iteration methods
- Strong convergence of composite iterative schemes for a countable family of nonexpansive mappings in Banach spaces
- Viscosity approximation methods for countable families of nonexpansive mappings in Banach spaces
- Viscosity approximation methods for fixed-points problems
Cited in
(2)
This page was built for publication: Accelerated fixed point algorithm for convex bi-level optimization problems in Hilbert spaces with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567248)
