The backtrack Hölder gradient method with application to min-max and min-min problems
From MaRDI portal
Publication:6569340
DOI10.5802/OJMO.24MaRDI QIDQ6569340FDOQ6569340
Authors: Jérôme Bolte, Lilian E. Glaudin, Edouard Pauwels, Mathieu Serrurier 
Publication date: 9 July 2024
Published in: OJMO. Open Journal of Mathematical Optimization (Search for Journal in Brave)
Recommendations
- Two steps at a time-taking GAN training in stride with Tseng's method
- Alternating Proximal-Gradient Steps for (Stochastic) Nonconvex-Concave Minimax Problems
- Optimality Conditions for Nonsmooth Nonconvex-Nonconcave Min-Max Problems and Generative Adversarial Networks
- An implicit gradient-descent procedure for minimax problems
- Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization
Cites Work
- Title not available (Why is that?)
- On rings of operators. Reduction theory
- Title not available (Why is that?)
- Variational Analysis
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Title not available (Why is that?)
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Title not available (Why is that?)
- On gradients of functions definable in o-minimal structures
- Convex analysis and monotone operator theory in Hilbert spaces
- Universal gradient methods for convex optimization problems
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
- Proximal Subgradients, Marginal Values, and Augmented Lagrangians in Nonconvex Optimization
- Mathematical foundations of game theory
- Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence
- Lagrangian methods for composite optimization
- On the quality of first-order approximation of functions with Hölder continuous gradient
- An inertial Newton algorithm for deep learning
- Zur Theorie der Gesellschaftsspiele.
This page was built for publication: The backtrack Hölder gradient method with application to min-max and min-min problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6569340)
