scientific article; zbMATH DE number 7165437
From MaRDI portal
Publication:5215311
zbMATH Open1449.90300MaRDI QIDQ5215311FDOQ5215311
Publication date: 7 February 2020
Title of this publication is not available (Why is that?)
critical pointsubdifferentialaccelerated proximal gradient methodcomposite nonconvex optimizationKurdyka-Łojasiewicz property
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cited In (7)
- Accelerated methods with fastly vanishing subgradients for structured non-smooth minimization
- On the interplay between acceleration and identification for the proximal gradient algorithm
- Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method
- Convergence rates of accelerated proximal gradient algorithms under independent noise
- A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives
- Nonconvex proximal incremental aggregated gradient method with linear convergence
- Proximal methods for reweighted \(l_Q\)-regularization of sparse signal recovery
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5215311)