Pages that link to "Item:Q5853567"

The following pages link to A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (Q5853567):

Displaying 22 items.

• 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)
• Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC (Q2159445) (← links)
• Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity (Q2311123) (← links)
• Block Bregman Majorization Minimization with Extrapolation (Q5037560) (← links)
• Nonlinear Forward-Backward Splitting with Projection Correction (Q5152477) (← links)
• A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization (Q5244401) (← links)
• Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity (Q5869813) (← links)
• Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy (Q6076867) (← links)
• A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity (Q6078423) (← links)
• Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions (Q6090288) (← links)
• Stochastic composition optimization of functions without Lipschitz continuous gradient (Q6108982) (← links)
• A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems (Q6116248) (← links)
• A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems (Q6145571) (← links)
• An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions (Q6175564) (← links)
• SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization (Q6498409) (← links)
• A scalar Hessian estimation with a sparse nonmonotone line search technique for the sparse recovery problem (Q6574066) (← links)
• A Bregman proximal subgradient algorithm for nonconvex and nonsmooth fractional optimization problems (Q6577595) (← links)
• An interior proximal gradient method for nonconvex optimization (Q6584340) (← links)
• Extrapolated plug-and-play three-operator splitting methods for nonconvex optimization with applications to image restoration (Q6587639) (← links)
• High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods (Q6634529) (← links)
• A mirror inertial forward-reflected-backward splitting: convergence analysis beyond convexity and Lipschitz smoothness (Q6644234) (← links)