General iterative methods for equilibrium and constrained convex minimization problem
From MaRDI portal
Recommendations
- A general iterative algorithm for finding a common solution of equilibrium and constrained convex minimization problems
- Iterative algorithms based on the viscosity approximation method for equilibrium and constrained convex minimization problem
- Regularized gradient-projection methods for equilibrium and constrained convex minimization problems
- A common solution of equilibrium, constrained convex minimization and fixed point problems
- A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems
Cites work
- A general iterative method for equilibrium problems and fixed point problems in Hilbert spaces
- A general iterative method for equilibrium problems and strict pseudo-contractions in Hilbert spaces
- A general iterative method for nonexpansive mappings in Hilbert spaces
- A hybrid approximation method for equilibrium and fixed point problems for a monotone mapping and a nonexpansive mapping
- A new hybrid iterative method for solution of equilibrium problems and fixed point problems for an inverse strongly monotone operator and a nonexpansive mapping
- A new iterative method for equilibrium problems and fixed point problems of nonexpansive mappings and monotone mappings
- An iterative approach to quadratic optimization
- An iterative method of solution for equilibrium and optimization problems
- An iterative scheme for equilibrium problems and fixed point problems of strict pseudo-contraction mappings
- Averaged mappings and the gradient-projection algorithm
- Explicit hierarchical fixed point approach to variational inequalities
- Iterative Algorithms for Nonlinear Operators
- Projection methods for variational inequalities with application to the traffic assignment problem
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- Strong convergence of composite iterative methods for equilibrium problems and fixed point problems
- Strong convergence of iterative methods for \(k\)-strictly pseudo-contractive mappings in Hilbert spaces
- Strong convergence theorems for nonexpansive mappings and inverse-strongly monotone mappings
- Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces
- Viscosity approximation methods for fixed-points problems
- Viscosity approximation methods for nonexpansive mappings
Cited in
(22)- Hybrid gradient-projection algorithm for solving constrained convex minimization problems with generalized mixed equilibrium problems
- A hybrid gradient-projection algorithm for averaged mappings in Hilbert spaces
- General iterative methods for system of equilibrium problems and constrained convex minimization problem in Hilbert spaces
- Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator
- A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem
- An intermixed iteration for constrained convex minimization problem and split feasibility problem
- Regularized gradient-projection methods for equilibrium and constrained convex minimization problems
- Methods for solving constrained convex minimization problems and finding zeros of the sum of two operators in Hilbert spaces
- A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems
- A general iterative scheme with applications to convex optimization and related fields
- An iterative method with norm convergence for a class of generalized equilibrium problems
- Iterative algorithms based on the viscosity approximation method for equilibrium and constrained convex minimization problem
- Inertial Haugazeau's hybrid subgradient extragradient algorithm for variational inequality problems in Banach spaces
- A common solution of equilibrium, constrained convex minimization and fixed point problems
- A general iterative algorithm for finding a common solution of equilibrium and constrained convex minimization problems
- Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
- Regularized gradient-projection algorithm for solving one-parameter nonexpansive semigroup, constrained convex minimization and generalized equilibrium problems
- An intermixed method for solving the combination of mixed variational inequality problems and fixed-point problems
- Inertial hybrid gradient method with adaptive step size for variational inequality and fixed point problems of multivalued mappings in Banach spaces
- Averaged mappings and the gradient-projection algorithm
- An intermixed algorithm for solving fixed point problems of proximal operators in Hilbert spaces
- A novel iterative algorithm for solving a class of variational inequality problems: revisions to ``On the intermixed method for mixed variational inequality problems: another look and some corrections
This page was built for publication: General iterative methods for equilibrium and constrained convex minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495596)
