Accelerated fixed point algorithm for convex bi-level optimization problems in Hilbert spaces with applications
From MaRDI portal
Publication:6567248
Authors: Suthep Suantai, Serdar Rozyyev Error creating thumbnail:
Publication date: 4 July 2024
Published in: Journal of Nonlinear Analysis and Optimization: Theory \& Applications (Search for Journal in Brave)
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
Iterative numerical methods for linear systems (65F10) Numerical computation of solutions to systems of equations (65H10)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Title not available (Why is that?)
- Fixed points of nonexpanding maps
- Viscosity approximation methods for fixed-points problems
- Approximation of common fixed points of a countable family of nonexpansive mappings in a Banach space
- Fixed Points by a New Iteration Method
- Mean Value Methods in Iteration
- Viscosity approximation methods for countable families of nonexpansive mappings in Banach spaces
- 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
- A first order method for solving convex bilevel optimization 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)
