Mathematical programming for the sum of two convex functions with applications to lasso problem, split feasibility problems, and image deblurring problem

DOI10.1186/S13663-015-0388-0zbMATH Open1338.90405OpenAlexW1782936766WikidataQ59430198 ScholiaQ59430198MaRDI QIDQ288028FDOQ288028

Authors: Chih-Sheng Chuang, Lai-Jiu Lin, Zenn-Tsuen Yu 

Publication date: 24 May 2016

Published in: Fixed Point Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13663-015-0388-0

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

zbMATH Keywords

gradient-projection algorithmproximal point algorithmsplit feasibility problemlasso problemmathematical programming for the sum of two functions

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Semi-infinite programming (90C34)

Cites Work

• Title not available (Why is that?)
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Convex analysis and monotone operator theory in Hilbert spaces
• A multiprojection algorithm using Bregman projections in a product space
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Iterative oblique projection onto convex sets and the split feasibility problem
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• Signal Recovery by Proximal Forward-Backward Splitting
• An algorithm for total variation minimization and applications
• Nonlinear functional analysis. Fixed point theory and its applications
• Title not available (Why is that?)
• Monotone Operators and the Proximal Point Algorithm
• Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
• Title not available (Why is that?)
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Title not available (Why is that?)
• Strong convergence theorems for maximal monotone operators with nonlinear mappings in Hilbert spaces
• Averaged mappings and the gradient-projection algorithm
• Properties and iterative methods for the lasso and its variants
• Title not available (Why is that?)
• Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
• Title not available (Why is that?)
• Hierarchical problems with applications to mathematical programming with multiple sets split feasibility constraints
• Title not available (Why is that?)

Cited In (1)

• Optimization for the sum of finite functions over the solution set of split equality optimization problems with applications

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)