Iterative methods for constrained convex minimization problem in Hilbert spaces

DOI10.1186/1687-1812-2013-105zbMATH Open1292.58013OpenAlexW2163579744WikidataQ59301555 ScholiaQ59301555MaRDI QIDQ2249114FDOQ2249114

Authors: Ming Tian, Li-Hua Huang 

Publication date: 8 July 2014

Published in: Fixed Point Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/1687-1812-2013-105

Recommendations

• Iterative approximation of solutions for constrained convex minimization problem
• Approximation of solutions to constrained convex minimization problem in Hilbert spaces
• Some iterative methods for finding fixed points and for solving constrained convex minimization problems
• A general iterative method for solving constrained convex minimization problems
• Iterative algorithms for solving mixed equilibrium problems and constrained convex minimization problems

zbMATH Keywords

iterative algorithmfixed pointnonexpansive mappingvariational inequalityconstrained convex minimization

Mathematics Subject Classification ID

Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical solutions to equations with nonlinear operators (65J15) Variational inequalities (global problems) in infinite-dimensional spaces (58E35)

Cites Work

• On Projection Algorithms for Solving Convex Feasibility Problems
• A multiprojection algorithm using Bregman projections in a product space
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
• Projected gradient methods for linearly constrained problems
• Projection methods for variational inequalities with application to the traffic assignment problem
• Title not available (Why is that?)
• An alternating projection that does not converge in norm
• Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
• Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
• Strong convergence of the CQ method for fixed point iteration processes
• Title not available (Why is that?)
• Solving the split feasibility problem without prior knowledge of matrix norms
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Averaged mappings and the gradient-projection algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• A viscosity of Cesàro mean approximation methods for a mixed equilibrium, variational inequalities, and fixed point problems
• A new modified hybrid steepest-descent by using a viscosity approximation method with a weakly contractive mapping for a system of equilibrium problems and fixed point problems with minimization problems
• A general composite iterative method for generalized mixed equilibrium problems, variational inequality problems and optimization problems
• A new iterative algorithm for solving common solutions of generalized mixed equilibrium problems, fixed point problems and variational inclusion problems with minimization problems
• A hybrid extragradient viscosity approximation method for solving equilibrium problems and fixed point problems of infinitely many nonexpansive mappings
• A general iterative approach to variational inequality problems and optimization problems

Cited In (18)

• Stochastic approximation results for variational inequality problem using random-type iterative schemes
• Some iterative methods for finding fixed points and for solving constrained convex minimization problems
• Iterative approximation for convex optimization problems with operator constraints in a Hilbert space
• Title not available (Why is that?)
• The common solution for a generalized equilibrium problem, a variational inequality problem and a hierarchical fixed point problem
• General iterative algorithms for solving unconstrained convex optimization problems
• Title not available (Why is that?)
• General iterative scheme based on the regularization for solving a constrained convex minimization problem
• An iterative algorithm for fixed point problem and convex minimization problem with applications
• A general iterative method for solving constrained convex minimization problems
• Approximation of solutions to constrained convex minimization problem in Hilbert spaces
• A general iterative method for minimizing the sum of two convex functions
• Iterative algorithms with the regularization for the constrained convex minimization problem and maximal monotone operators
• Title not available (Why is that?)
• Title not available (Why is that?)
• Iteration methods for convexly constrained ill-posed problems in hilbert space
• Iterative approximation of solutions for constrained convex minimization problem
• On the relaxed hybrid-extragradient method for solving constrained convex minimization problems in Hilbert spaces

This page was built for publication: Iterative methods for 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 Q2249114)