DOCSLIB.ORG

George B. Dantzig Papers SC0826

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
George B. Dantzig Papers SC0826 http://oac.cdlib.org/findaid/ark:/13030/c8s75gwd No online items Guide to the George B. Dantzig Papers SC0826 Daniel Hartwig & Jenny Johnson Department of Special Collections and University Archives March 2012 Green Library 557 Escondido Mall Stanford 94305-6064 [email protected] URL: http://library.stanford.edu/spc Guide to the George B. Dantzig SC0826 1 Papers SC0826 Language of Material: English Contributing Institution: Department of Special Collections and University Archives Title: George B. Dantzig papers creator: Dantzig, George Bernard, 1914-2005 Identifier/Call Number: SC0826 Physical Description: 91 Linear Feet Date (inclusive): 1937-1999 Special Collections and University Archives materials are stored offsite and must be paged 36-48 hours in advance. For more information on paging collections, see the department's website: http://library.stanford.edu/depts/spc/spc.html. Information about Access The materials are open for research use. Audio-visual materials are not available in original format, and must be reformatted to a digital use copy. Ownership & Copyright All requests to reproduce, publish, quote from, or otherwise use collection materials must be submitted in writing to the Head of Special Collections and University Archives, Stanford University Libraries, Stanford, California 94305-6064. Consent is given on behalf of Special Collections as the owner of the physical items and is not intended to include or imply permission from the copyright owner. Such permission must be obtained from the copyright owner, heir(s) or assigns. See: http://library.stanford.edu/depts/spc/pubserv/permissions.html. Restrictions also apply to digital representations of the original materials. Use of digital files is restricted to research and educational purposes. Cite As [identification of item], George B. Dantzig Papers (SC0826). Dept. of Special Collections and University Archives, Stanford University Libraries, Stanford, Calif. Biographical / Historical George Bernard Dantzig (November 8, 1914 – May 13, 2005) was an American mathematical scientist who made important contributions to operations research, computer science, economics, and statistics. Dantzig is known for his development of the simplex algorithm, an algorithm for solving linear programming problems, and his work with linear programming. In statistics, Dantzig solved two open problems in statistical theory, which he had mistaken for homework after arriving late to a lecture of Jerzy Neyman. Dantzig was the Professor Emeritus of Transportation Sciences and Professor of Operations Research and of Computer Science at Stanford. Born in Portland, Oregon, George Bernard Dantzig was named after George Bernard Shaw, the Irish writer. His father, Tobias Dantzig, was born in Shavli Lithuania, a Jew living in the Pale of Russia. He received his Ph.D. at Indiana University, taught at various universities including Johns Hopkins before he moving to the University of Md., where he transformed the mathematics department from that of an agriculture school to a research math department. He was chairman of the department for some time. His field of interest was geometry. He was a descendent of Rabbi Abraham Danzig of Vilna, known as the Chaye Odom. His mother, Anja Ourisson (nee Uryson) Dantzig was born in Lodz, Poland, attended the Sorbonne, where she also studied mathematics. In the US, she earned bachelors and masters degrees in French literature, but translated Slavic languages at the Library of Congress, where she was assistant head of the division. She was related to the Russian mathematician Pavel Uryson. Dantzig's parents met during their study at the Sorbonne University in Paris, where Tobias studied mathematics under Henri Poincaré, after whom Dantzig's brother was named. The Dantzigs immigrated to the United States, where they settled in Portland, Oregon. Early in the 1920s the Dantzig family moved from Baltimore to Washington. His mother became assistant chief Slavic translator at the Library of Congress, and his father became chairman of the Department of Mathematics at the University of Maryland, College Park, George attended Powell Junior High School and Central High School; one of his friends there was Abraham Seidenberg, who was a professor of Mathematics at UC Berkeley. By the time he reached high school he was already fascinated by geometry, and this interest was further nurtured by his father, challenging him with complicated problems, particularly in projective geometry. George Dantzig earned bachelor's degrees in mathematics and physics from the University of Maryland in 1936, and his master's degree in mathematics from the University of Michigan in 1938. After a two-year period at the Bureau of Labor Statistics, he enrolled in the doctoral program in mathematics at the University of California, Berkeley, where he studied statistics under Jerzy Neyman. Guide to the George B. Dantzig SC0826 2 Papers SC0826 With the outbreak of World War II, George took a leave of absence from the doctoral program at Berkeley to join the U.S. Air Force Office of Statistical Control. In 1946, he returned to Berkeley to complete the requirements of his program and received his Ph.D. that year. Although he had a faculty offer from Berkeley, he returned to the Air Force as mathematical advisor to the comptroller. In 1952 Dantzig joined the mathematics division of the RAND Corporation. By 1960 he became a professor in the Department of Industrial Engineering at UC Berkeley, where he founded and directed the Operations Research Center. In 1966 he joined the Stanford faculty as Professor of Operations Research and of Computer Science. A year later, the Program in Operations Research became a full-fledged department. In 1973 he founded the Systems Optimization Laboratory (SOL) there. On a sabbatical leave that year, he headed the Methodology Group at the International Institute for Applied Systems Analysis (IIASA) in Laxenburg, Austria. Later he became the C. A. Criley Professor of Transportation Sciences at Stanford, and kept going, well beyond his mandatory retirement in 1985. He was a member of the National Academy of Sciences, the National Academy of Engineering, and the American Academy of Arts and Sciences. George was the recipient of many honors, including the first John von Neumann Theory Prize in 1974, the National Medal of Science in 1975, an honorary doctorate from the University of Maryland, College Park in 1976. The Mathematical Programming Society honored Dantzig by creating the George B. Dantzig Prize, bestowed every three years since 1982 on one or two people who have made a significant impact in the field of mathematical programming. Dantzig died on May 13, 2005, in his home in Stanford, California, of complications from diabetes and cardiovascular disease. He was 90 years old. Related Materials Related George B. Dantzig papers donated to the University of Maryland (https://www.lib.umd.edu/) by Jessica Klass. Subjects and Indexing Terms Mathematics -- Study and teaching (Higher). Mathematicians -- United States. Computer science -- Study and teaching Computer science -- Research Systems programming (Computer science) Dantzig, George Bernard, 1914-2005 Additional material Accession ARCH-2005-363 box 1, folder 1 On a Class of Distributions that Approach the Normal Distribution Function 1939 box 1, folder 2 On the Non-Existence of Tests of Students' Hypothesis Involving Power Functions Independent of Sigma 1940 box 1, folder 3 A Theorem on Linear Inequalities 1948, January 5 box 1, folder 4 A Proof of the Equivalence of the Programming Problem and the Game Problem, in T.C. Koopmans (ed.) box 1, folder 5 Programming of Interdependent Activities, II: Mathematical Model 1951 box 1, folder 6 Maximization of a Linear Function of VariablesSubject to Linear Inequalities box 1, folder 7 Application of the Simplex Method to the Transportation Problem 1951 box 1, folder 8 Programming in a Linear Structure 1949 box 1, folder 9 Linear Programming 1951 box 1, folder 10 On the Fundamental Lemma of Neyman and Pearson 1591 box 1, folder 11 The Generalized Simplex Method for Minimizing a Linear Form Under Linear Inequality Constraints 1955 box 1, folder 12 The Fixed Charge Problem 1954 box 1, folder 13 A Duality Theorem Based on the Simplex Method 1952 box 1, folder 14 Alternate Algorithm for the Revised Simplex Method Using Product Form for the Inverse 1953 box 1, folder 15 The Dual Simplex Algorithm (Notes on Linear Programming Part VII) 1954 box 1, folder 16 Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming (Notes on Linear Programming: Part VIII, XI, X) 1954 box 1, folder 17 Notes on Linear Programming: Part XI, Composite Simplex-Dual Simplex Algorithm 1954 Guide to the George B. Dantzig SC0826 3 Papers SC0826 Additional material Accession ARCH-2005-363 box 1, folder 18 Solution for a Large-Scale Traveling Salesman Problem 1954 box 1, folder 19 Minimizing the Number of Tankers to Meet a Fixed Schedule 1956 box 1, folder 20 The Product Form for the Inverse in the Simplex Method 1954 box 1, folder 21 A Comment on Eddie's "Traffic Delays at Toll Booths" 1954 box 1, folder 22 Linear Programming Under Uncertainty 1955 box 1, folder 23 Optimal Solution of a Dynamic Leontief Model with Substitution (Notes on Linear Programming: Part XIII) 1955 box 1, folder 24 A Production Smoothing Problem 1955 box 1, folder 25 Developments in Linear Programming 1955 box 1, folder 26 Constructive Proof of the Min-Max Theorem 1956 box 1, folder 27 Recent
Load more

Recommended publications
  • Positional Notation Or Trigonometry [2, 13]
    The Greatest Mathematical Discovery? David H. Bailey∗ Jonathan M. Borweiny April 24, 2011 1 Introduction Question: What mathematical discovery more than 1500 years ago: • Is one of the greatest, if not the greatest, single discovery in the field of mathematics? • Involved three subtle ideas that eluded the greatest minds of antiquity, even geniuses such as Archimedes? • Was fiercely resisted in Europe for hundreds of years after its discovery? • Even today, in historical treatments of mathematics, is often dismissed with scant mention, or else is ascribed to the wrong source? Answer: Our modern system of positional decimal notation with zero, to- gether with the basic arithmetic computational schemes, which were discov- ered in India prior to 500 CE. ∗Bailey: Lawrence Berkeley National Laboratory, Berkeley, CA 94720, USA. Email: [email protected]. This work was supported by the Director, Office of Computational and Technology Research, Division of Mathematical, Information, and Computational Sciences of the U.S. Department of Energy, under contract number DE-AC02-05CH11231. yCentre for Computer Assisted Research Mathematics and its Applications (CARMA), University of Newcastle, Callaghan, NSW 2308, Australia. Email: [email protected]. 1 2 Why? As the 19th century mathematician Pierre-Simon Laplace explained: It is India that gave us the ingenious method of expressing all numbers by means of ten symbols, each symbol receiving a value of position as well as an absolute value; a profound and important idea which appears so simple to us now that we ignore its true merit. But its very sim- plicity and the great ease which it has lent to all computations put our arithmetic in the first rank of useful inventions; and we shall appre- ciate the grandeur of this achievement the more when we remember that it escaped the genius of Archimedes and Apollonius, two of the greatest men produced by antiquity.
    [Show full text]
  • A Generalized Dual Phase-2 Simplex Algorithm1
    A Generalized Dual Phase-2 Simplex Algorithm1 Istvan´ Maros Department of Computing, Imperial College, London Email: [email protected] Departmental Technical Report 2001/2 ISSN 1469–4174 January 2001, revised December 2002 1This research was supported in part by EPSRC grant GR/M41124. I. Maros Phase-2 of Dual Simplex i Contents 1 Introduction 1 2 Problem statement 2 2.1 The primal problem . 2 2.2 The dual problem . 3 3 Dual feasibility 5 4 Dual simplex methods 6 4.1 Traditional algorithm . 7 4.2 Dual algorithm with type-1 variables present . 8 4.3 Dual algorithm with all types of variables . 9 5 Bound swap in dual 11 6 Bound Swapping Dual (BSD) algorithm 14 6.1 Step-by-step description of BSD . 14 6.2 Work per iteration . 16 6.3 Degeneracy . 17 6.4 Implementation . 17 6.5 Features . 18 7 Two examples for the algorithmic step of BSD 19 8 Computational experience 22 9 Summary 24 10 Acknowledgements 25 Abstract Recently, the dual simplex method has attracted considerable interest. This is mostly due to its important role in solving mixed integer linear programming problems where dual feasible bases are readily available. Even more than that, it is a realistic alternative to the primal simplex method in many cases. Real world linear programming problems include all types of variables and constraints. This necessitates a version of the dual simplex algorithm that can handle all types of variables efficiently. The paper presents increasingly more capable dual algorithms that evolve into one which is based on the piecewise linear nature of the dual objective function.
    [Show full text]
  • A Century of Mathematics in America, Peter Duren Et Ai., (Eds.), Vol
    Garrett Birkhoff has had a lifelong connection with Harvard mathematics. He was an infant when his father, the famous mathematician G. D. Birkhoff, joined the Harvard faculty. He has had a long academic career at Harvard: A.B. in 1932, Society of Fellows in 1933-1936, and a faculty appointmentfrom 1936 until his retirement in 1981. His research has ranged widely through alge­ bra, lattice theory, hydrodynamics, differential equations, scientific computing, and history of mathematics. Among his many publications are books on lattice theory and hydrodynamics, and the pioneering textbook A Survey of Modern Algebra, written jointly with S. Mac Lane. He has served as president ofSIAM and is a member of the National Academy of Sciences. Mathematics at Harvard, 1836-1944 GARRETT BIRKHOFF O. OUTLINE As my contribution to the history of mathematics in America, I decided to write a connected account of mathematical activity at Harvard from 1836 (Harvard's bicentennial) to the present day. During that time, many mathe­ maticians at Harvard have tried to respond constructively to the challenges and opportunities confronting them in a rapidly changing world. This essay reviews what might be called the indigenous period, lasting through World War II, during which most members of the Harvard mathe­ matical faculty had also studied there. Indeed, as will be explained in §§ 1-3 below, mathematical activity at Harvard was dominated by Benjamin Peirce and his students in the first half of this period. Then, from 1890 until around 1920, while our country was becoming a great power economically, basic mathematical research of high quality, mostly in traditional areas of analysis and theoretical celestial mechanics, was carried on by several faculty members.
    [Show full text]
  • From the Collections of the Seeley G. Mudd Manuscript Library, Princeton, NJ
    From the collections of the Seeley G. Mudd Manuscript Library, Princeton, NJ These documents can only be used for educational and research purposes (“Fair use”) as per U.S. Copyright law (text below). By accessing this file, all users agree that their use falls within fair use as defined by the copyright law. They further agree to request permission of the Princeton University Library (and pay any fees, if applicable) if they plan to publish, broadcast, or otherwise disseminate this material. This includes all forms of electronic distribution. Inquiries about this material can be directed to: Seeley G. Mudd Manuscript Library 65 Olden Street Princeton, NJ 08540 609-258-6345 609-258-3385 (fax) [email protected] U.S. Copyright law test The copyright law of the United States (Title 17, United States Code) governs the making of photocopies or other reproductions of copyrighted material. Under certain conditions specified in the law, libraries and archives are authorized to furnish a photocopy or other reproduction. One of these specified conditions is that the photocopy or other reproduction is not to be “used for any purpose other than private study, scholarship or research.” If a user makes a request for, or later uses, a photocopy or other reproduction for purposes in excess of “fair use,” that user may be liable for copyright infringement. The Princeton Mathematics Community in the 1930s Transcript Number 11 (PMC11) © The Trustees of Princeton University, 1985 MERRILL FLOOD (with ALBERT TUCKER) This is an interview of Merrill Flood in San Francisco on 14 May 1984. The interviewer is Albert Tucker.
    [Show full text]
  • Jacob Wolfowitz 1910–1981
    NATIONAL ACADEMY OF SCIENCES JACOB WOLFOWITZ 1910–1981 A Biographical Memoir by SHELEMYAHU ZACKS Any opinions expressed in this memoir are those of the author and do not necessarily reflect the views of the National Academy of Sciences. Biographical Memoirs, VOLUME 82 PUBLISHED 2002 BY THE NATIONAL ACADEMY PRESS WASHINGTON, D.C. JACOB WOLFOWITZ March 19, 1910–July 16, 1981 BY SHELEMYAHU ZACKS ACOB WOLFOWITZ, A GIANT among the founders of modern Jstatistics, will always be remembered for his originality, deep thinking, clear mind, excellence in teaching, and vast contributions to statistical and information sciences. I met Wolfowitz for the first time in 1957, when he spent a sab- batical year at the Technion, Israel Institute of Technology. I was at the time a graduate student and a statistician at the building research station of the Technion. I had read papers of Wald and Wolfowitz before, and for me the meeting with Wolfowitz was a great opportunity to associate with a great scholar who was very kind to me and most helpful. I took his class at the Technion on statistical decision theory. Outside the classroom we used to spend time together over a cup of coffee or in his office discussing statistical problems. He gave me a lot of his time, as though I was his student. His advice on the correct approach to the theory of statistics accompanied my development as statistician for many years to come. Later we kept in touch, mostly by correspondence and in meetings of the Institute of Mathematical Statistics. I saw him the last time in his office at the University of Southern Florida in Tampa, where he spent the last years 3 4 BIOGRAPHICAL MEMOIRS of his life.
    [Show full text]
  • Interview with Martin Gardner Page 602
    ISSN 0002-9920 of the American Mathematical Society june/july 2005 Volume 52, Number 6 Interview with Martin Gardner page 602 On the Notices Publication of Krieger's Translation of Weil' s 1940 Letter page 612 Taichung, Taiwan Meeting page 699 ., ' Martin Gardner (see page 611) AMERICAN MATHEMATICAL SOCIETY A Mathematical Gift, I, II, Ill The interplay between topology, functions, geometry, and algebra Shigeyuki Morita, Tokyo Institute of Technology, Japan, Koji Shiga, Yokohama, Japan, Toshikazu Sunada, Tohoku University, Sendai, Japan and Kenji Ueno, Kyoto University, Japan This three-volume set succinctly addresses the interplay between topology, functions, geometry, and algebra. Bringing the beauty and fun of mathematics to the classroom, the authors offer serious mathematics in an engaging style. Included are exercises and many figures illustrating the main concepts. It is suitable for advanced high-school students, graduate students, and researchers. The three-volume set includes A Mathematical Gift, I, II, and III. For a complete description, go to www.ams.org/bookstore-getitem/item=mawrld-gset Mathematical World, Volume 19; 2005; 136 pages; Softcover; ISBN 0-8218-3282-4; List US$29;AII AMS members US$23; Order code MAWRLD/19 Mathematical World, Volume 20; 2005; 128 pages; Softcover; ISBN 0-8218-3283-2; List US$29;AII AMS members US$23; Order code MAWRLD/20 Mathematical World, Volume 23; 2005; approximately 128 pages; Softcover; ISBN 0-8218-3284-0; List US$29;AII AMS members US$23; Order code MAWRLD/23 Set: Mathematical World, Volumes 19, 20, and 23; 2005; Softcover; ISBN 0-8218-3859-8; List US$75;AII AMS members US$60; Order code MAWRLD-GSET Also available as individual volumes ..
    [Show full text]
  • Stochastic Combinatorial Optimization with Controllable Risk Aversion Level
    Stochastic Combinatorial Optimization with Controllable Risk Aversion Level Anthony Man–Cho So Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, N. T., Hong Kong email: [email protected] Jiawei Zhang Department of Information, Operations, and Management Sciences, Stern School of Business, New York University, New York, NY 10012, USA email: [email protected] Yinyu Ye Department of Management Science and Engineering and, by courtesy, Electrical Engineering, Stanford University, Stanford, CA 94305, USA email: [email protected] Most of the recent work on 2–stage stochastic combinatorial optimization problems have focused on the min- imization of the expected cost or the worst–case cost of the solution. Those two objectives can be viewed as two extreme ways of handling risk. In this paper we propose to use an one–parameter family of functionals to interpolate between them. Although such a family has been used in the mathematical finance and stochastic programming literature before, its use in the context of approximation algorithms seems new. We show that under standard assumptions, a broad class of risk–adjusted 2–stage stochastic programs can be efficiently treated by the Sample Average Approximation (SAA) method. In particular, our result shows that it is computationally feasible to incorporate some degree of robustness even when the underlying distribution can only be accessed in a black–box fashion. We also show that when combined with suitable rounding procedures, our result yields new approximation algorithms for many risk–adjusted 2–stage stochastic combinatorial optimization problems under the black–box setting.
    [Show full text]
  • The Book Review Column1 by William Gasarch Department of Computer Science University of Maryland at College Park College Park, MD, 20742 Email: [email protected]
    The Book Review Column1 by William Gasarch Department of Computer Science University of Maryland at College Park College Park, MD, 20742 email: [email protected] In this column we review the following books. 1. We review four collections of papers by Donald Knuth. There is a large variety of types of papers in all four collections: long, short, published, unpublished, “serious” and “fun”, though the last two categories overlap quite a bit. The titles are self explanatory. (a) Selected Papers on Discrete Mathematics by Donald E. Knuth. Review by Daniel Apon. (b) Selected Papers on Design of Algorithms by Donald E. Knuth. Review by Daniel Apon (c) Selected Papers on Fun & Games by Donald E. Knuth. Review by William Gasarch. (d) Companion to the Papers of Donald Knuth by Donald E. Knuth. Review by William Gasarch. 2. We review jointly four books from the Bolyai Society of Math Studies. The books in this series are usually collections of article in combinatorics that arise from a conference or workshop. This is the case for the four we review. The articles here vary tremendously in terms of length and if they include proofs. Most of the articles are surveys, not original work. The joint review if by William Gasarch. (a) Horizons of Combinatorics (Conference on Combinatorics Edited by Ervin Gyori,¨ Gyula Katona, Laszl´ o´ Lovasz.´ (b) Building Bridges (In honor of Laszl´ o´ Lovasz’s´ 60th birthday-Vol 1) Edited by Martin Grotschel¨ and Gyula Katona. (c) Fete of Combinatorics and Computer Science (In honor of Laszl´ o´ Lovasz’s´ 60th birthday- Vol 2) Edited by Gyula Katona, Alexander Schrijver, and Tamas.´ (d) Erdos˝ Centennial (In honor of Paul Erdos’s˝ 100th birthday) Edited by Laszl´ o´ Lovasz,´ Imre Ruzsa, Vera Sos.´ 3.
    [Show full text]
  • Opf)P in OPERATIONS RESEARCH
    APPLICATION OF MATHEMATICAL PROGRAMMING DISSERTATION SUBMITTED IN PARTIAL FULFILMENT OF THE REQUIREMENTS FOR THE AWARD OF THE DEGREE OF iWasiter of ^i)Uo«opf)p IN OPERATIONS RESEARCH By TEG ALAM Under the Supervision of DR. A. BARI DEPARTMENT OF STATISTICS & OPERATIONS-RESEARCH ALIGARH MUSLIM UNIVERSITY ALIGARH (INDIA) 2001 '^•^ P5.-32^^ ^, DS3200 DEPARTMENT OF STATISTICS & OPERATION RESEARCI ALIGARH MUSLIM UNIVERSITY (Dr. X ^ari ALIGARH - 202002 -INDIA Ph.D (AUg) ^hone: 0571-701251 (O) "^ 0571-700112 (R) Dated: OE(RTlTICA'VE Certified that the dissertation entitled "Application of Mathematical Programming" is carried out by Tcg Alaitl under my supervision. The work is sufficient for the requirement of degree of Master of Philosophy in Operations Research. ((Dr. A. (Bari) Supervisor Univ. Exchange: (0571) 700920 -23 Extns:419, 421,422, 441 Fax:+91-571-400528 This Dissertation entitled ''^Application of Mathematical programming''' is submitted to the Aligarh Muslim University, Aligarh, for the partial fiilfillment of the degree of M.Phil in OperationsResearch. Mathematical programming is concerned with the determination of a minimum or a maximum of a function of several variables, which are required to satisfy a number of constraints. Such solutions are sought in diverse fields; including engineering, Operations Research, Management Science, numerical analysis and economics etc. This mamuscript consists of five chapters. Chapter-1 deals with the brief history of Mathematical Programming. It also contains numerous applications of Mathematical Programming. Chapter-2 gives an introduction of Transportation problem and devoted to extensions and methods of solutions. A numerical example and Relation of Transportation problems with Network problems are also discussed. Chapter - 3 gives an introduction of Game theory.
    [Show full text]
  • Adalékok Wald Ábrahám Életrajzához Additions to Abraham Wald's Biography Adăugări La Biografia Lui Abraham Wald FERENC Márta, LŐRINCZ Annamária, OLÁH-GÁL Róbert
    Adalékok Wald Ábrahám életrajzához Additions to Abraham Wald's biography Adăugări la biografia lui Abraham Wald FERENC Márta, LŐRINCZ Annamária, OLÁH-GÁL Róbert Sapientia Erdélyi Magyar Tudományegyetem, Csíkszeredai Kar, [email protected], [email protected], [email protected] Összefoglaló Száz évvel Bolyai János születése után Kolozsváron született egy másik nagy, de sajnos ke- vébé ismert matematikus, Wald Ábrahám. Wald Ábrahám ortodox-zsidó (hasszid) családban született. Sajnos nagyon kevés dokumentum maradt meg Wald életéről. A modern statisztikák- ban és az ökonometriában Wald nevét sok tétel őrzi. Ebben a cikkben eredeti dokumentumokat mutatunk be Wald Ábrahám életéről, nevezetesen: a kolozsvári piarista gimnázium matrikulai nyilvántartását, és 3 Wald Ábrahám által Alexits Györgynek magyarul írt levelet. A levéltári anyagok bemutatása forrásközlés. A cikk végén hangsúlyozzuk Wald Ábrahám szellemi és anyagi örökségének megőrzésének fontosságát. Wald örökségének megőrzéséhez emléktáblát kellene felállítani a Waldek szülői házának falán, Kolozsváron. Abstract One hundred years after the birth of János Bolyai, another well-known mathematician, Ábrahám Wald, was born in Cluj-Napoca. Ábrahám Wald was born into a Jewish-Orthodox family. Unfortu- nately, we don't have many documents about Wald's life. In modern statistics and econometrics many theorems of Wald's name are related. In this article we present original documents about the life of Ábrahám Wald, namely: the matriculation register from the Piarist High School in Cluj, and 3 letters of Ábrahám Wald written to György Alexits in Hungarian. Our presentation is an authentic first publi- cation. At the end of this article, we emphasize the importance of commemorating the intellectual and material heritage of Ábrahám Wald.
    [Show full text]
  • Practical Implementation of the Active Set Method for Support Vector Machine Training with Semi-Definite Kernels
    PRACTICAL IMPLEMENTATION OF THE ACTIVE SET METHOD FOR SUPPORT VECTOR MACHINE TRAINING WITH SEMI-DEFINITE KERNELS by CHRISTOPHER GARY SENTELLE B.S. of Electrical Engineering University of Nebraska-Lincoln, 1993 M.S. of Electrical Engineering University of Nebraska-Lincoln, 1995 A dissertation submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy in the Department of Electrical Engineering and Computer Science in the College of Engineering and Computer Science at the University of Central Florida Orlando, Florida Spring Term 2014 Major Professor: Michael Georgiopoulos c 2014 Christopher Sentelle ii ABSTRACT The Support Vector Machine (SVM) is a popular binary classification model due to its superior generalization performance, relative ease-of-use, and applicability of kernel methods. SVM train- ing entails solving an associated quadratic programming (QP) that presents significant challenges in terms of speed and memory constraints for very large datasets; therefore, research on numer- ical optimization techniques tailored to SVM training is vast. Slow training times are especially of concern when one considers that re-training is often necessary at several values of the models regularization parameter, C, as well as associated kernel parameters. The active set method is suitable for solving SVM problem and is in general ideal when the Hessian is dense and the solution is sparse–the case for the `1-loss SVM formulation. There has recently been renewed interest in the active set method as a technique for exploring the entire SVM regular- ization path, which has been shown to solve the SVM solution at all points along the regularization path (all values of C) in not much more time than it takes, on average, to perform training at a sin- gle value of C with traditional methods.
    [Show full text]
  • Optima 82 Publishes the Obituary of Paul Tseng by His Friends Affected by the Proposed Change; Only Their Subtitles Would Change
    OPTIMA Mathematical Programming Society Newsletter 82 Steve Wright MPS-sponsored meetings: the International Conference on Stochas- MPS Chair’s Column tic Programming (ICSP) XII (Halifax, August 14–20), the Interna- tional Conference on Engineering Optimization (Lisbon, September 6–9), and the IMA Conference on Numerical Linear Algebra and March 16, 2010. You should recently have received a letter con- Optimization (Birmingham, September 13–15). cerning a possible change of name for MPS, to “Mathematical Op- timization Society”. This issue has been discussed in earnest since ISMP 2009, where it was raised at the Council and Business meet- ings. Some of you were kind enough to send me your views follow- Note from the Editors ing the mention in my column in Optima 80. Many (including me) believe that the term “optimization” is more widely recognized and The topic of this issue of Optima is Mechanism Design –aNobel better understood as an appellation for our field than the current prize winning theoretical field of economics. name, both among those working in the area and our colleagues We present the main article by Jay Sethuraman, which introduces in other disciplines. Others believe that the current name should the main concepts and existence results for some of the models be retained, as it has the important benefits of tradition, branding, arising in mechanism design theory. The discussion column by Garud and name recognition. To ensure archival continuity in the literature, Iyengar and Anuj Kumar address a specific example of such a model the main titles of our journals Mathematical Programming, Series A which can be solved by the means of optimization.
    [Show full text]