Pages that link to "Item:Q2364124"

The following pages link to Forward-backward quasi-Newton methods for nonsmooth optimization problems (Q2364124):

Displaying 43 items.

• Local convergence of the heavy-ball method and iPiano for non-convex optimization (Q1637355) (← links)
• Envelope functions: unifications and further properties (Q1730819) (← links)
• Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions (Q2028458) (← links)
• Globalized inexact proximal Newton-type methods for nonconvex composite functions (Q2028488) (← links)
• The forward-backward splitting method and its convergence rate for the minimization of the sum of two functions in Banach spaces (Q2037899) (← links)
• An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems (Q2125070) (← links)
• An accelerated coordinate gradient descent algorithm for non-separable composite optimization (Q2139254) (← links)
• Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms (Q2141355) (← links)
• Second order semi-smooth proximal Newton methods in Hilbert spaces (Q2141359) (← links)
• A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization (Q2149551) (← links)
• The developments of proximal point algorithms (Q2158107) (← links)
• Kurdyka-Łojasiewicz exponent via inf-projection (Q2162122) (← links)
• Further properties of the forward-backward envelope with applications to difference-of-convex programming (Q2364125) (← 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 family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization (Q2672727) (← links)
• A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula (Q2691372) (← links)
• An abstract convergence framework with application to inertial inexact forward-backward methods (Q2696904) (← links)
• Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components (Q4554066) (← links)
• Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms (Q4586171) (← links)
• A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization (Q5076711) (← links)
• Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope (Q5131965) (← links)
• Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results (Q5210517) (← links)
• An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration (Q5231671) (← links)
• On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence (Q5235484) (← links)
• Adaptive FISTA for Nonconvex Optimization (Q5235485) (← links)
• A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization (Q5244401) (← links)
• A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (Q5853567) (← links)
• A Trust-region Method for Nonsmooth Nonconvex Optimization (Q5881403) (← links)
• Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions (Q6090288) (← 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)
• Newton-type methods with the proximal gradient step for sparse estimation (Q6130698) (← links)
• Role of subgradients in variational analysis of polyhedral functions (Q6151593) (← links)
• Nonmonotone globalization for Anderson acceleration via adaptive regularization (Q6159247) (← links)
• Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification (Q6165598) (← links)
• The forward-backward envelope for sampling with the overdamped Langevin algorithm (Q6173566) (← links)
• Massively parallelizable proximal algorithms for large‐scale stochastic optimal control problems (Q6180307) (← links)
• Template-based image reconstruction facing different topologies (Q6191359) (← links)
• A Chain Rule for Strict Twice Epi-Differentiability and Its Applications (Q6195317) (← links)
• Coordinate descent methods beyond smoothness and separability (Q6498410) (← links)
• A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping (Q6639509) (← links)
• Inexact reduced gradient methods in nonconvex optimization (Q6655782) (← links)