Pages that link to "Item:Q2348695"

The following pages link to Multi-step fixed-point proximity algorithms for solving a class of optimization problems arising from image processing (Q2348695):

Displaying 28 items.

• A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions (Q284904) (← links)
• Fast proximity-gradient algorithms for structured convex optimization problems (Q739473) (← links)
• The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector (Q1686207) (← links)
• Image restoration by a mixed high-order total variation and \(l_1\) regularization model (Q1721281) (← links)
• Globalized inexact proximal Newton-type methods for nonconvex composite functions (Q2028488) (← links)
• A fixed-point proximity algorithm for recovering low-rank components from incomplete observation data with application to motion capture data refinement (Q2122054) (← links)
• Second order semi-smooth proximal Newton methods in Hilbert spaces (Q2141359) (← links)
• Inverting incomplete Fourier transforms by a sparse regularization model and applications in seismic wavefield modeling (Q2161553) (← links)
• Fixed-point proximity algorithm for minimal norm interpolation (Q2175027) (← links)
• Fixed-point proximity algorithms solving an incomplete Fourier transform model for seismic wavefield modeling (Q2222155) (← links)
• An adaptive fixed-point proximity algorithm for solving total variation denoising models (Q2293175) (← links)
• A content-adaptive unstructured grid based integral equation method with the TV regularization for SPECT reconstruction (Q2297897) (← links)
• A two-step fixed-point proximity algorithm for a class of non-differentiable optimization models in machine learning (Q2333729) (← links)
• Two-step fixed-point proximity algorithms for multi-block separable convex problems (Q2356610) (← links)
• A primal-dual algorithm framework for convex saddle-point optimization (Q2412865) (← links)
• Convergence rate analysis for fixed-point iterations of generalized averaged nonexpansive operators (Q2675377) (← links)
• Sparse Support Vector Machines in Reproducing Kernel Banach Spaces (Q4611831) (← links)
• A content-adaptive unstructured grid based regularized CT reconstruction method with a SART-type preconditioned fixed-point proximity algorithm (Q5030163) (← links)
• (Q5053232) (← links)
• Parameter choices for sparse regularization with the ℓ1 norm ^* (Q5060748) (← links)
• Generalized Mercer Kernels and Reproducing Kernel Banach Spaces (Q5383917) (← links)
• Sparse machine learning in Banach spaces (Q6106931) (← links)
• Fast multiscale functional estimation in optimal EMG placement for robotic prosthesis controllers (Q6143171) (← links)
• A duality approach to regularized learning problems in Banach spaces (Q6154551) (← links)
• A total fractional-order variation regularized reconstruction method for CT (Q6534798) (← links)
• Inexact fixed-point proximity algorithm for the \(\ell_0\) sparse regularization problem (Q6594655) (← links)
• Sparse recovery: the square of \(\ell_1/\ell_2\) norms (Q6655884) (← links)
• A Krasnoselskii-Mann proximity algorithm for Markowitz portfolios with adaptive expected return level (Q6670350) (← links)