Iterative Approaches to Convex Minimization Problems

DOI10.1081/NFA-200041707MaRDI QIDQ4678765zbMATH OpenOpenAlexFDO

Authors Paranjothi Pillay, Hong-Kun Xu, John O'Hara

Publication date 23 May 2005

Published in Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1081/nfa-200041707

zbMATH Keywords

convex minimizationnonexpansive mappingconvex feasibility problemiterative approach

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical solutions to equations with nonlinear operators (65J15)

Recommendations

• An iterative algorithm of solution for quadratic minimization problem in Hilbert spaces
• An iterative algorithm for approximating convex minimization problem
• Convergence of a general iterative method for nonexpansive mappings in Hilbert spaces
• Iterative computation for solving convex optimization problems over the set of common fixed points of quasi-nonexpansive and demicontractive mappings
• Iterative algorithms for minimum-norm fixed point of non-expansive mapping in Hilbert space

Cites work

• scientific article; zbMATH DE number 3933858 (Why is no real title available?)
• An iterative approach to quadratic optimization
• Approximation of fixed points of nonexpansive mappings
• FIXED-POINT THEOREMS FOR NONCOMPACT MAPPINGS IN HILBERT SPACE
• Fixed points of nonexpanding maps
• Iterative approaches to finding nearest common fixed points of nonexpansive mappings in Hilbert spaces.
• Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
• Quadratic optimization of fixed points of nonexpansive mappings in hubert space
• The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space

Cited in

(15)

• scientific article; zbMATH DE number 220318 (Why is no real title available?)
• An iterative algorithm of solution for quadratic minimization problem in Hilbert spaces
• Some iterative methods for finding fixed points and for solving constrained convex minimization problems
• A general iterative scheme with applications to convex optimization and related fields
• An iterative algorithm for approximating convex minimization problem
• An iterative approach to quadratic optimization
• Convex minimization over the fixed point set of demicontractive mappings
• A scheme of iterative minimization methods
• scientific article; zbMATH DE number 2168917 (Why is no real title available?)
• Iterative minimization of quadratic functionals
• Iterative computation for solving convex optimization problems over the set of common fixed points of quasi-nonexpansive and demicontractive mappings
• Iterative algorithms with some control conditions for quadratic optimizations
• Quadratic optimization of fixed points for a family of nonexpansive mappings in Hilbert space
• Iterative algorithms of generalized nonexpansive mappings and monotone operators with application to convex minimization problem
• scientific article; zbMATH DE number 6378119 (Why is no real title available?)

This page was built for publication: Iterative Approaches to Convex Minimization Problems

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