A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems

In this article, we provide a general iterative method for solving an equilibrium and a constrained convex minimization problem. By using the idea of regularized gradient-projection algorithm (RGPA), we find a common element, which is also a solution of a variational inequality problem. Then the str...

Full description

Saved in:
Bibliographic Details
Published in:Optimization Vol. 65; no. 11; pp. 2007 - 2024
Main Authors: Tian, Ming, Jiao, Si-Wen
Format: Journal Article
Language:English
Published: Philadelphia Taylor & Francis 01.11.2016
Taylor & Francis LLC
Subjects:
Algorithms
constrained convex minimization
Constraints
Convergence
Equilibrium
fixed point
general iterative algorithms
Inequalities
Iterative methods
Minimization
Optimization
Portfolio management
Regularization methods
Theorems
Variational inequality
ISSN:0233-1934, 1029-4945
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this article, we provide a general iterative method for solving an equilibrium and a constrained convex minimization problem. By using the idea of regularized gradient-projection algorithm (RGPA), we find a common element, which is also a solution of a variational inequality problem. Then the strong convergence theorems are obtained under suitable conditions.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0233-1934
1029-4945
DOI:10.1080/02331934.2016.1193738