Pages that link to "Item:Q403666"

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

Displaying 50 items.

• Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems (Q6182324) (← links)
• Scaled proximal gradient methods for sparse optimization problems (Q6184263) (← links)
• A Fast Minimization Algorithm for the Euler Elastica Model Based on a Bilinear Decomposition (Q6189172) (← links)
• Template-based image reconstruction facing different topologies (Q6191359) (← links)
• Analysis of a variable metric block coordinate method under proximal errors (Q6195234) (← links)
• An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost (Q6200957) (← links)
• Convergence Rate Analysis of a Dykstra-Type Projection Algorithm (Q6202756) (← links)
• A Path-Based Approach to Constrained Sparse Optimization (Q6202768) (← links)
• (Q6203708) (← links)
• A structure noise-aware tensor dictionary learning method for high-dimensional data clustering (Q6205030) (← links)
• Quadratic Growth and Linear Convergence of a DCA Method for Quartic Minimization over the Sphere (Q6493976) (← links)
• A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis (Q6497038) (← links)
• SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization (Q6498409) (← links)
• A proximal alternating direction method of multipliers for DC programming with structured constraints (Q6536834) (← links)
• Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants (Q6540011) (← links)
• Stochastic Gauss-Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks (Q6540474) (← links)
• A new proximal heavy ball inexact line-search algorithm (Q6541375) (← links)
• Convergence analysis of block majorize-minimize subspace approach (Q6542454) (← links)
• The gradient projection method for a supporting function on the unit sphere and its applications (Q6552607) (← links)
• A layer potential approach to inverse problems in brain imaging (Q6554754) (← links)
• A stochastic ADMM algorithm for large-scale ptychography with weighted difference of anisotropic and isotropic total variation (Q6557664) (← links)
• On the convergence of inexact alternate minimization in problems with \(\ell_0\) penalties (Q6559515) (← links)
• A scalable sphere-constrained magnitude-sparse SAR imaging (Q6561480) (← links)
• Long term dynamics of the subgradient method for Lipschitz path differentiable functions (Q6566415) (← links)
• A Bregman-style improved ADMM and its linearized version in the nonconvex setting: convergence and rate analyses (Q6566776) (← links)
• An inexactly accelerated algorithm for nonnegative tensor CP decomposition with the column unit constraints (Q6568930) (← links)
• The backtrack Hölder gradient method with application to min-max and min-min problems (Q6569340) (← links)
• Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems (Q6569683) (← links)
• A novel nonconvex relaxation approach to low-rank matrix completion of inexact observed data (Q6573016) (← links)
• Alternating block linearized Bregman iterations for regularized nonnegative matrix factorization (Q6574508) (← links)
• Reconstructing the shape and material parameters of dissipative obstacles using an impedance model (Q6581203) (← links)
• Generalized nonconvex nonsmooth four-directional total variation with overlapping group sparsity for image restoration (Q6582004) (← links)
• Smooth robust tensor completion for background/foreground separation with missing pixels: novel algorithm with convergence guarantee (Q6582885) (← links)
• A preconditioned alternating minimization framework for nonconvex and half quadratic regularization (Q6587563) (← links)
• Extrapolated plug-and-play three-operator splitting methods for nonconvex optimization with applications to image restoration (Q6587639) (← links)
• Non-Lipschitz variational models and their iteratively reweighted least squares algorithms for image denoising on surfaces (Q6587643) (← links)
• PhaseNet: a deep learning based phase reconstruction method for ground-based astronomy (Q6587655) (← links)
• A Levenberg-Marquardt method for nonsmooth regularized least squares (Q6590132) (← links)
• Incremental quaternion singular value decomposition and its application for low rank quaternion matrix completion (Q6590214) (← links)
• A stochastic two-step inertial Bregman proximal alternating linearized minimization algorithm for nonconvex and nonsmooth problems (Q6590593) (← links)
• An efficient regularized PR splitting type algorithm for two-block nonconvex linear constrained programs in \(\ell_{1 / 2}\) regularized compressed sensing problems (Q6591534) (← links)
• A nonmonotone accelerated proximal gradient method with variable stepsize strategy for nonsmooth and nonconvex minimization problems (Q6593828) (← links)
• An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints (Q6593830) (← links)
• Low-rank tensor regression for selection of grouped variables (Q6596183) (← links)
• On the rate of convergence of the difference-of-convex algorithm (DCA) (Q6596346) (← links)
• Nonconvex multi-period mean-variance portfolio optimization (Q6596973) (← links)
• Optimality conditions and numerical algorithms for a class of linearly constrained minimax optimization problems (Q6601202) (← links)
• A tensor train approach for internet traffic data completion (Q6601544) (← links)
• Orthogonal nonnegative matrix factorization problems for clustering: a new formulation and a competitive algorithm (Q6601546) (← links)
• Detecting clusters in multivariate response regression (Q6602354) (← links)