Approximation of solutions to constrained convex minimization problem in Hilbert spaces

DOI10.1007/S10013-014-0091-1zbMATH Open1321.47150OpenAlexW2000658715MaRDI QIDQ496478FDOQ496478

Authors: Y. Shehu 

Publication date: 22 September 2015

Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10013-014-0091-1

Recommendations

• A convergence analysis result for constrained convex minimization problem
• Iterative approximation of solutions for constrained convex minimization problem
• Iterative methods for constrained convex minimization problem in Hilbert spaces
• A general approximation method for a kind of convex optimization problems in Hilbert spaces
• Iterative approximation for convex optimization problems with operator constraints in a Hilbert space

zbMATH Keywords

strong convergenceconstrained convex minimizationgradient projection method

Mathematics Subject Classification ID

Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Iterative procedures involving nonlinear operators (47J25)

Cites Work

• Solving monotone inclusions via compositions of nonexpansive averaged operators
• Geometric properties of Banach spaces and nonlinear iterations
• Nonlinear optimization.
• Projected gradient methods for linearly constrained problems
• Projection methods for variational inequalities with application to the traffic assignment problem
• Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
• Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
• Title not available (Why is that?)
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Some iterative methods for finding fixed points and for solving constrained convex minimization problems
• Averaged mappings and the gradient-projection algorithm
• Hankel determinant for a class of analytic functions involving a generalized linear differential operator
• Two-Metric Projection Methods for Constrained Optimization
• Shorter Notes: Some Operator Monotone Functions
• Iterative approximation of fixed points
• Title not available (Why is that?)
• Convergence of the gradient projection method for generalized convex minimization
• A regularized gradient projection method for the minimization problem
• A note on the gradient projection method with exact stepsize rule
• Title not available (Why is that?)
• Variant gradient projection methods for the minimization problems
• Title not available (Why is that?)

Cited In (5)

• A viscosity-proximal gradient method with inertial extrapolation for solving certain minimization problems in Hilbert space.
• A general approximation method for a kind of convex optimization problems in Hilbert spaces
• Iterative approximation for convex optimization problems with operator constraints in a Hilbert space
• Iterative methods for constrained convex minimization problem in Hilbert spaces
• Iterative approximation of solutions for constrained convex minimization problem

This page was built for publication: Approximation of solutions to constrained convex minimization problem in Hilbert spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496478)