The main purpose of this book is to present, in a unified approach, several algorithms for fixed point computation, convex feasibility and convex optimization in infinite dimensional Banach spaces, and for problems involving, eventually, infinitely many constraints. For instance, methods like the simultaneous projection algorithm for feasibility, the proximal point algorithm and the augmented Lagrangian algorithm are rigorously formulated and analyzed in this general setting and shown to be applicable to much wider classes of problems than previously known. For this purpose, a new basic concept, `total convexity', is introduced. Its properties are deeply explored, and a comprehensive theory is presented, bringing together previously unrelated ideas from Banach space geometry, finite dimensional convex optimization and functional analysis. For making our general approach possible we had to improve upon classical results like the Hölder-Minkowsky inequality of Lp. All the material is either new or very recent, and has never been organized in a book.
Audience: This book will be of interest to both researchers in nonlinear analysis and to applied mathematicians dealing with numerical solution of integral equations, equilibrium problems, image reconstruction, optimal control, etc.
"synopsis" may belong to another edition of this title.
US$ 6.00 shipping within U.S.A.
Destination, rates & speedsSeller: Second Story Books, ABAA, Rockville, MD, U.S.A.
Hardcover. Octavo, 202 pages. In Very Good minus condition. White spine with yellow and purple text. Yellow text on spine is barely legible. Boards have mild shelfwear, rubbing to corners, and bumping to spine edges. Textblock clean. NOTE: Shelved in Netdesk Column R (ND-R). 1377333. FP New Rockville Stock. Seller Inventory # 1377333
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 756514-n
Quantity: Over 20 available
Seller: Best Price, Torrance, CA, U.S.A.
Condition: New. SUPER FAST SHIPPING. Seller Inventory # 9780792362876
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 756514
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9780792362876_new
Quantity: Over 20 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 756514-n
Quantity: Over 20 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The main purpose of this book is to present, in a unified approach, several algorithms for fixed point computation, convex feasibility and convex optimization in infinite dimensional Banach spaces, and for problems involving, eventually, infinitely many constraints. For instance, methods like the simultaneous projection algorithm for feasibility, the proximal point algorithm and the augmented Lagrangian algorithm are rigorously formulated and analyzed in this general setting and shown to be applicable to much wider classes of problems than previously known. For this purpose, a new basic concept, `total convexity', is introduced. Its properties are deeply explored, and a comprehensive theory is presented, bringing together previously unrelated ideas from Banach space geometry, finite dimensional convex optimization and functional analysis. For making our general approach possible we had to improve upon classical results like the Hölder-Minkowsky inequality of Lp. All the material is either new or very recent, and has never been organized in a book. Audience: This book will be of interest to both researchers in nonlinear analysis and to applied mathematicians dealing with numerical solution of integral equations, equilibrium problems, image reconstruction, optimal control, etc. 224 pp. Englisch. Seller Inventory # 9780792362876
Quantity: 2 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition. Seller Inventory # 756514
Quantity: Over 20 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 526. Seller Inventory # C9780792362876
Quantity: Over 20 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - The main purpose of this book is to present, in a unified approach, several algorithms for fixed point computation, convex feasibility and convex optimization in infinite dimensional Banach spaces, and for problems involving, eventually, infinitely many constraints. For instance, methods like the simultaneous projection algorithm for feasibility, the proximal point algorithm and the augmented Lagrangian algorithm are rigorously formulated and analyzed in this general setting and shown to be applicable to much wider classes of problems than previously known. For this purpose, a new basic concept, `total convexity', is introduced. Its properties are deeply explored, and a comprehensive theory is presented, bringing together previously unrelated ideas from Banach space geometry, finite dimensional convex optimization and functional analysis. For making our general approach possible we had to improve upon classical results like the Hölder-Minkowsky inequality of Lp. All the material is either new or very recent, and has never been organized in a book. Audience: This book will be of interest to both researchers in nonlinear analysis and to applied mathematicians dealing with numerical solution of integral equations, equilibrium problems, image reconstruction, optimal control, etc. Seller Inventory # 9780792362876
Quantity: 2 available