Kooperativer Bibliotheksverbund

UID:

Format: VII, 129 S. : , graph. Darst.

ISBN: 3-540-07685-9 , 0-387-07685-9

Series Statement: Lecture notes in economics and mathematical systems 124 : Mathematical economics

Language: English

Subjects: Economics , Mathematics

Keywords: Fixpunkt-Methode

URL: http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=001284002&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA

URL: http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=001284002&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA

URL: Inhaltsverzeichnis

Author information: Todd, Michael J., 1947-

UID:

Format: VII, 129 S. , graph. Darst.

ISBN: 3540076859 , 0387076859

Series Statement: Lecture notes in economics and mathematical systems 124 : Mathematical economics

Language: English

Subjects: Economics , Mathematics

Keywords: Fixpunkt-Methode

URL: Inhaltsverzeichnis

Author information: Todd, Michael J. 1947-

UID:

Format: 1 online resource (x, 276 pages) : , digital, PDF file(s).

ISBN: 9781139107068 (ebook)

Series Statement: London Mathematical Society lecture note series ; 363

Content: This volume is a collection of articles based on the plenary talks presented at the 2008 meeting in Hong Kong of the Society for the Foundations of Computational Mathematics. The talks were given by some of the foremost world authorities in computational mathematics. The topics covered reflect the breadth of research within the area as well as the richness and fertility of interactions between seemingly unrelated branches of pure and applied mathematics. As a result this volume will be of interest to researchers in the field of computational mathematics and also to non-experts who wish to gain some insight into the state of the art in this active and significant field.

Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015). , Smoothed analysis of condition numbers / Peter Bürgisser -- A world of binomials / Alicia Dickinstein -- Linear and nonlinear subdivision schemes in geometric modeling / Nira Dyn -- Energy preserving and energy stable schemes for the shallow water equations / Ulrik Fjordholm, Siddhartha Mishra, and Eitan Tadmor -- Pathwise convergence of numerical schemes for random and stochastic differential equations / A. Jentzen, P.E. Kloeden, and A. Neuenkirch -- Some properties of the global behaviour of conservative low-dimensional systems / Carles Simò -- A panoramic view of asymptotics / R. Wong -- Tractability of multivariate problems / H. Woźniakowski.

Additional Edition: Print version: ISBN 9780521739702

Language: English

Subjects: Mathematics

Keywords: Konferenzschrift

URL: https://doi.org/10.1017/CBO9781139107068

URL: Volltext

URL: Inhaltsverzeichnis

URL: Inhaltstext

UID:

Format: 111 S. : graph. Darst.

Series Statement: (Teorija i metody sistemnogo analiza)

Uniform Title: The computation of fixed points and applications 〈russ.〉

Note: In kyrill. Schr , Literaturverz. S. 105-111

Language: Undetermined

Author information: Todd, Michael J. 1947-

UID:

Format: 341 S.

ISBN: 0-8218-5121-7

Series Statement: Contemporary mathematics 114

UID:

Format: 1 online resource (xiv, 341 p.)

Edition: Electronic reproduction. Providence, Rhode Island : American Mathematical Society. 2012

ISBN: 9780821877029 (online)

Series Statement: Contemporary mathematics, v. 114

Note: "The AMS-IMS-SIAM Joint Summer Research Conference on Mathematical Developments Arising from Linear Programming was held at Bowdoin College, Brunswick, Maine, on June 25-July 1, 1988"--T.p. verso. , Some recent results on convex polytopes / , Probabilistic analysis of the simplex method / , On solving the linear programming problem approximately / , Riemannian geometry underlying interior-point methods for linear programming / , Steepest descent, linear programming, and Hamiltonian flows / , An $O(n^3L)$ potential reduction algorithm for linear programming / , I. I. Dikin's convergence result for the affine-scaling algorithm / , Phase $1$ search directions for a primal-dual interior point method for linear programming / , Some results concerning convergence of the affine scaling algorithm / , Dual ellipsoids and degeneracy in the projective algorithm for linear programming / , A note on limiting behavior of the projective and the affine rescaling algorithms / , On the convergence behavior of trajectories for linear programming / , Limiting behavior of the affine scaling continuous trajectories for linear programming problems / , Convergence and boundary behavior of the projective scaling trajectories for linear programming / , On the complexity of a numerical algorithm for solving generalized convex quadratic programs by following a central path / , Canonical problems for quadratic programming and projective methods for their solution / , An interior point algorithm for solving smooth convex programs based on Newton's method / , A modified Kantorovich inequality for the convergence of Newton's method / , An interior-point approach to NP-complete problems. I / , Solving matching problems using Karmarkar's algorithm / , Efficient faces of polytopes: interior point algorithms, parameterization of algebraic varieties, and multiple objective optimization / , Mode of access : World Wide Web

Additional Edition: Print version: Mathematical developments arising from linear programming : ISSN 0271-4132 ISBN 9780821851210

Language: English

Keywords: Electronic books.

URL: Contents

URL: Contents

URL: Click to View

UID:

Format: 1 Online-Ressource (VIII, 318 p)

ISBN: 9781461335726 , 9781461335740

Series Statement: NATO Conference Series, Systems Science 13

Note: This Proceedings presents refereed versions of most of the papers presented at the NATO Advanced Research Institute on Homotopy Methods and Global Convergence held in Porto Cervo, Sardinia, June 3-6, 1981. This represents the fourth recent occurrence of an international conference addressing the common theme of fixed point computation. The first such conference, ti tled "Computing Fixed Points with Applications," was held in the Department of Mathematical Sciences at Clemson University, Clemson, South Carolina, June 26-28, 1974 and was sponsored by the Office of Naval Research and the Office of the Army Research Center. The second conference, "Symposium on Analysis and Computation of Fixed Points," was held at the University of Wisconsin, Madison, May 7-8, 1979, under the sponsorship of the National Science Foundation, the U. S. Army, and the Mathematics Research Center of the University of Wisconsin, Madison. The third conference, titled "Symposium on Fixed Point Algorithms and Complementarity," was held at the University of Southampton, Southampton, UK, July 3-5, 1979 and was sponsored by U. N. E. S. C. O. , European Research Office (London), Department of Mathematics (University of Southampton), I. B. M. U. K. , Ltd. , Lloyds Bank, Ltd. , and the Office of Naval Research (London). The Advanced Research Institute held in Sardinia was devoted to the theory and application of modern homotopy methods. The following topics were stressed: Path-Following Techniques; Bottom-Line Applications; Global vs. Classical Methods; and Sta- v vi PREFACE of-the-Art, Perspectives and Potential

Language: English

DOI: 10.1007/978-1-4613-3572-6

URL: Volltext

UID:

Format: VII, 132 p. , online resource.

ISBN: 9783642503276

Series Statement: Lecture Notes in Economics and Mathematical Systems, Mathematical Economics, 124

Content: Fixed-point algorithms have diverse applications in economics, optimization, game theory and the numerical solution of boundary-value problems. Since Scarf's pioneering work [56,57] on obtaining approximate fixed points of continuous mappings, a great deal of research has been done in extending the applicability and improving the efficiency of fixed-point methods. Much of this work is available only in research papers, although Scarf's book [58] gives a remarkably clear exposition of the power of fixed-point methods. However, the algorithms described by Scarf have been super~eded by the more sophisticated restart and homotopy techniques of Merrill [~8,~9] and Eaves and Saigal [1~,16]. To understand the more efficient algorithms one must become familiar with the notions of triangulation and simplicial approxi- tion, whereas Scarf stresses the concept of primitive set. These notes are intended to introduce to a wider audience the most recent fixed-point methods and their applications. Our approach is therefore via triangu- tions. For this reason, Scarf is cited less in this manuscript than his contri- tions would otherwise warrant. We have also confined our treatment of applications to the computation of economic equilibria and the solution of optimization problems. Hansen and Koopmans [28] apply fixed-point methods to the computation of an invariant optimal capital stock in an economic growth model. Applications to game theory are discussed in Scarf [56,58], Shapley [59], and Garcia, Lemke and Luethi [24]. Allgower [1] and Jeppson [31] use fixed-point algorithms to find many solutions to boundary-value problems.

Note: I Brouwer’s Theorem -- II Some Applications of Brouwer’s Theorem -- III Triangulations -- IV Algorithms to Find Completely-Labelled Simplices -- V Extensions of Brouwer’s Theorem -- VI Applications of Kakutani’s Theorem and its Extensions -- VII Eaves’ First Algorithm -- VIII Merrill’s Algorithm -- IX Homotopy Algorithms -- X Triangulations with Continuous Refinement of Grid Size -- XI Measures of Efficiency for Triangulations -- References.

In: Springer eBooks

Additional Edition: Printed edition: ISBN 9783540076858

Language: English

DOI: 10.1007/978-3-642-50327-6

URL: http://dx.doi.org/10.1007/978-3-642-50327-6

UID:

Format: 1 PDF (xiv, 149 pages).

ISBN: 9781611974386

Series Statement: MOS-SIAM series on optimization ; 23

Content: This book, the first on these topics, addresses the problem of finding an ellipsoid to represent a large set of points in high-dimensional space, which has applications in computational geometry, data representations, and optimal design in statistics. The book covers the formulation of this and related problems, theoretical properties of their optimal solutions, and algorithms for their solution. Due to the high dimensionality of these problems, first-order methods that require minimal computational work at each iteration are attractive. While algorithms of this kind have been discovered and rediscovered over the past fifty years, their computational complexities and convergence rates have only recently been investigated. The optimization problems in the book have the entries of a symmetric matrix as their variables, so the author's treatment also gives an introduction to recent work in matrix optimization. This book provides historical perspective on the problems studied by optimizers, statisticians, and geometric functional analysts; demonstrates the huge computational savings possible by exploiting simple updates for the determinant and the inverse after a rank-one update, and highlights the difficulties in algorithms when related problems are studied that do not allow simple updates at each iteration; and gives rigorous analyses of the proposed algorithms, MATLAB codes, and computational results.

Note: Preface -- 1. Introduction -- 2. Minimum-volume ellipsoids -- 3. Algorithms for the MVEE problem -- 4. Minimum-Area ellipsoidal cylinders -- 5. Algorithms for the MAEC problem -- 6. Related Problems and algorithms -- Appendix A. Background material -- Appendix B. MATLAB codes. , Also available in print version. , Mode of access: World Wide Web. , System requirements: Adobe Acrobat Reader.

Additional Edition: Print version: ISBN 9781611974379

Language: English

URL: SIAM

UID:

Format: 111 S.

Series Statement: Teorija i metody sistemnogo analiza

Uniform Title: The computation of fixed points and applications

Note: Aus dem Engl. - In kyrill. Schr.

Language: Russian

Keywords: Fixpunkt-Methode