Pages that link to "Item:Q1942265"
From MaRDI portal
The following pages link to Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods (Q1942265):
Displaying 50 items.
- On solutions of sparsity constrained optimization (Q259112) (← 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)
- Wavelet inpainting with the \(\ell_{0}\) sparse regularization (Q285527) (← links)
- Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity (Q285544) (← 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)
- An inexact proximal method for quasiconvex minimization (Q319853) (← links)
- Global convergence of a proximal linearized algorithm for difference of convex functions (Q331993) (← links)
- Techniques for gradient-based bilevel optimization with non-smooth lower level problems (Q334266) (← links)
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems (Q346822) (← links)
- A variational approach of the rank function (Q356507) (← 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)
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function (Q467409) (← 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)
- A projection method on measures sets (Q515908) (← links)
- Convergence of iterative hard-thresholding algorithm with continuation (Q523178) (← links)
- Stability of saddle points via explicit coderivatives of pointwise subdifferentials (Q526389) (← links)
- Nonconvex TGV regularization model for multiplicative noise removal with spatially varying parameters (Q667778) (← links)
- Variational contrast enhancement of gray-scale and RGB images (Q683636) (← links)
- Dual descent methods as tension reduction systems (Q727232) (← links)
- A block coordinate variable metric forward-backward algorithm (Q727391) (← links)
- A proximal point-type method for multicriteria optimization (Q741360) (← links)
- An optimally concentrated Gabor transform for localized time-frequency components (Q744473) (← 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)
- Tensor train rank minimization with hybrid smoothness regularization for visual data recovery (Q821724) (← links)
- An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems (Q825333) (← links)
- Convergence of proximal algorithms with stepsize controls for non-linear inverse problems and application to sparse non-negative matrix factorization (Q827076) (← links)
- Continuous dynamics related to monotone inclusions and non-smooth optimization problems (Q829490) (← links)
- Weighted hyper-Laplacian prior with overlapping group sparsity for image restoration under Cauchy noise (Q831244) (← links)
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem (Q890462) (← links)
- Error bounds and Hölder metric subregularity (Q904312) (← links)
- Flows generating nonlinear eigenfunctions (Q1635875) (← links)
- Local convergence of the heavy-ball method and iPiano for non-convex optimization (Q1637355) (← links)
- A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis (Q1639712) (← 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)
- Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation (Q1654384) (← 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)
