A general iterative scheme based on regularization for solving equilibrium and constrained convex minimization problems

DOI10.1155/2013/583710MaRDI QIDQ2015774zbMATH OpenOpenAlexWikidataFDO

Authors Ming Tian

Publication date 23 June 2014

Published in Abstract and Applied Analysis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2013/583710

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Iterative procedures involving nonlinear operators (47J25)

Recommendations

• General iterative scheme based on the regularization for solving a constrained convex minimization problem
• A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems
• An iterative method for equilibrium and constrained convex minimization problems
• Regularized gradient-projection methods for equilibrium and constrained convex minimization problems
• Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem

Cites work

• scientific article; zbMATH DE number 3853749 (Why is no real title available?)
• scientific article; zbMATH DE number 3671159 (Why is no real title available?)
• scientific article; zbMATH DE number 47597 (Why is no real title available?)
• scientific article; zbMATH DE number 6921240 (Why is no real title available?)
• scientific article; zbMATH DE number 2182576 (Why is no real title available?)
• scientific article; zbMATH DE number 3293978 (Why is no real title available?)
• A general iterative algorithm for nonexpansive mappings in Hilbert spaces
• 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 multiprojection algorithm using Bregman projections in a product space
• A regularization method for the proximal point algorithm
• A unified implicit algorithm for solving the triple-hierarchical constrained optimization problem
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• A viscosity hybrid steepest-descent method for a system of equilibrium and fixed point problems for an infinite family of strictly pseudo-contractive mappings
• Algorithms construction for nonexpansive mappings and inverse-strongly monotone mappings
• An application of hybrid steepest descent methods for equilibrium problems and strict pseudocontractions in Hilbert spaces
• An explicit method for systems of equilibrium problems and fixed points of infinite family of nonexpansive mappings
• An iterative scheme for equilibrium problems and fixed point problems of strict pseudo-contraction mappings
• Averaged mappings and the gradient-projection algorithm
• CONVERGENCE ANALYSIS ON HYBRID PROJECTION ALGORITHMS FOR EQUILIBRIUM PROBLEMS AND VARIATIONAL INEQUALITY PROBLEMS
• Convergence of generalized proximal point algorithms
• Generalized systems of variational inequalities and projection methods for inverse-strongly monotone mappings
• Iterative algorithms based on the viscosity approximation method for equilibrium and constrained convex minimization problem
• Iterative methods for mixed equilibrium problems and strictly pseudocontractive mappings
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Perturbation techniques for nonexpansive mappings with applications
• Projected gradient methods for linearly constrained problems
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• Some iterative methods for finding fixed points and for solving constrained convex minimization problems
• The multiple-sets split feasibility problem and its applications for inverse problems
• Three strong convergence theorems regarding iterative methods for solving equilibrium problems in reflexive Banach spaces
• Two-step projection methods for a system of variational inequality problems in Banach spaces
• 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

(5)

• Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem
• General iterative scheme based on the regularization for solving a constrained convex minimization problem
• Iterative schemes for convex minimization problems with constraints
• scientific article; zbMATH DE number 4142758 (Why is no real title available?)
• Some applications of the iterative regularization principle to mathematical programming problems

This page was built for publication: A general iterative scheme based on regularization for solving equilibrium and constrained convex minimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015774)