A convergence analysis result for constrained convex minimization problem

Optimization ◽  
2013 ◽  
Vol 64 (12) ◽  
pp. 2587-2597 ◽  
Author(s):  
Yekini Shehu
Keyword(s):  
Convergence Analysis ◽  
Minimization Problem ◽  
Convex Minimization ◽  
Convex Minimization Problem ◽  
Constrained Convex Minimization ◽  
Constrained Convex Minimization Problem

scholarly journals Strong Convergence of Modified Algorithms Based on the Regularization for the Constrained Convex Minimization Problem

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Ming Tian ◽  
Jun-Ying Gong
Keyword(s):  
Minimization Problem ◽  
Iterative Algorithms ◽  
Split Feasibility Problem ◽  
Convex Minimization ◽  
Feasibility Problem ◽  
Convex Minimization Problem ◽  
Constrained Convex Minimization ◽  
Constrained Convex Minimization Problem ◽  
The Split Feasibility Problem ◽  
Implicit And Explicit

As is known, the regularization method plays an important role in solving constrained convex minimization problems. Based on the idea of regularization, implicit and explicit iterative algorithms are proposed in this paper and the sequences generated by the algorithms can converge strongly to a solution of the constrained convex minimization problem, which also solves a certain variational inequality. As an application, we also apply the algorithm to solve the split feasibility problem.

Sign in / Sign up

Export Citation Format

Share Document