Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms

From MaRDI portal
Publication:4586171

DOI10.1137/16M1080240zbMath1404.90106arXiv1606.06256OpenAlexW2466668725MaRDI QIDQ4586171

Andreas Themelis, Lorenzo Stella, Panagiotis Patrinos

Publication date: 12 September 2018

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.06256




Related Items

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problemsDouglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithmsA stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimizationProximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOCA Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized OptimizationProximal gradient flow and Douglas-Rachford splitting dynamics: global exponential stability via integral quadratic constraintsAn envelope for Davis-Yin splitting and strict saddle-point avoidanceSmoothing unadjusted Langevin algorithms for nonsmooth composite potential functionsConstrained composite optimization and augmented Lagrangian methodsA Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization ProblemsGlobally convergent coderivative-based generalized Newton methods in nonsmooth optimizationRole of subgradients in variational analysis of polyhedral functionsA globally convergent proximal Newton-type method in nonsmooth convex optimizationA proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluationsA Chain Rule for Strict Twice Epi-Differentiability and Its ApplicationsA proximal quasi-Newton method based on memoryless modified symmetric rank-one formulaEnvelope functions: unifications and further propertiesThe Generalized Bregman DistanceCatalyst Acceleration for First-order Convex Optimization: from Theory to PracticeInertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problemsInexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functionsDouglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence ResultsA Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima


Uses Software


Cites Work