Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings

  title={Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings},
  author={Frank Deutsch and Isao Yamada},
  journal={Numerical Functional Analysis and Optimization},
Let T i (i = 1,2,...,N) be nonexpansive mappings on a Hilbert space H, and let ⊖: H → R∪{∞} be a function which has a uniformly strongly positive and uniformly bounded second (Frechet) derivative over the convex hull of T i (H) for some i. We first prove that ⊖ has a unique minimum over the intersection of the fixed point sets of all the T i 's at some point u*. Then a cyclic hybrid steepest descent algorithm is proposed and we prove that it converges to u*. This generalizes some recent results… 
Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators
Many convex optimization problems in a Hilbert space ℋ can be written as the following variational inequality problem VIP (ℱ, C): Find such that for all z ∈ C, where C ⊂ ℋ is closed convex and ℱ: ℋ →
ABSTRACT Suppose that T is a nonexpansive mapping on a real Hilbert space satisfying for some R > 0. Suppose also that a mapping is κ-Lipschitzian over and paramonotone over . Then it is shown that a
Nonstrictly Convex Minimization over the Bounded Fixed Point Set of a Nonexpansive Mapping
Abstract In this paper, we consider, in a finite dimensional real Hilbert space , the variational inequality problem VIP : find , where is nonexpansive mapping with bounded and is paramonotone and
Iterative Approaches to Convex Minimization Problems
Abstract The aim of this paper is to generalize the results of Yamada et al. [Yamada, I., Ogura, N., Yamashita, Y., Sakaniwa, K. (1998). Quadratic approximation of fixed points of nonexpansive
A general iterative method for two maximal monotone operators and 2-generalized hybrid mappings in Hilbert spaces
Let C be a closed and convex subset of a real Hilbert space H. Let T be a 2-generalized hybrid mapping of C into itself, let A be an α-inverse strongly-monotone mapping of C into H, and let B and F
Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings
A nontrivial integration of the ideas of the hybrid steepest descent method and the Moreau–Yosida regularization is proposed, yielding a useful approach to the challenging problem of nonsmooth convex optimization over Fix(T).
Outer approximation methods for solving variational inequalities in Hilbert space
Abstract In this paper, we study variational inequalities in a real Hilbert space, which are governed by a strongly monotone and Lipschitz continuous operator F over a closed and convex set C. We


Proximity maps for convex sets
The method of successive approximation is applied to the problem of obtaining points of minimum distance on two convex sets. Specifically, given a closed convex set K in Hilbert space, let P be the
Topics in Metric Fixed Point Theory
Introduction 1. Preliminaries 2. Banach's contraction principle 3. Nonexpansive mappings: introduction 4. The basic fixed point theorems for nonexpansive mappings 5. Scaling the convexity of the unit
On the convergence of Han's method for convex programming with quadratic objective
An iterative method for minimizing strictly convex quadratic functions over the intersection of a finite number of convex sets is presented and convergence proofs are given even for the inconsistent case, i.e. when the intersections of the sets is empty.
  • F. Browder
  • Mathematics
    Proceedings of the National Academy of Sciences of the United States of America
  • 1965
* Supported by the Lockheed IJdependent Research Program. 1 Geiringer, H., Ann. Mlath. Statist., 15, 25 (1944). 2 Ibid., 16, 390 (1945). Geiringer, H., J. Math. Phys., 26, 246 (1947). 4Geiringer, H.,
Adaptive linear filtering with convex constraints
  • P. L. Combettes, P. Bondon
  • Computer Science, Mathematics
    1995 International Conference on Acoustics, Speech, and Signal Processing
  • 1995
This work addresses the problem of linear mean-square estimation with arbitrary convex constraints for dependent processes and proposes two algorithms, which are deterministic and stochastic and adaptive, and their convergence is established.
Constrained image recovery in a product space
  • P. L. Combettes
  • Computer Science, Mathematics
    Proceedings., International Conference on Image Processing
  • 1995
This paper presents a product space framework for solving image recovery problems, which leads to simplified formulations and to efficient parallel algorithms.
Construction d'un point fixe commun à une famille de contractions fermes
Nous proposons une methode generale pour construire un point fixe commun a une famille denombrable de contractions fermes sur un espace hilbertien reel et montrons sa convergence. Dans cette methode
The foundations of set theoretic estimation
A single formal framework is presented to synthesize various approaches to set theory estimation, and the fundamental philosophy, goals, and analytical techniques of set theoretic estimation are discussed.
The foundations of set theoretic estimation
  • [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing
  • 1991