The complexity of first-order optimization methods from a metric perspective
From MaRDI portal
Cites work
- A family of functional inequalities: Łojasiewicz inequalities and displacement convex functions
- A moving balls approximation method for a class of smooth constrained minimization problems
- An Introduction to Optimization on Smooth Manifolds
- Arcs and Geodesics in Metric Spaces
- Characterizations of error bounds for lower semicontinuous functions on metric spaces
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Clarke Subgradients of Stratifiable Functions
- Computational optimal transport. With applications to data sciences
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Convex analysis and optimization in Hadamard spaces
- Convex functionals and generalized harmonic maps into spaces of non positive curvature
- Curves of descent
- Error bounds and convergence analysis of feasible descent methods: A general approach
- From error bounds to the complexity of first-order descent methods for convex functions
- Geometric categories and o-minimal structures
- Gradient flows in metric spaces and in the space of probability measures
- Gradient flows on nonpositively curved metric spaces and harmonic maps
- scientific article; zbMATH DE number 3728944 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 1160037 (Why is no real title available?)
- scientific article; zbMATH DE number 1385418 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
- Kurdyka–Łojasiewicz–Simon inequality for gradient flows in metric spaces
- Lipschitzian properties of multifunctions
- Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
- Monotone (nonlinear) operators in Hilbert space
- Nonlinear error bounds via a change of function
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- On gradients of functions definable in o-minimal structures
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- On the variational principle
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal gradient method for nonsmooth optimization over the Stiefel manifold
- The proximal point algorithm in metric spaces
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Variational Analysis
- Variational analysis of regular mappings. Theory and applications
- Łojasiewicz inequality at singular points
This page was built for publication: The complexity of first-order optimization methods from a metric perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6962866)
