Adaptive projection-free methods for constrained variational inequalities in machine learning
From MaRDI portal
Cites work
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- Iteration-complexity of first-order augmented Lagrangian methods for convex programming
- Monotone Operators and the Proximal Point Algorithm
- Optimization methods for large-scale machine learning
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Robust Stochastic Approximation Approach to Stochastic Programming
- Solving variational inequalities with stochastic mirror-prox algorithm
This page was built for publication: Adaptive projection-free methods for constrained variational inequalities in machine learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6848043)