Mathematical programming for the sum of two convex functions with applications to lasso problem, split feasibility problems, and image deblurring problem
From MaRDI portal
Publication:288028
Recommendations
- Mathematical programming over the solution set of the minimization problem for the sum of two convex functions
- Iiduka type algorithms for minimization problems in finite dimensional Hilbert spaces with applications in the image deblurring problem
- New proximal type algorithms for convex minimization and its application to image deblurring
- An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem
- \(l_1\)-\(l_2\) regularization of split feasibility problems
Cites work
- scientific article; zbMATH DE number 4021000 (Why is no real title available?)
- scientific article; zbMATH DE number 3472891 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 1090020 (Why is no real title available?)
- scientific article; zbMATH DE number 2182576 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A multiprojection algorithm using Bregman projections in a product space
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- An algorithm for total variation minimization and applications
- Averaged mappings and the gradient-projection algorithm
- Convex analysis and monotone operator theory in Hilbert spaces
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- Hierarchical problems with applications to mathematical programming with multiple sets split feasibility constraints
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- Monotone Operators and the Proximal Point Algorithm
- Nonlinear functional analysis. Fixed point theory and its applications
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Properties and iterative methods for the lasso and its variants
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- Signal Recovery by Proximal Forward-Backward Splitting
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Strong convergence for the proximal-gradient method
- Strong convergence theorems for maximal monotone operators with nonlinear mappings in Hilbert spaces
Cited in
(3)- Mathematical programming over the solution set of the minimization problem for the sum of two convex functions
- Optimization for the sum of finite functions over the solution set of split equality optimization problems with applications
- Iiduka type algorithms for minimization problems in finite dimensional Hilbert spaces with applications in the image deblurring problem
This page was built for publication: Mathematical programming for the sum of two convex functions with applications to lasso problem, split feasibility problems, and image deblurring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q288028)
