Variant gradient projection methods for the minimization problems (Q448815): Difference between revisions

Summary: The gradient projection algorithm plays an important role in solving constrained convex minimization problems. In general, the gradient projection algorithm has only weak convergence in infinite-dimensional Hilbert spaces. Recently, H. K. Xu (2011) provided two modified gradient projection algorithms which have strong convergence. Motivated by Xu's work, in the present paper, we suggest three more simpler variant gradient projection methods so that strong convergence is guaranteed.

0 references

zbMATH Keywords

gradient projection algorithm: constrained convex minimization problems

0 references

weak convergence in infinite-dimensional Hilbert spaces

0 references

strong convergence.

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1155/2012/792078

0 references

cites work

Two-Metric Projection Methods for Constrained Optimization

0 references

Projected gradient methods for linearly constrained problems

0 references

Q3491338

0 references

Q3376534

0 references

Convergence of the gradient projection method for generalized convex minimization

0 references

Convergence properties of projection and contraction methods for variational inequality problems

0 references

Q5436078

0 references

Q4581775

0 references

A multiprojection algorithm using Bregman projections in a product space

0 references

A unified treatment of some iterative algorithms in signal processing and image reconstruction

0 references

The multiple-sets split feasibility problem and its applications for inverse problems

0 references

A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem

0 references

Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces

0 references

Perturbation techniques for nonexpansive mappings with applications

0 references

Averaged mappings and the gradient-projection algorithm

0 references

A New Projection Method for Variational Inequality Problems

0 references

Q3998720

0 references

Strong convergence of the CQ method for fixed point iteration processes

0 references

Iterative Algorithms for Nonlinear Operators

0 references

Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces

0 references

An iterative approach to a constrained least squares problem

0 references

Convexly constrained linear inverse problems: iterative least-squares and regularization

0 references

An iterative approach to quadratic optimization

0 references

A hybrid projection algorithm for finding solutions of mixed equilibrium problem and variational inequality problem

0 references

On a two-step algorithm for hierarchical fixed point problems and variational inequalities

0 references

Algorithms of common solutions for variational inclusions, mixed equilibrium problems and fixed point problems

0 references

Two-step projection methods for a system of variational inequality problems in Banach spaces

0 references

A unified implicit algorithm for solving the triple-hierarchical constrained optimization problem

0 references

On Projection Algorithms for Solving Convex Feasibility Problems

0 references

Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings

0 references

The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods

0 references

The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions

0 references

Identifiers

zbMATH Open document ID

1248.49046

0 references

DOI

10.1155/2012/792078

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:448815

@@ Property / review text @@
+Summary: The gradient projection algorithm plays an important role in solving constrained convex minimization problems. In general, the gradient projection algorithm has only weak convergence in infinite-dimensional Hilbert spaces. Recently, H. K. Xu (2011) provided two modified gradient projection algorithms which have strong convergence. Motivated by Xu's work, in the present paper, we suggest three more simpler variant gradient projection methods so that strong convergence is guaranteed.
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+M37
@@ Property / Mathematics Subject Classification ID: 49M37 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C52
@@ Property / Mathematics Subject Classification ID: 90C52 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6078810
@@ Property / zbMATH DE Number: 6078810 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+gradient projection algorithm: constrained convex minimization problems
+Normal rank
@@ Property / zbMATH Keywords @@
+weak convergence in infinite-dimensional Hilbert spaces
+Normal rank
@@ Property / zbMATH Keywords @@
+strong convergence.
@@ Property / zbMATH Keywords: strong convergence. / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q58696798
@@ Property / Wikidata QID: Q58696798 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1155/2012/792078
+Normal rank
@@ Property / OpenAlex ID @@
+W1996096646
@@ Property / OpenAlex ID: W1996096646 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-Metric Projection Methods for Constrained Optimization
+Normal rank
@@ Property / cites work @@
+Projected gradient methods for linearly constrained problems
+Normal rank
@@ Property / cites work @@
+Q3491338
@@ Property / cites work: Q3491338 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3376534
@@ Property / cites work: Q3376534 / rank @@
+Normal rank
@@ Property / cites work @@
+Convergence of the gradient projection method for generalized convex minimization
+Normal rank
@@ Property / cites work @@
+Convergence properties of projection and contraction methods for variational inequality problems
+Normal rank
@@ Property / cites work @@
+Q5436078
@@ Property / cites work: Q5436078 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4581775
@@ Property / cites work: Q4581775 / rank @@
+Normal rank
@@ Property / cites work @@
+A multiprojection algorithm using Bregman projections in a product space
+Normal rank
@@ Property / cites work @@
+A unified treatment of some iterative algorithms in signal processing and image reconstruction
+Normal rank
@@ Property / cites work @@
+The multiple-sets split feasibility problem and its applications for inverse problems
+Normal rank
@@ Property / cites work @@
+A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
+Normal rank
@@ Property / cites work @@
+Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
+Normal rank
@@ Property / cites work @@
+Perturbation techniques for nonexpansive mappings with applications
+Normal rank
@@ Property / cites work @@
+Averaged mappings and the gradient-projection algorithm
+Normal rank
@@ Property / cites work @@
+A New Projection Method for Variational Inequality Problems
+Normal rank
@@ Property / cites work @@
+Q3998720
@@ Property / cites work: Q3998720 / rank @@
+Normal rank
@@ Property / cites work @@
+Strong convergence of the CQ method for fixed point iteration processes
+Normal rank
@@ Property / cites work @@
+Iterative Algorithms for Nonlinear Operators
@@ Property / cites work: Iterative Algorithms for Nonlinear Operators / rank @@
+Normal rank
@@ Property / cites work @@
+Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces
+Normal rank
@@ Property / cites work @@
+An iterative approach to a constrained least squares problem
+Normal rank
@@ Property / cites work @@
+Convexly constrained linear inverse problems: iterative least-squares and regularization
+Normal rank
@@ Property / cites work @@
+An iterative approach to quadratic optimization
@@ Property / cites work: An iterative approach to quadratic optimization / rank @@
+Normal rank
@@ Property / cites work @@
+A hybrid projection algorithm for finding solutions of mixed equilibrium problem and variational inequality problem
+Normal rank
@@ Property / cites work @@
+On a two-step algorithm for hierarchical fixed point problems and variational inequalities
+Normal rank
@@ Property / cites work @@
+Algorithms of common solutions for variational inclusions, mixed equilibrium problems and fixed point problems
+Normal rank
@@ Property / cites work @@
+Two-step projection methods for a system of variational inequality problems in Banach spaces
+Normal rank
@@ Property / cites work @@
+A unified implicit algorithm for solving the triple-hierarchical constrained optimization problem
+Normal rank
@@ Property / cites work @@
+On Projection Algorithms for Solving Convex Feasibility Problems
+Normal rank
@@ Property / cites work @@
+Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
+Normal rank
@@ Property / cites work @@
+The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
+Normal rank
@@ Property / cites work @@
+The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:448815