Iterative methods for constrained convex minimization problem in Hilbert spaces
From MaRDI portal
Publication:2249114
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
Cites work
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 6921240 (Why is no real title available?)
- scientific article; zbMATH DE number 3293978 (Why is no real title available?)
- scientific article; zbMATH DE number 3398324 (Why is no real title available?)
- A general composite iterative method for generalized mixed equilibrium problems, variational inequality problems and optimization problems
- A general iterative approach to variational inequality problems and optimization problems
- A hybrid extragradient viscosity approximation method for solving equilibrium problems and fixed point problems of infinitely many nonexpansive mappings
- A multiprojection algorithm using Bregman projections in a product space
- A new iterative algorithm for solving common solutions of generalized mixed equilibrium problems, fixed point problems and variational inclusion problems with minimization 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 unified treatment of some iterative algorithms in signal processing and image reconstruction
- A viscosity of Cesàro mean approximation methods for a mixed equilibrium, variational inequalities, and fixed point problems
- An alternating projection that does not converge in norm
- Averaged mappings and the gradient-projection algorithm
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- Projected gradient methods for linearly constrained problems
- Projection methods for variational inequalities with application to the traffic assignment problem
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
- Solving the split feasibility problem without prior knowledge of matrix norms
- Strong convergence of the CQ method for fixed point iteration processes
- The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
Cited in
(21)- Iterative algorithms with the regularization for the constrained convex minimization problem and maximal monotone operators
- A general iterative method for solving constrained convex minimization problems
- 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
- scientific article; zbMATH DE number 687723 (Why is no real title available?)
- scientific article; zbMATH DE number 1943014 (Why is no real title available?)
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- The hybrid steepest descent method for split variational inclusion and constrained convex minimization problems
- Iterative approximation for convex optimization problems with operator constraints in a Hilbert space
- scientific article; zbMATH DE number 5310524 (Why is no real title available?)
- Stochastic approximation results for variational inequality problem using random-type iterative schemes
- Iterative approximation of solutions for constrained convex minimization problem
- A general iterative method for minimizing the sum of two convex functions
- The common solution for a generalized equilibrium problem, a variational inequality problem and a hierarchical fixed point problem
- scientific article; zbMATH DE number 3965827 (Why is no real title available?)
- On the relaxed hybrid-extragradient method for solving constrained convex minimization problems in Hilbert spaces
- A general approximation method for a kind of convex optimization problems in Hilbert spaces
- Projection and contraction methods for constrained convex minimization problem and the zero points of maximal monotone operator
- An iterative algorithm for fixed point problem and convex minimization problem with applications
- General iterative algorithms for solving unconstrained convex optimization problems
- General iterative scheme based on the regularization for solving a constrained convex minimization problem
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)
