Pages that link to "Item:Q5739143"

The following pages link to A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications (Q5739143):

Displaying 50 items.

• Bregman proximal gradient algorithms for deep matrix factorization (Q826170) (← links)
• A simplified view of first order methods for optimization (Q1650767) (← links)
• Monotone operator theory in convex optimization (Q1650774) (← links)
• A block coordinate variable metric linesearch based proximal gradient method (Q1790669) (← links)
• Point process estimation with Mirror Prox algorithms (Q2019904) (← links)
• New characterizations of Hoffman constants for systems of linear constraints (Q2020601) (← links)
• Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute'' gradient for structured convex optimization (Q2020608) (← links)
• Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence (Q2031873) (← links)
• A unified convergence analysis of stochastic Bregman proximal gradient and extragradient methods (Q2031928) (← links)
• On the linear convergence of forward-backward splitting method. I: Convergence analysis (Q2031953) (← links)
• Quartic first-order methods for low-rank minimization (Q2031993) (← links)
• The condition number of a function relative to a set (Q2039239) (← links)
• An enhanced Baillon-Haddad theorem for convex functions defined on convex sets (Q2041035) (← links)
• Accelerated Bregman proximal gradient methods for relatively smooth convex optimization (Q2044481) (← links)
• A Laplacian approach to \(\ell_1\)-norm minimization (Q2044482) (← links)
• Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization (Q2044495) (← links)
• Fastest rates for stochastic mirror descent methods (Q2044496) (← links)
• Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems (Q2046311) (← links)
• A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization (Q2046565) (← links)
• Bregman forward-backward operator splitting (Q2047252) (← links)
• An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization (Q2062324) (← links)
• The forward-backward splitting method for non-Lipschitz continuous minimization problems in Banach spaces (Q2080834) (← links)
• Cyclic coordinate descent in the Hölder smooth setting (Q2084003) (← links)
• Curiosities and counterexamples in smooth convex optimization (Q2089782) (← links)
• A dual Bregman proximal gradient method for relatively-strongly convex optimization (Q2092292) (← links)
• Convergence properties of monotone and nonmonotone proximal gradient methods revisited (Q2093287) (← links)
• Restarting Frank-Wolfe: faster rates under Hölderian error bounds (Q2116603) (← links)
• Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces (Q2141725) (← links)
• Optimal complexity and certification of Bregman first-order methods (Q2149545) (← links)
• Global convergence of model function based Bregman proximal minimization algorithms (Q2154449) (← links)
• Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems (Q2157903) (← links)
• Screening for a reweighted penalized conditional gradient method (Q2165597) (← links)
• Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions (Q2200083) (← links)
• Golden ratio algorithms for variational inequalities (Q2205983) (← links)
• Implementable tensor methods in unconstrained convex optimization (Q2227532) (← links)
• Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity (Q2302825) (← links)
• Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity (Q2311123) (← links)
• A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption (Q2322358) (← links)
• On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity (Q2322369) (← links)
• A simple convergence analysis of Bregman proximal gradient algorithm (Q2419573) (← links)
• Non-smooth non-convex Bregman minimization: unification and new algorithms (Q2420780) (← links)
• Convergence of the exponentiated gradient method with Armijo line search (Q2420800) (← links)
• New convergence results for the inexact variable metric forward-backward method (Q2662557) (← links)
• Superfast second-order methods for unconstrained convex optimization (Q2664892) (← links)
• Quadratic growth conditions and uniqueness of optimal solution to Lasso (Q2671439) (← links)
• Numerical methods for some classes of variational inequalities with relatively strongly monotone operators (Q2680746) (← links)
• Affine-invariant contracting-point methods for convex optimization (Q2687041) (← links)
• Perturbed Fenchel duality and first-order methods (Q2687051) (← links)
• Resolvent of the parallel composition and the proximity operator of the infimal postcomposition (Q2688920) (← links)
• Inexact accelerated high-order proximal-point methods (Q2689812) (← links)