Algorithmic approach to a minimization problem
From MaRDI portal
Publication:448663
DOI10.1155/2012/310801zbMATH Open1248.49045OpenAlexW2146307044WikidataQ58696307 ScholiaQ58696307MaRDI QIDQ448663FDOQ448663
Authors: Yonghong Yao, Yeong-Cheng Liou, Zhitao Wu, Shin Min Kang 
Publication date: 7 September 2012
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/310801
Recommendations
- scientific article
- Minimization of equilibrium problems, variational inequality problems and fixed point problems
- From equilibrium problems and fixed points problems to minimization problems
- Algorithms for equilibrium problems and fixed point problems approach to minimization problems
- Composite algorithms for minimization over the solutions of equilibrium problems and fixed point problems
minimization problemvariational inequalitydiscretizing an implicit algorithmfixed-point set of a nonexpansive mapping
Cites Work
- On Projection Algorithms for Solving Convex Feasibility Problems
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- An iterative approach to quadratic optimization
- A new method for solving equilibrium problem fixed point problem and variational inequality problem with application to optimization
- An iterative method for finding common solutions of equilibrium and fixed point problems
- Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces
- Title not available (Why is that?)
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- Title not available (Why is that?)
- A general iterative method for equilibrium problems and fixed point problems in Hilbert spaces
- On modified iterative method for nonexpansive mappings and monotone mappings
- An implicit method for finding common solutions of variational inequalities and systems of equilibrium problems and fixed points of infinite family of nonexpansive mappings
- Strong convergence theorem for a generalized equilibrium problem and a nonexpansive mapping in a Hilbert space
- Strong convergence theorems for solving equilibrium problems and fixed point problems of \(\xi \)-strict pseudo-contraction mappings by two hybrid projection methods
- Strong convergence of composite iterative methods for equilibrium problems and fixed point problems
- Iterative Algorithms for Equilibrium Problems
- Well-posedness for equilibrium problems and for optimization problems with equilibrium constraints
- Viscosity approximation methods for generalized equilibrium problems and fixed point problems with applications
- Title not available (Why is that?)
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Strong convergence theorems of iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems
- Convergence theorems for equilibrium problem, variational inequality problem and countably infinite relatively quasi-nonexpansive mappings
- Cyclic subgradient projections
- On the convergence of splitting proximal methods for equilibrium problems in Hilbert spaces
- An iterative algorithm for approximating convex minimization problem
- Implicit iteration scheme with perturbed mapping for equilibrium problems and fixed point problems of finitely many nonexpansive mappings
- Generalized vector quasi-equilibrium problems with applications to common fixed point theorems and optimization problems
- Viscosity approximation schemes for fixed point problems and equilibrium problems and variational inequality problems
- Fixed point solutions of generalized equilibrium problems for nonexpansive mappings
- Predictor-corrector algorithms for solving generalized mixed implicit quasi-equilibrium problems
- Inherently parallel algorithms in feasibility and optimization and their applications. Research workshop, Haifa, Israel, March 13--16, 2000
- A dynamical approach to convex minimization coupling approximation with the steepest descent method
- Projection-proximal methods for general variational inequalities
- Modified descent-projection method for solving variational inequalities
Cited In (3)
This page was built for publication: Algorithmic approach to a minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q448663)
