Pages that link to "Item:Q959923"
From MaRDI portal
The following pages link to On the convergence of the proximal algorithm for nonsmooth functions involving analytic features (Q959923):
Displaying 50 items.
- A new approach to the proximal point method: convergence on general Riemannian manifolds (Q283913) (← links)
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions (Q285919) (← links)
- An inexact proximal method for quasiconvex minimization (Q319853) (← links)
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems (Q346822) (← links)
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems (Q403666) (← links)
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant (Q421699) (← links)
- Proximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifolds (Q441196) (← links)
- Proximal point method on Finslerian manifolds and the ``effort-accuracy'' trade-off (Q463004) (← links)
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function (Q467409) (← links)
- A numerical analysis of the Cahn-Hilliard equation with non-permeable walls (Q471200) (← links)
- Finite termination of inexact proximal point algorithms in Hilbert spaces (Q493258) (← links)
- Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes (Q493265) (← links)
- A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality (Q494873) (← links)
- A new alternating direction method for linearly constrained nonconvex optimization problems (Q496618) (← links)
- GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression (Q515771) (← links)
- Convergence of iterative hard-thresholding algorithm with continuation (Q523178) (← links)
- Local search proximal algorithms as decision dynamics with costs to move (Q632228) (← links)
- Dual descent methods as tension reduction systems (Q727232) (← links)
- A block coordinate variable metric forward-backward algorithm (Q727391) (← links)
- The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\) (Q730526) (← links)
- Inexact proximal point methods in metric spaces (Q763334) (← links)
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms (Q778013) (← links)
- Bregman proximal gradient algorithms for deep matrix factorization (Q826170) (← links)
- Continuous dynamics related to monotone inclusions and non-smooth optimization problems (Q829490) (← links)
- A proximal alternating linearization method for minimizing the sum of two convex functions (Q892779) (← links)
- Error bounds and Hölder metric subregularity (Q904312) (← links)
- A proximal iterative approach to a non-convex optimization problem (Q1049031) (← links)
- A seminorm regularized alternating least squares algorithm for canonical tensor decomposition (Q1631439) (← links)
- Local convergence of the heavy-ball method and iPiano for non-convex optimization (Q1637355) (← links)
- Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization (Q1650690) (← links)
- A simplified view of first order methods for optimization (Q1650767) (← links)
- Approaching nonsmooth nonconvex optimization problems through first order dynamical systems with hidden acceleration and Hessian driven damping terms (Q1653320) (← links)
- From error bounds to the complexity of first-order descent methods for convex functions (Q1675251) (← links)
- Global convergence of proximal iteratively reweighted algorithm (Q1675580) (← links)
- Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm (Q1675933) (← links)
- A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
- A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem (Q1685585) (← links)
- Convergence of ADMM for multi-block nonconvex separable optimization models (Q1690476) (← links)
- Extragradient method in optimization: convergence and complexity (Q1706412) (← links)
- The value function approach to convergence analysis in composite optimization (Q1709968) (← links)
- A new nonconvex approach to low-rank matrix completion with application to image inpainting (Q1710943) (← links)
- An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration (Q1716780) (← links)
- Convergence analysis of difference-of-convex algorithm with subanalytic data (Q1730802) (← links)
- A proximal difference-of-convex algorithm with extrapolation (Q1744881) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- Accelerating the DC algorithm for smooth functions (Q1749446) (← links)
- On the proximal gradient algorithm with alternated inertia (Q1752647) (← links)
- Proximal algorithms in statistics and machine learning (Q1790304) (← links)
- A block coordinate variable metric linesearch based proximal gradient method (Q1790669) (← links)
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods (Q1942265) (← links)
