Pages that link to "Item:Q4577742"

The following pages link to First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems (Q4577742):

Displaying 50 items.

• Bregman proximal gradient algorithms for deep matrix factorization (Q826170) (← links)
• A simplified view of first order methods for optimization (Q1650767) (← 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)
• Quartic first-order methods for low-rank minimization (Q2031993) (← links)
• Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization (Q2044495) (← 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)
• The forward-backward splitting method for non-Lipschitz continuous minimization problems in Banach spaces (Q2080834) (← links)
• Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems (Q2089886) (← links)
• Convergence properties of monotone and nonmonotone proximal gradient methods revisited (Q2093287) (← links)
• A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints (Q2139259) (← links)
• Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems (Q2141356) (← links)
• Optimal complexity and certification of Bregman first-order methods (Q2149545) (← links)
• Global convergence of model function based Bregman proximal minimization algorithms (Q2154449) (← links)
• Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC (Q2159445) (← links)
• Non-convex split Feasibility problems: models, algorithms and theory (Q2165583) (← links)
• Inexact version of Bregman proximal gradient algorithm (Q2198034) (← links)
• Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity (Q2302825) (← 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)
• General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems (Q2419543) (← links)
• First-order methods almost always avoid strict saddle points (Q2425175) (← links)
• An abstract convergence framework with application to inertial inexact forward-backward methods (Q2696904) (← links)
• Bregman three-operator splitting methods (Q2696977) (← links)
• Variable Metric Forward-Backward Algorithm for Composite Minimization Problems (Q4989931) (← links)
• Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions (Q4991666) (← links)
• Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons (Q5025784) (← links)
• Block Bregman Majorization Minimization with Extrapolation (Q5037560) (← links)
• Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization (Q5037570) (← links)
• Tensor methods for finding approximate stationary points of convex functions (Q5038435) (← links)
• Revisiting linearized Bregman iterations under Lipschitz-like convexity condition (Q5058656) (← links)
• A semi-alternating algorithm for solving nonconvex split equality problems (Q5067633) (← links)
• Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant (Q5093643) (← links)
• (Q5095420) (← links)
• Optimality Conditions for Minimizers at Infinity in Polynomial Programming (Q5108246) (← links)
• Novel Proximal Gradient Methods for Nonnegative Matrix Factorization with Sparsity Constraints (Q5108481) (← links)
• Efficient Numerical Methods for Computing the Stationary States of Phase Field Crystal Models (Q5146682) (← links)
• Composite Optimization by Nonconvex Majorization-Minimization (Q5230420) (← links)
• Modern regularization methods for inverse problems (Q5230515) (← links)
• A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (Q5853567) (← links)
• Dual Space Preconditioning for Gradient Descent (Q5857297) (← links)
• On inexact solution of auxiliary problems in tensor methods for convex optimization (Q5859013) (← links)
• Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework (Q5860343) (← links)
• Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity (Q5869813) (← links)
• Tangencies and polynomial optimization (Q6038670) (← links)
• New Bregman proximal type algoritms for solving DC optimization problems (Q6043133) (← links)
• Global convergence of the gradient method for functions definable in o-minimal structures (Q6052062) (← links)
• Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions (Q6071886) (← links)
• Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy (Q6076867) (← links)