Quadratic optimization of fixed points of nonexpansive mappings in hubert space
From MaRDI portal
Publication:4386129
DOI10.1080/01630569808816822zbMATH Open0911.47051OpenAlexW2014913012MaRDI QIDQ4386129FDOQ4386129
Authors: Isao Yamada, Nobuhiko Ogura, Yukihiko Yamashita, Kohichi Sakaniwa 
Publication date: 4 May 1999
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630569808816822
Recommendations
- An iterative approach to quadratic optimization
- Quadratic optimization of fixed points for a family of nonexpansive mappings in Hilbert space
- Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
- Iterative algorithms with some control conditions for quadratic optimizations
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Convex programming (90C25) Nonlinear programming (90C30) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point theorems (47H10)
Cites Work
- The rate of convergence for the method of alternating projections. II
- On Projection Algorithms for Solving Convex Feasibility Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- FIXED-POINT THEOREMS FOR NONCOMPACT MAPPINGS IN HILBERT SPACE
- Fixed points of nonexpanding maps
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Approximation of fixed points of nonexpansive mappings
- Title not available (Why is that?)
- An Algorithm for Restricted Least Squares Regression
- On the convergence of Han's method for convex programming with quadratic objective
- A successive projection method
- Decomposition through formalization in a product space
- Finding projections onto the intersection of convex sets in hilbert spaces
- Dykstra's alternating projection algorithm for two sets
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- Proximity Maps for Convex Sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two generalizations of Dykstra's cyclic projections algorithm
- Title not available (Why is that?)
Cited In (44)
- Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings
- Iterative Approaches to Convex Minimization Problems
- Convergence theorems of a general composite iterative method for nonexpansive semigroups in Banach spaces
- On variational inclusion and common fixed point problems in Hilbert spaces with applications
- A new general iterative method for solution of a new general system of variational inclusions for nonexpansive semigroups in Banach spaces
- Iterative algorithms for variational inequality and equilibrium problems with applications
- An iterative algorithm for approximating convex minimization problem
- On the convergence for an iterative method for quasivariational inclusions
- Regularization by denoising via fixed-point projection (RED-PRO)
- An iterative scheme with a countable family of nonexpansive mappings for variational inequality problems in Hilbert spaces
- Proximal splitting methods in signal processing
- General iterative methods for monotone mappings and pseudocontractive mappings related to optimization problems
- An iterative approach to quadratic optimization
- Convex minimization over the fixed point set of demicontractive mappings
- Approximation of common fixed points of nonexpansive semigroups in Hilbert spaces
- NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING
- Composite implicit general iterative process for a nonexpansive semigroup in Hilbert space
- On two questions of optimization theory concerning quadratic mappings
- Iterative approaches to finding nearest common fixed points of nonexpansive mappings in Hilbert spaces.
- An iterative algorithm for common fixed points for nonexpansive semigroups and strictly pseudo-contractive mappings with optimization problems
- Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization
- A general iterative method of fixed points for equilibrium problems and optimization problems
- General iterative methods for a one-parameter nonexpansive semigroup in Hilbert space
- Iterative algorithms for finding common solutions of variational inequalities and systems of equilibrium problems and fixed points of families and semigroups of nonexpansive mappings
- General iterative algorithms for hierarchical fixed points approach to variational inequalities
- Weak and strong convergence of a new scheme for two non-expansive mappings in Hilbert spaces
- A general iterative method for nonexpansive mappings in Hilbert spaces
- Iterative algorithms with some control conditions for quadratic optimizations
- Iterative approaches to convex feasibility problems in Banach spaces
- Iterative approaches to common fixed points of nonexpansive mappings in Banach spaces
- Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
- Quadratic optimization of fixed points for a family of nonexpansive mappings in Hilbert space
- New iterative scheme with nonexpansive mappings for equilibrium problems and variational inequality problems in Hilbert spaces
- The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings
- Nonstrictly Convex Minimization over the Bounded Fixed Point Set of a Nonexpansive Mapping
- Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
- A general inexact iterative method for monotone operators, equilibrium problems and fixed point problems of semigroups in Hilbert spaces
- Strong convergence of composite general iterative methods for one-parameter nonexpansive semigroup and equilibrium problems
- Hybrid viscosity-like approximation methods for nonexpansive mappings in Hilbert spaces
- A general iterative method for addressing mixed equilibrium problems and optimization problems
- A new hybrid iterative method for mixed equilibrium problems and variational inequality problem for relaxed cocoercive mappings with application to optimization problems
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- Strong convergence of the modified Mann iterative method for strict pseudo-contractions
- A system of mixed equilibrium problems, a general system of variational inequality problems for relaxed cocoercive, and fixed point problems for nonexpansive semigroup and strictly pseudocontractive mappings
This page was built for publication: Quadratic optimization of fixed points of nonexpansive mappings in hubert space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4386129)
