A regret bound for the AdaMax algorithm with image segmentation application
From MaRDI portal
Cites work
- A hybrid HS-LS conjugate gradient algorithm for unconstrained optimization with applications in motion control and image recovery
- A modification of extragradient method for solving fixed point, variational inequality, and equilibrium problems without the monotonicity
- A modified Ishikawa iteration scheme for b‐enriched nonexpansive mapping to solve split variational inclusion problem and fixed point problem in Hilbert spaces
- A new class of inertial algorithms with monotonic step sizes for solving fixed point and variational inequalities
- A practical approach to quasi-convex optimization
- A unified scheme for solving split inclusions with applications
- Adaptive subgradient methods for online learning and stochastic optimization
- An efficient iterative method for solving split variational inclusion problem with applications
- Another hybrid approach for solving monotone operator equations and application to signal processing
- Double inertial extragradient algorithms for solving variational inequality problems with convergence analysis
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Hybrid iterative scheme for variational inequality problem involving pseudo-monotone operator with application in signal recovery
- On convergence and complexity of the modified forward‐backward method involving new linesearches for convex minimization
- Some methods of speeding up the convergence of iteration methods
This page was built for publication: A regret bound for the AdaMax algorithm with image segmentation application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6934154)
