It looks like you're offline.
Open Library logo
additional options menu

MARC Record from harvard_bibliographic_metadata

Record ID harvard_bibliographic_metadata/ab.bib.13.20150123.full.mrc:961001720:3057
Source harvard_bibliographic_metadata
Download Link /show-records/harvard_bibliographic_metadata/ab.bib.13.20150123.full.mrc:961001720:3057?format=raw

LEADER: 03057nam a22005535a 4500
001 013843112-4
005 20131206203409.0
008 121227s2000 ne | s ||0| 0|eng d
020 $a9789401140669
020 $a9789401140669
020 $a9789401057882
024 7 $a10.1007/978-94-011-4066-9$2doi
035 $a(Springer)9789401140669
040 $aSpringer
050 4 $aQA315-316
050 4 $aQA402.3
050 4 $aQA402.5-QA402.6
072 7 $aPBKQ$2bicssc
072 7 $aPBU$2bicssc
072 7 $aMAT005000$2bisacsh
072 7 $aMAT029020$2bisacsh
082 04 $a515.64$223
100 1 $aButnariu, Dan,$eauthor.
245 10 $aTotally Convex Functions for Fixed Points Computation and Infinite Dimensional Optimization /$cby Dan Butnariu, Alfredo N. Iusem.
264 1 $aDordrecht :$bSpringer Netherlands :$bImprint: Springer,$c2000.
300 $aXVI, 205 p.$bonline resource.
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
347 $atext file$bPDF$2rda
490 1 $aApplied Optimization,$x1384-6485 ;$v40
520 $aThe 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.
650 20 $aIntegral equations.
650 20 $aOperator theory.
650 20 $aFunctional analysis.
650 10 $aMathematics.
650 0 $aMathematics.
650 0 $aFunctional analysis.
650 0 $aIntegral equations.
650 0 $aOperator theory.
650 0 $aDiscrete groups.
650 0 $aMathematical optimization.
650 24 $aCalculus of Variations and Optimal Control; Optimization.
650 24 $aConvex and Discrete Geometry.
700 1 $aIusem, Alfredo N.,$eauthor.
776 08 $iPrinted edition:$z9789401057882
830 0 $aApplied Optimization ;$v40.
988 $a20131119
906 $0VEN