An iterative algorithm for approximating convex minimization problem

DOI10.1016/J.AMC.2006.10.039MaRDI QIDQ2371476zbMATH OpenOpenAlexFDO

Authors Yonghong Yao, Yeong-Cheng Liou, Jen-Chih Yao

Publication date 4 July 2007

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2006.10.039

zbMATH Keywords

iterative algorithmconvergencenonexpansive mappingconvex minimization problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Recommendations

• Iterative Approaches to Convex Minimization Problems
• Iterative approximation of solutions for constrained convex minimization problem
• An iterative algorithm for fixed point problem and convex minimization problem with applications
• A general iterative method for solving constrained convex minimization problems
• Iterative schemes for convex minimization problems with constraints
• Iterative algorithm for a convex feasibility problem
• scientific article; zbMATH DE number 3249571
• Iterative algorithm for solving a class of convex feasibility problem
• Iteration methods to compute the separable convex minimization problems
• scientific article; zbMATH DE number 854129

Cites work

• scientific article; zbMATH DE number 3933858 (Why is no real title available?)
• A general iterative method for nonexpansive mappings in Hilbert spaces
• An iterative approach to quadratic optimization
• Approximating fixed points of infinite nonexpansive mappings by the hybrid method
• Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
• On Projection Algorithms for Solving Convex Feasibility Problems
• On the convergence of Han's method for convex programming with quadratic objective
• Quadratic optimization of fixed points of nonexpansive mappings in hubert space
• Some problems and results in the study of nonlinear analysis
• Strong convergence of Krasnoselskii and Mann's type sequences for one-parameter nonexpansive semigroups without Bochner integrals
• Strong convergence theorems on an iterative method for a family of finite nonexpansive mappings in reflexive Banach spaces
• The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
• The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings

Cited in

(23)

• Some new algorithms for solving mixed equilibrium problems
• scientific article; zbMATH DE number 220318 (Why is no real title available?)
• Iterative Approaches to Convex Minimization Problems
• A general composite algorithm for solving general equilibrium problems and fixed point problems in Hilbert spaces
• An iterative algorithm of solution for quadratic minimization problem in Hilbert spaces
• New methods with perturbations for non-expansive mappings in Hilbert spaces
• Iterative methods for the sum of two monotone operators
• Asymptotically non-expansive self-maps and global stability with ultimate boundedness of dynamic systems
• New iterative manner involving sunny nonexpansive retractions for pseudocontractive mappings
• Minimization of equilibrium problems, variational inequality problems and fixed point problems
• A general iterative algorithm for an infinite family of nonexpansive operators in Hilbert spaces
• Strong convergence theorem for nonexpansive mappings on star-shaped sets in Hilbert spaces
• New iterative methods for a common solution of fixed points for pseudo-contractive mappings and variational inequalities
• Algorithms for approximating minimization problems in Hilbert spaces
• Composite algorithms for minimization over the solutions of equilibrium problems and fixed point problems
• A scheme of iterative minimization methods
• Iterative algorithm for solving a class of convex feasibility problem
• Iterative computation for solving convex optimization problems over the set of common fixed points of quasi-nonexpansive and demicontractive mappings
• Algorithmic approach to a minimization problem
• Iterative algorithms with some control conditions for quadratic optimizations
• Iterative methods for nonexpansive mappings in Banach spaces
• An iterative algorithm for mixed equilibrium problems and variational inclusions approach to variational inequalities
• An extragradient method for mixed equilibrium problems and fixed point problems

This page was built for publication: An iterative algorithm for approximating convex minimization problem

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