An accelerated mirror descent algorithm for constrained nonconvex problems
From MaRDI portal
Cites work
- A customized inertial proximal alternating minimization for SVD-free robust principal component analysis
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
- A golden ratio primal-dual algorithm for structured convex optimization
- A golden ratio proximal alternating direction method of multipliers for separable convex optimization
- A new hybrid generalized proximal point algorithm for variational inequality problems
- A simplified view of first order methods for optimization
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- Bregman proximal point type algorithms for quasiconvex minimization
- Bregman-Golden ratio algorithms for variational inequalities
- Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence Rates in Forward--Backward Splitting
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- Global convergence of model function based Bregman proximal minimization algorithms
- Golden ratio algorithms for variational inequalities
- Gradient-based algorithms with applications to signal-recovery problems
- scientific article; zbMATH DE number 1046019 (Why is no real title available?)
- Image deblurring with Poisson data: from cells to galaxies
- Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
- Inverse problems with Poisson data: statistical regularization theory, applications and algorithms
- iPiano: inertial proximal algorithm for nonconvex optimization
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal-like incremental aggregated gradient method with linear convergence under Bregman distance growth conditions
- Relatively smooth convex optimization by first-order methods, and applications
- Solving mixed variational inequalities beyond convexity
- The ordered subsets mirror descent optimization method with applications to tomography
This page was built for publication: An accelerated mirror descent algorithm for constrained nonconvex problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230098)
