Forward-backward algorithms for weakly convex problems
From MaRDI portal
Cites work
- A doubly graduated method for inference in Markov random field
- A Parallel Algorithm for a Class of Convex Programs
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
- Accelerated and inexact forward-backward algorithms
- An abstract convergence framework with application to inertial inexact forward-backward methods
- An inertial forward-backward algorithm for monotone inclusions
- Computing proximal points of nonconvex functions
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence of inexact forward-backward algorithms using the forward-backward envelope
- Convex analysis and monotone operator theory in Hilbert spaces
- Discrete tomography by convex--concave regularization and D.C. programming
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Error bounds revisited
- Faster subgradient methods for functions with Hölderian growth
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- Further properties of the forward-backward envelope with applications to difference-of-convex programming
- Global convergence of splitting methods for nonconvex composite optimization
- scientific article; zbMATH DE number 3626130 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- scientific article; zbMATH DE number 966291 (Why is no real title available?)
- Inexact and accelerated proximal point algorithms
- Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
- Nearly unbiased variable selection under minimax concave penalty
- On a globalization property
- On FISTA with a relative error rule
- On Fréchet subdifferentials
- On gradients of functions definable in o-minimal structures
- On semi- and subanalytic geometry
- Principled analyses and design of first-order methods with inexact proximal operators
- Prox-regular functions in Hilbert spaces
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Semiconcave functions, Hamilton-Jacobi equations, and optimal control
- Signal Recovery by Proximal Forward-Backward Splitting
- Solving (most) of a set of quadratic equalities: composite optimization for robust phase retrieval
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Stochastic model-based minimization of weakly convex functions
- Subgradient methods for sharp weakly convex functions
- The forward-backward splitting method for non-Lipschitz continuous minimization problems in Banach spaces
- Variable metric forward-backward splitting with applications to monotone inclusions in duality
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variable smoothing for weakly convex composite functions
- Variational Analysis
- Weak Sharp Minima in Mathematical Programming
- Weak sharp minima revisited. I: Basic theory
- Weakly convex optimization over Stiefel manifold using Riemannian subgradient-type methods
Cited in
(1)
This page was built for publication: Forward-backward algorithms for weakly convex problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7234509)
