Hybrid gradient-projection algorithm for solving constrained convex minimization problems with generalized mixed equilibrium problems (Q1757914): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2012/678353 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2146337247 / rank | |||
Normal rank |
Revision as of 00:18, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hybrid gradient-projection algorithm for solving constrained convex minimization problems with generalized mixed equilibrium problems |
scientific article |
Statements
Hybrid gradient-projection algorithm for solving constrained convex minimization problems with generalized mixed equilibrium problems (English)
0 references
7 November 2012
0 references
Summary: It is well known that the gradient-projection algorithm (GPA) for solving constrained convex minimization problems has been proven to have only weak convergence unless the underlying Hilbert space is finite dimensional. In this paper, we introduce a new hybrid gradient-projection algorithm for solving constrained convex minimization problems with generalized mixed equilibrium problems in a real Hilbert space. It is proven that three sequences generated by this algorithm converge strongly to the unique solution of some variational inequality, which is also a common element of the set of solutions of a constrained convex minimization problem, the set of solutions of a generalized mixed equilibrium problem, and the set of fixed points of a strict pseudocontraction in a real Hilbert space.
0 references
gradient-projection algorithm
0 references
constrained convex minimization problem
0 references
mixed equilibrium problem
0 references
strong convergence
0 references