Pages that link to "Item:Q403666"

The following pages link to Proximal alternating linearized minimization for nonconvex and nonsmooth problems (Q403666):

Displaying 50 items.

• Accelerating the DC algorithm for smooth functions (Q1749446) (← links)
• A non-smooth and non-convex regularization method for limited-angle CT image reconstruction (Q1755907) (← links)
• Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem (Q1785036) (← links)
• A block coordinate variable metric linesearch based proximal gradient method (Q1790669) (← links)
• Toward fast transform learning (Q1799980) (← links)
• An inexact PAM method for computing Wasserstein barycenter with unknown supports (Q1983867) (← links)
• A partially proximal linearized alternating minimization method for finding Dantzig selectors (Q1983897) (← links)
• A cubic spline penalty for sparse approximation under tight frame balanced model (Q1986544) (← links)
• Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems (Q1991713) (← links)
• Inertial alternating generalized forward-backward splitting for image colorization (Q1999474) (← links)
• Fast rank-one alternating minimization algorithm for phase retrieval (Q2000029) (← links)
• A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization (Q2000528) (← links)
• Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems (Q2022292) (← links)
• Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems (Q2022322) (← links)
• Kurdyka-Łojasiewicz property of zero-norm composite functions (Q2026719) (← links)
• Nonisometric surface registration via conformal Laplace-Beltrami basis pursuit (Q2027925) (← links)
• A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
• An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information (Q2031374) (← links)
• Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm (Q2031758) (← links)
• Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence (Q2031873) (← links)
• Image reconstruction by minimizing curvatures on image surface (Q2033284) (← links)
• A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem (Q2036185) (← links)
• Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning (Q2039229) (← links)
• An extended proximal ADMM algorithm for three-block nonconvex optimization problems (Q2043189) (← links)
• Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization (Q2044495) (← links)
• Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems (Q2046311) (← links)
• A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization (Q2046565) (← links)
• Incremental without replacement sampling in nonconvex optimization (Q2046568) (← links)
• A preconditioned difference of convex algorithm for truncated quadratic regularization with application to imaging (Q2051043) (← links)
• Quick-means: accelerating inference for K-means by learning fast transforms (Q2051290) (← links)
• Shifted eigenvalue decomposition method for computing C-eigenvalues of a piezoelectric-type tensor (Q2052265) (← links)
• BROCCOLI: overlapping and outlier-robust biclustering through proximal stochastic gradient descent (Q2066656) (← links)
• An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems (Q2067857) (← links)
• An ADMM-based SQP method for separably smooth nonconvex optimization (Q2069362) (← links)
• A proximal point like method for solving tensor least-squares problems (Q2070322) (← links)
• Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems (Q2070400) (← links)
• PCA reduced Gaussian mixture models with applications in superresolution (Q2077308) (← links)
• Proximal gradient method for nonconvex and nonsmooth optimization on Hadamard manifolds (Q2080822) (← links)
• An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications (Q2087522) (← links)
• On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint (Q2089778) (← links)
• On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
• Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization (Q2089885) (← links)
• Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems (Q2089886) (← links)
• Convergence properties of monotone and nonmonotone proximal gradient methods revisited (Q2093287) (← links)
• Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems (Q2098802) (← links)
• The \(\ell_{2,p}\) regularized total variation with overlapping group sparsity prior for image restoration with impulse noise (Q2098805) (← links)
• Tensor completion via a generalized transformed tensor t-product decomposition without t-SVD (Q2103412) (← links)
• Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms (Q2103418) (← links)
• Nonlinear matrix recovery using optimization on the Grassmann manifold (Q2105129) (← links)
• Solving blind ptychography effectively via linearized alternating direction method of multipliers (Q2111179) (← links)