Conversion of algorithms by releasing projection for minimization problems
From MaRDI portal
Publication:2249105
Recommendations
- From equilibrium problems and fixed points problems to minimization problems
- The constrained multiple-sets split feasibility problem and its projection algorithms
- scientific article; zbMATH DE number 5871159
- Variant gradient projection methods for the minimization problems
- Linear convergence of projection algorithms
Cites work
- scientific article; zbMATH DE number 47597 (Why is no real title available?)
- 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?)
- scientific article; zbMATH DE number 5228496 (Why is no real title available?)
- A hybrid projection algorithm for finding solutions of mixed equilibrium problem and variational inequality problem
- 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 nonexpansive mappings and monotone mappings
- A new iterative method for finding common solutions of a system of equilibrium problems, fixed-point problems, and variational inequalities
- A new method for solving equilibrium problem fixed point problem and variational inequality problem with application to optimization
- A viscosity hybrid steepest descent method for generalized mixed equilibrium problems and variational inequalities for relaxed cocoercive mapping in Hilbert spaces
- Algorithms of common solutions for variational inclusions, mixed equilibrium problems and fixed point problems
- An implicit method for finding common solutions of variational inequalities and systems of equilibrium problems and fixed points of infinite family of nonexpansive mappings
- An iterative approach to a constrained least squares problem
- An iterative approach to quadratic optimization
- An iterative method for finding common solutions of equilibrium and fixed point problems
- Composite algorithms for minimization over the solutions of equilibrium problems and fixed point problems
- Convergence theorem for equilibrium problems and fixed point problems of infinite family of nonexpansive mappings
- Convexly constrained linear inverse problems: Iterative least-squares and regularization
- Coupling viscosity methods with the extragradient algorithm for solving equilibrium problems
- Iterative Algorithms for Nonlinear Operators
- Nonexistence of positive solutions of PDE's with \(p\)-Laplacian
- On Projection Algorithms for Solving Convex Feasibility Problems
- Projected subgradient techniques and viscosity methods for optimization with variational inequality constraints
- Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
- Strong convergence of composite iterative methods for equilibrium problems and fixed point problems
- Strong convergence theorem for a generalized equilibrium problem and a nonexpansive mapping in a Hilbert space
- Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces
- 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 by perturbations of mixed variational inequalities in Banach spaces
This page was built for publication: Conversion of algorithms by releasing projection for minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249105)
