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
nonsmooth optimizationnonconvex optimizationquasi-Newton methodsprox-regularityforward-backward splittinglinesearch methods
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Methods of quasi-Newton type (90C53) Set-valued and variational analysis (49J53)
Related Items
Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems ⋮ Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms ⋮ A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization ⋮ Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC ⋮ A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization ⋮ Proximal gradient flow and Douglas-Rachford splitting dynamics: global exponential stability via integral quadratic constraints ⋮ An envelope for Davis-Yin splitting and strict saddle-point avoidance ⋮ Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions ⋮ Constrained composite optimization and augmented Lagrangian methods ⋮ A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems ⋮ Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization ⋮ Role of subgradients in variational analysis of polyhedral functions ⋮ A globally convergent proximal Newton-type method in nonsmooth convex optimization ⋮ A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations ⋮ A Chain Rule for Strict Twice Epi-Differentiability and Its Applications ⋮ A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula ⋮ Envelope functions: unifications and further properties ⋮ The Generalized Bregman Distance ⋮ Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice ⋮ Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems ⋮ Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions ⋮ Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results ⋮ A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Gradient methods for minimizing composite functions
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- On the limited memory BFGS method for large scale optimization
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Local convergence of quasi-Newton methods for B-differentiable equations
- On gradients of functions definable in o-minimal structures
- Proximal point methods and nonconvex optimization
- On semi- and subanalytic geometry
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Local convergence of quasi-Newton methods under metric regularity
- On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
- Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs
- The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Proximal Newton-Type Methods for Minimizing Composite Functions
- Computing B-Stationary Points of Nonsmooth DC Programs
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems
- Second-Order Optimality Conditions in Nonlinear Programming Obtained by Way of Epi-Derivatives
- Iteratively reweighted least squares minimization for sparse recovery
- First- and Second-Order Epi-Differentiability in Nonlinear Programming
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Updating Quasi-Newton Matrices with Limited Storage
- Quasi-Newton Methods, Motivation and Theory
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Proximal Mapping for Symmetric Penalty and Sparsity
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Generalized Hessian Properties of Regularized Nonsmooth Functions
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- Active Sets, Nonsmoothness, and Sensitivity
- Prox-regular functions in variational analysis
- Generalizations of the Dennis--Moré Theorem
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems