The backtrack Hölder gradient method with application to min-max and min-min problems

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Universal gradient methods for convex optimization problems
On gradients of functions definable in o-minimal structures
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
On the quality of first-order approximation of functions with Hölder continuous gradient
On rings of operators. Reduction theory
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
Lagrangian methods for composite optimization
Proximal Subgradients, Marginal Values, and Augmented Lagrangians in Nonconvex Optimization
Variational Analysis
Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
An Inertial Newton Algorithm for Deep Learning
Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence
Mathematical Foundations of Game Theory
A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
Convergence of the Iterates of Descent Methods for Analytic Cost Functions
Convex analysis and monotone operator theory in Hilbert spaces
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