Algorithms for approximating minimization problems in Hilbert spaces
From MaRDI portal
equilibrium problemfixed pointHilbert spaceiterative algorithmsminimization problemmonotone mappingnonexpansive mappingvariational inequality
Fixed-point theorems (47H10) Variational inequalities (49J40) Numerical methods based on necessary conditions (49M05) Numerical mathematical programming methods (65K05) Numerical methods for variational inequalities and related problems (65K15) Convex programming (90C25) Programming in abstract spaces (90C48)
The authors investigate the following optimization problem in a real Hilbert space: \[ \mu/2\langle Bx,x\rangle+ 1/2\| x\|^2- h(x)\to \min,\quad\text{subject to }x\in\text{Fix}(S)\cap\Omega, \] where \(B\) is a bounded linear operator, \(\mu\geq 0\), \(h\) is a potential function, \(\text{Fix}(S)\) is the set of fixed points of the nonexpansive mapping \(S\), and \(\Omega\) is a solution set of an equilibrium problem. An explicit and an implicit iterative algorithm for solving this problem are proposed.
Recommendations
- scientific article; zbMATH DE number 5871159
- Some algorithms for solving optimization problems in Hilbert spaces
- A general approximation method for a kind of convex optimization problems in Hilbert spaces
- Algorithms for equilibrium problems and fixed point problems approach to minimization problems
- An iterative algorithm of solution for quadratic minimization problem in Hilbert spaces
Cites work
- A general iterative method for equilibrium problems and fixed point problems in Hilbert spaces
- A hybrid iterative scheme for mixed equilibrium problems and fixed point problems
- A new hybrid-extragradient method for generalized mixed equilibrium problems, fixed point problems and variational inequality problems
- A new iterative method for equilibrium problems and fixed point problems of infinitely nonexpansive mappings and monotone mappings
- A new method for solving equilibrium problem fixed point problem and variational inequality problem with application to optimization
- An iterative algorithm for approximating convex minimization problem
- An iterative algorithm for solving fixed point problems, variational inequality problems and mixed equilibrium problems
- An iterative approach to quadratic optimization
- An iterative method for finding common solutions of equilibrium and fixed point problems
- Convergence of hybrid steepest-descent methods for variational inequalities
- Convergence theorems of common elements for equilibrium problems and fixed point problems in Banach spaces
- Generalized vector quasi-equilibrium problems with applications to common fixed point theorems and optimization problems
- scientific article; zbMATH DE number 1090020 (Why is no real title available?)
- scientific article; zbMATH DE number 2182576 (Why is no real title available?)
- scientific article; zbMATH DE number 1424529 (Why is no real title available?)
- Hybrid methods for a class of monotone variational inequalities
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- Implicit iteration scheme with perturbed mapping for equilibrium problems and fixed point problems of finitely many nonexpansive mappings
- On generalized implicit vector equilibrium problems in Banach spaces
- On iterative methods for equilibrium problems
- On modified iterative method for nonexpansive mappings and monotone mappings
- On nonconvex equilibrium problems
- Predictor-corrector algorithms for solving generalized mixed implicit quasi-equilibrium problems
- Quadratic minimization for equilibrium problem variational inclusion and fixed point problem
- Strong convergence of composite iterative methods for equilibrium problems and fixed point problems
- Strong convergence of three-step relaxed hybrid steepest-descent methods for variational inequalities
- Strong convergence theorem for a generalized equilibrium problem and a nonexpansive mapping in a Hilbert space
- Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces
- The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
- Viscosity approximation methods for generalized equilibrium problems and fixed point problems with applications
- Viscosity approximation to common fixed points of families of nonexpansive mappings with generalized contractions mappings
- Viscosity method for hierarchical fixed point approach to variational inequalities
- Weak convergence theorem by an extragradient method for nonexpansive mappings and monotone mappings
- Weak convergence theorems for nonexpansive mappings and equilibrium problems
- Weak convergence theorems for nonexpansive mappings and monotone mappings
- Well-posedness for equilibrium problems and for optimization problems with equilibrium constraints
Cited in
(11)- The hill detouring method for minimizing hinging hyperplanes functions
- A new general system of generalized nonlinear mixed composite-type equilibria and fixed point problems with an application to minimization problems
- A general approximation method for a kind of convex optimization problems in Hilbert spaces
- Iiduka type algorithms for minimization problems in finite dimensional Hilbert spaces with applications in the image deblurring problem
- General iterative methods for monotone mappings and pseudocontractive mappings related to optimization problems
- scientific article; zbMATH DE number 5871159 (Why is no real title available?)
- scientific article; zbMATH DE number 3925451 (Why is no real title available?)
- scientific article; zbMATH DE number 3950227 (Why is no real title available?)
- Some algorithms for solving optimization problems in Hilbert spaces
- General iterative methods for semigroups of nonexpansive mappings related to optimization problems
- Strong convergence theorems based on a new modified extragradient method for variational inequality problems and fixed point problems in Banach spaces
This page was built for publication: Algorithms for approximating minimization problems in Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534233)
