Pages that link to "Item:Q3169101"
From MaRDI portal
The following pages link to Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality (Q3169101):
Displaying 50 items.
- Sparse Principal Component Analysis via Variable Projection (Q150980) (← links)
- Nonsmooth bundle trust-region algorithm with applications to robust stability (Q255187) (← links)
- Half-linear regularization for nonconvex image restoration models (Q255993) (← links)
- A note on the complexity of proximal iterative hard thresholding algorithm (Q259117) (← links)
- A new approach to the proximal point method: convergence on general Riemannian manifolds (Q283913) (← links)
- On local convergence of the method of alternating projections (Q285438) (← links)
- Wavelet inpainting with the \(\ell_{0}\) sparse regularization (Q285527) (← links)
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions (Q285919) (← links)
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems (Q312683) (← links)
- Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity (Q334319) (← links)
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems (Q346822) (← links)
- Alternating projections on nontangential manifolds (Q387545) (← links)
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems (Q403666) (← links)
- Restricted normal cones and sparsity optimization with affine constraints (Q404252) (← links)
- Proximal point method on Finslerian manifolds and the ``effort-accuracy'' trade-off (Q463004) (← links)
- About \([q]\)-regularity properties of collections of sets (Q488731) (← 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)
- Local search proximal algorithms as decision dynamics with costs to move (Q632228) (← links)
- About subtransversality of collections of sets (Q683294) (← links)
- A convergent relaxation of the Douglas-Rachford algorithm (Q721957) (← 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)
- Key-frame detection and super-resolution of hyperspectral video via sparse-based cumulative tensor factorization (Q783190) (← links)
- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems (Q824547) (← links)
- Bregman proximal gradient algorithms for deep matrix factorization (Q826170) (← links)
- Continuous dynamics related to monotone inclusions and non-smooth optimization problems (Q829490) (← links)
- Dual sufficient characterizations of transversality properties (Q830339) (← links)
- Transversality and alternating projections for nonconvex sets (Q895706) (← links)
- Error bounds and Hölder metric subregularity (Q904312) (← links)
- Convergence rate analysis for the higher order power method in best rank one approximations of tensors (Q1616037) (← links)
- A seminorm regularized alternating least squares algorithm for canonical tensor decomposition (Q1631439) (← links)
- A convergent least-squares regularized blind deconvolution approach (Q1636832) (← links)
- Local convergence of the heavy-ball method and iPiano for non-convex optimization (Q1637355) (← 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)
- Peaceman-Rachford splitting for a class of nonconvex optimization problems (Q1687318) (← links)
- Convergence of ADMM for multi-block nonconvex separable optimization models (Q1690476) (← 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)
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights (Q1717220) (← links)
