Pages that link to "Item:Q1650767"

The following pages link to A simplified view of first order methods for optimization (Q1650767):

Displaying 35 items.

• Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems (Q2010107) (← links)
• New characterizations of Hoffman constants for systems of linear constraints (Q2020601) (← links)
• Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems (Q2022322) (← links)
• A unified convergence analysis of stochastic Bregman proximal gradient and extragradient methods (Q2031928) (← links)
• The condition number of a function relative to a set (Q2039239) (← links)
• Accelerated Bregman proximal gradient methods for relatively smooth convex optimization (Q2044481) (← links)
• Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization (Q2044495) (← links)
• A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization (Q2046565) (← links)
• A dual Bregman proximal gradient method for relatively-strongly convex optimization (Q2092292) (← links)
• On the nonexpansive operators based on arbitrary metric: a degenerate analysis (Q2093074) (← links)
• Additive Schwarz methods for convex optimization with backtracking (Q2122660) (← links)
• A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints (Q2139259) (← links)
• Optimal complexity and certification of Bregman first-order methods (Q2149545) (← links)
• Some brief observations in minimizing the sum of locally Lipschitzian functions (Q2174893) (← links)
• On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity (Q2322369) (← links)
• Fast proximal algorithms for nonsmooth convex optimization (Q2661564) (← links)
• Accelerated additive Schwarz methods for convex optimization with adaptive restart (Q2666023) (← links)
• A generalized forward-backward splitting operator: degenerate analysis and applications (Q2685263) (← links)
• A simple nearly optimal restart scheme for speeding up first-order methods (Q2696573) (← links)
• Bregman three-operator splitting methods (Q2696977) (← links)
• Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions (Q4991666) (← links)
• Revisiting linearized Bregman iterations under Lipschitz-like convexity condition (Q5058656) (← links)
• Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists (Q6046287) (← links)
• Affine Invariant Convergence Rates of the Conditional Gradient Method (Q6076864) (← links)
• Stochastic composition optimization of functions without Lipschitz continuous gradient (Q6108982) (← links)
• No-regret algorithms in on-line learning, games and convex optimization (Q6120936) (← links)
• Bregman-Golden ratio algorithms for variational inequalities (Q6145051) (← links)
• An elementary approach to tight worst case complexity analysis of gradient based methods (Q6165581) (← links)
• An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant (Q6166106) (← links)
• Provable Phase Retrieval with Mirror Descent (Q6168333) (← links)
• Smoothing fast proximal gradient algorithm for the relaxation of matrix rank regularization problem (Q6169244) (← links)
• First-order methods for convex optimization (Q6169988) (← links)
• An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems (Q6182323) (← links)
• A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis (Q6497038) (← links)
• SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization (Q6498409) (← links)