<--- Back to Details
First PageDocument Content
Fixed-point theorems / MarkovKakutani fixed-point theorem / HahnBanach theorem / Kakutani fixed-point theorem / Locally convex topological vector space / Convex set / Schauder fixed point theorem / Fixed-point theorems in infinite-dimensional spaces
Date: 2012-11-07 06:37:38
Fixed-point theorems
MarkovKakutani fixed-point theorem
HahnBanach theorem
Kakutani fixed-point theorem
Locally convex topological vector space
Convex set
Schauder fixed point theorem
Fixed-point theorems in infinite-dimensional spaces

A proof of the Markov-Kakutani fixed point theorem via the Hahn-Banach theorem Dirk Werner S. Kakutani, in [2] and [3], provides a proof of the Hahn-Banach theorem

Add to Reading List

Source URL: page.mi.fu-berlin.de

Download Document from Source Website

File Size: 149,57 KB

Share Document on Facebook

Similar Documents

MathQuest: Linear Algebra  Affine and Convex Combinations 1. How do you describe the set of all affine combinations of the vectors (1, 0) and (0, 1)? (a) A point (b) A line segment

MathQuest: Linear Algebra Affine and Convex Combinations 1. How do you describe the set of all affine combinations of the vectors (1, 0) and (0, 1)? (a) A point (b) A line segment

DocID: 1v0rO - View Document

A disjunctive convex programming approach to the pollution routing problem Ricardo Fukasawa∗, Qie He†, Yongjia Song‡ Abstract The pollution routing problem (PRP) aims to determine a set of routes and speed over eac

A disjunctive convex programming approach to the pollution routing problem Ricardo Fukasawa∗, Qie He†, Yongjia Song‡ Abstract The pollution routing problem (PRP) aims to determine a set of routes and speed over eac

DocID: 1sYbq - View Document

III.2 Convex Set Systems  III.2 53

III.2 Convex Set Systems III.2 53

DocID: 1sWmE - View Document

Many data analysis applications require the solution of optimization problems involving a sum of large number of functions. We consider the problem of minimizing a sum of n functions over a convex constraint set. Algorit

Many data analysis applications require the solution of optimization problems involving a sum of large number of functions. We consider the problem of minimizing a sum of n functions over a convex constraint set. Algorit

DocID: 1sry5 - View Document

Many data analysis applications require the solution of optimization problems involving a sum of large number of functions. We consider the problem of minimizing a sum of n functions over a convex constraint set. Algorit

Many data analysis applications require the solution of optimization problems involving a sum of large number of functions. We consider the problem of minimizing a sum of n functions over a convex constraint set. Algorit

DocID: 1rkf9 - View Document