Inertial Bregman proximal gradient under partial smoothness
From MaRDI portal
Cites work
- A dynamical approach to an inertial forward-backward algorithm for convex minimization
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A parametric maximum flow approach for discrete total variation regularization
- A simplified view of first order methods for optimization
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
- Active Sets, Nonsmoothness, and Sensitivity
- Activity identification and local linear convergence of Douglas-Rachford/ADMM under partial smoothness
- Activity identification and local linear convergence of forward-backward-type methods
- An inertial forward-backward algorithm for monotone inclusions
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- An Introduction to Optimization on Smooth Manifolds
- Bregman Monotone Optimization Algorithms
- Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Clarke Subgradients of Stratifiable Functions
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convergence of a splitting inertial proximal method for monotone operators
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization
- Do stochastic algorithms avoid traps?
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- First-order methods almost always avoid strict saddle points
- Forward-backward splitting with Bregman distances
- Generic minimizing behavior in semialgebraic optimization
- Gradient descent only converges to minimizers: non-isolated critical points and invariant regions
- scientific article; zbMATH DE number 3980052 (Why is no real title available?)
- scientific article; zbMATH DE number 4044567 (Why is no real title available?)
- scientific article; zbMATH DE number 2155014 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- Identifiable Surfaces in Constrained Optimization
- Identifying active manifolds in regularization problems
- Identifying active manifolds.
- Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- Local linear convergence analysis of primal-dual splitting methods
- Nonconvergence to unstable points in urn models and stochastic approximations
- Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence
- On gradients of functions definable in o-minimal structures
- On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity
- On the convergence of projected gradient processes to singular critical points
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- On the Equivalence of Soft Wavelet Shrinkage, Total Variation Diffusion, Total Variation Regularization, and SIDEs
- On the Identification of Active Constraints
- On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
- Optimal complexity and certification of Bregman first-order methods
- Optimality, identifiability, and sensitivity
- Phase recovery, MaxCut and complex semidefinite programming
- Provable Phase Retrieval with Mirror Descent
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal methods avoid active strict saddles of weakly convex functions
- Relatively smooth convex optimization by first-order methods, and applications
- Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs
- Some methods of speeding up the convergence of iteration methods
- Stochastic subgradient descent escapes active strict saddles on weakly convex functions
- The gradient and heavy ball with friction dynamical systems: The quasiconvex case
- The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than 1/k^2
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Variational analysis of regular mappings. Theory and applications
This page was built for publication: Inertial Bregman proximal gradient under partial smoothness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7254940)
