Pages that link to "Item:Q4586171"

The following pages link to Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms (Q4586171):

Displaying 31 items.

• Envelope functions: unifications and further properties (Q1730819) (← links)
• Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems (Q2022322) (← links)
• Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions (Q2028458) (← links)
• Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems (Q2133414) (← links)
• Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms (Q2141355) (← links)
• A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization (Q2149551) (← links)
• Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC (Q2159445) (← links)
• An envelope for Davis-Yin splitting and strict saddle-point avoidance (Q2420798) (← links)
• Proximal gradient flow and Douglas-Rachford splitting dynamics: global exponential stability via integral quadratic constraints (Q2662276) (← links)
• A globally convergent proximal Newton-type method in nonsmooth convex optimization (Q2687066) (← links)
• A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula (Q2691372) (← links)
• Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice (Q4558545) (← links)
• A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization (Q5081096) (← links)
• The Generalized Bregman Distance (Q5147034) (← links)
• Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results (Q5210517) (← links)
• A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (Q5853567) (← links)
• Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions (Q6090288) (← links)
• Constrained composite optimization and augmented Lagrangian methods (Q6110459) (← links)
• A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems (Q6116248) (← links)
• Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization (Q6126654) (← links)
• Role of subgradients in variational analysis of polyhedral functions (Q6151593) (← links)
• A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations (Q6165597) (← links)
• A Chain Rule for Strict Twice Epi-Differentiability and Its Applications (Q6195317) (← links)
• SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization (Q6498409) (← links)
• A parameterized three-operator splitting algorithm for non-convex minimization problems with applications (Q6561488) (← links)
• Proximal gradient methods beyond monotony (Q6567228) (← 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)
• A Levenberg-Marquardt method for nonsmooth regularized least squares (Q6590132) (← links)
• A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping (Q6639509) (← links)
• A mirror inertial forward-reflected-backward splitting: convergence analysis beyond convexity and Lipschitz smoothness (Q6644234) (← links)