Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
Abstract Let H be a real Hilbert space and C be a nonempty closed convex subset of H. Assume that g is a real-valued convex function and the gradient ∇g is 1 L $\frac{1}{L}$ -ism with L > 0 $L>0$ . Let 0 < λ < 2 L + 2 $0<\lambda <\frac{2}{L+2}$ , 0 < β n < 1 $0<\beta_{n}&l...
Main Authors: | Ming Tian, Hui-Fang Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2017-01-01
|
Series: | Journal of Inequalities and Applications |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s13660-016-1289-4 |
Similar Items
-
An intermixed iteration for constrained convex minimization problem and split feasibility problem
by: Kanyanee Saechou, et al.
Published: (2019-10-01) -
Regularized Minimization of Convex Functions in Radon Nikodym Space
by: Nourddin SAIDOU, et al.
Published: (2018-04-01) -
Constrained Minimization Problem for Image Restoration Based on Non-Convex Hybrid Regularization
by: Jianguang Zhu, et al.
Published: (2020-01-01) -
Regularity Results for Local Minimizers of Functionals with Discontinuous Coefficients
by: Raffaella Giova, et al.
Published: (2016-12-01) -
Regularized magnetotelluric inversion based on a minimum support gradient stabilizing functional
by: Yang Xiang, et al.
Published: (2017-11-01)