Electronic Thesis on Modeling and Optimization

Author(s) Thesis
David M. Young, Jr. Iterative Methods for Solving Partial Difference Equations of Eliptic Type.
Ph.D. Thesis,
Harvard University, Cambridge, Mass,
May 1, 1950
79 pages
Michael Jay Holst CGCODE: Software for solving linear systems with conjugate gradient methods.
Master of Science in Computer Science,
Colorado State University, 1987
53 pages
Virginia Joanne Torczon
College of William & Mary
Department of Computer Science
P.O. Box 8795
Williamsburg, VA 23187-8795
Multi-directional search: A direct search algorithm for parallel machines
Ph.D. Thesis
Rice University, Houston, Texas, 1989
Alan Edelman
Massachusetts Institute of Technology
Eigenvalues and condition numbers of random matrices
Ph.D. Thesis (Professor Lloyd N. Trefethen, Thesis Supervisor)
Massachusetts Institute of Technology
May 1989
106 pages
Marcos Raydan Convergence properties of the Barzilai and Borwein gradient method
Ph.D. Thesis
Rice University, Houston, Texas, April, 1991
Sven Leyffer,
Mathematics and Computer Science Division at Argonne National Laboratory. .
e-mail: leyffer@mcs.anl.gov
Phone: (630) 252-4698; Fax: (630) 252-5986
Deterministic Methods for Mixed Integer Nonlinear Programming.
PhD Thesis, Department of Mathematics & Computer Science
University of Dundee
Dundee, December 1993 (117 pages)
Robert Mahony
Australian National University
Optimization Algorithms on Homogeneous Spaces with applications in linear systems theory
Ph.D. Thesis, March 1994
Department of Systems Engineering
Research School of Information Sciences and Engineering
Australian National University.
203 pages
Todd Plantenga,
Sandia National Laboratories,Northern California.
e-mail: tdplant@sandia.gov
phone: 925-294-2511
org: Dept 8950
Large-scale nonlinear constrained optimization using trust regions.
PhD Dissertation, Northwestern University, 1994.
Masakazu Muramatsu
Department of Mechanical Engineering, Sophia University,
7-1 Kioi-cho, Chiyoda-ku, Tokyo 102-8554 Japan.
Convergence Analysis of Affine Scaling Method for Linear Programming
Ph.D. Thesis
The Graduate University for Advanced Studies (1994).
Florian Jarre,
Mathematisches Institut
Lehrstuhl für Mathematische Optimierung
Universitätsstraße 1
D-40225 Düsseldorf
Interior-Point Methods via Self-concordance or relative Lipschitz Condition
Habilitationsschrift
Supervisor: Professor Josef Stoer
Fakultät für Mathematik, Würzburg, März 1994
Korrigierte Version 7. Juli 1994
Olivier du Merle Interior points and cutting palnes: development and implementation of methods for convex optimization and large scale structured linear programming
Ph.D. Thesis
Department of Management Studies,
University of Geneva,
Geneva, Switzerland, 1995 (in French)
Stefan Thienel
sd&m in München
ABACUS - A Branch And CUt System
Ph.D. Thesis
Universität zu Köln, 1995
Reha Tütüncü,
Department of Mathematical Sciences
6113 Wean Hall
Carnegie Mellon University
Pittsburgh, PA 15213
Infeasible-interior-point methods for linear and convex programming.
PhD Dissertation,
Cornell University, August 1996.
Erling D. Andersen,
MOSEK APS,
Fruebjergvej 3, Box 16,
2100 Copenhagen Ø,
Denmark.
Solution methods for linear and convex optimization problems with emphasis on interior-point methods.
PhD thesis,
Department of Management,
Odense University, January 1996.
Keith D. Gremban
School of Computer Science,
Carnegie Mellon University,
Pittsburg, PA 15213, USA
Combinatorial Preconditioners for Sparse, Symmetric, Diagonally Dominant Linear Systems
Ph.D. Thesis
Carnegie Mellon University. October 1996.
Kenneth D. Boese Models for Iterative Global Optimization
Ph.D. Thesis
UCLA Computer Science Department, 1996
Mészáros, Cs. The efficient implementation of interior point methods for linear programming and their applications
Ph.D. Thesis
Eötvös Loránd University of Sciences, 1996.
Luís Nunes Vicente
Department of Mathematics
School of Sciences and Technology
University of Coimbra.
3001-454 Coimbra, Portugal
Trust-Region Interior-Point Algorithms for a Class of Nonlinear Programming Problems
Ph.D. Thesis
Rice University, Houston, Texas, March 1996
Seyed Jafar Sadjadi
University of Waterloo,
Nonlinear programming using an expanded Lagrangean function. A water resource management case study.
Ph.D. Thesis,
University of Waterloo,
156 pages
Mika Hirvensalo
Department of Mathematics,
University of Turku,
FIN-20014 Turku, Finland
On Quantum Computation.
Ph.Lic. thesis on quantum computation,
TUCS Technical Report No.111, May 1997
ISBN 952-12-0001-4
ISSN 1239-1891
96 pages
Wolfram Schlickenrieder
ETH Zürich
Institute for Operations Research
CH-8092 Zürich
Switzerland
Nets of Polyhedra
Diplomarbeit
Technische Universitaet Berlin
16. Juni 1997.
105 pages
Adrian Sandu
Department of Computer Science
Michigan Technological University
Houghton, MI 49931, USA
E-mail: asandu@mtu.edu
Numerical Aspects of Air Quality Models
Ph.D. Thesis
The University of Iowa, August 1997.
Tamara Gibson Kolda

Limited-memory matrix methods with applications.Disertation, Faculty of the Graduate School of the University of Maryland at College Park. 1997.

Erik Dotzauer
Division of Optimization,
Department of Mathematics,
Linköping University
Algorithms for Short-Term Production-Planning of Cogeneration Plants.
Thesis No. 644,
ISBN 91-7219-033-7, ISSN 0280-7971, 1997.
Division of Optimization,
Department of Mathematics, Linköping University.
S-581, 83 Linköping, Sweden
Martin Wechs,
Department of Applied Mathematics and Statistics,
University of Würzburg,
Am Hubland,
D-97074 Würzburg, Germany
E-mail: wechs@mathematik.uni-wuerzburg.de
Analysis of Interior-Point Paths and New Interior-Point Methods for Solving Linear Programming Problems.
Doctoral thesis, Dept. of Appl. Math. and Statistics,
University of Würzburg, Würzburg, Germany (1998)
70 pages
Zafar A. Ansari Limited memory space dilation and reduction algorithms.
Thesis - Master of Science, July 13, 1998
74 pages
Virginia Polytechnic Institute.
Blacksburg, Virginia
Chairman: Dr. Hanif D. Sherali
Ralf Borndörfer
Konrad-Zuse-Zentrum Berlin
Takustraße 7
14195 Berlin
Aspects of Set Packing, Partitioning, and Covering
Ph.D Thesis
Technische Universitaet Berlin
March 30, 1998
219 pages
Xueyu Chen
University of Mississippi
The optimal implementation of on-line optimization for chemical and refinery processes
Ph.D. Thesis
Louisiana State University
May 1998
398 pages
Marielba Rojas A Large-Scale Trust-Region Approach to the Regularization of Discrete Ill-Posed Problems.
Ph.D. Thesis
Rice University, May 1998.
Nathan Brixius Truss Topology Design
Master of Sciences Thesis
Iowa University, 1998
Thesis superviser: Professor Florian A. Potra
Guanghui Liu
Northwestern University
Design Issues in Algorithms for Large Scale Nonlinear Programming
Ph.D Thesis
Evanston, Illinois
Northwestern University,
June 1999, 163 pages.
Erik Boman
Sandia National Laboratories,
Albuquerque, NM 87185-1111, USA
Infeasibility and negative curvature in optimization
Ph.D. Thesis
Stanford University, February 1999.
Alexander Barclay
University of California, San Diego, USA.
SQP Methods for Large-Scale Optimization
Ph.D. Thesis, 130 pages.
University of California, 1999.
Meredith Goldsmith,
Department of EES & OR
Terman Engineering Center
Stanford, CA 94305-4023
Sequential Quadratic Programming Methods Based on Indefinite Hessian Approximations.
Ph.D. Dissertation, Stanford University, March 1999.
Jacob Søndergaard
Informatics and Mathematical Modelling
Technical University of Denmark
Non-Linear Optimization Using Space Mapping.
Ph.D. Thesis
Technical University of Denmark, Lyngby 1999.
Krung Sinapiromsaran Practical Optimization of Simulations: Computation and Tools
Ph.D. Thesis
University of Wisconsin - Madison, 2000
Thomas James Byer

Preconditioned Newton methods for simulation of reservoires with surface facilities.

Ph.D. Thesis (222 pages)

University of Stanford - Stanford 2000.

Antonio Del Gatto A Subspace Method Based on a Differential Equation Approach to Solve Unconstrained Optimization Problems
Ph.D. Thesis (110 pages)
University of Stanford - Stanford, June 2000
Principal Advisor: Prof. Walter Murray
Olivier Epelly An interior point method for smooth convex optimization - Application to large-scale economic models
Ph.D. Thesis
University of Geneva
Geneve, 2001
Moritz Diehl
Institute of Mathematics and its Applications (IMA)
University of Minnesota, 400 Lind Hall, 207 Church Street S.E.,
Minneapolis, MN 55455-0436, USA
Real-Time Optimization for Large Scale Nonlinear Processes
Ph.D. Thesis
University of Heidelberg, June 2001.
Sven O. Krumke
Department of Mathematics
University of Kaiserslautern
P.O.Box 3049
D-67653 Kaiserslautern, Germany
Online Optimization - Competitive Analysis and Beyond.
Habilitation Thesis, Technical University of Berlin, 2001.
On the Approximability of Location and Network Design Problems.
Dissertation, University of Würzburg, 1997.
Mark Ziegelmann Constrained Shortest Paths and Related Problems
Ph.D. Thesis
Universität des Saarlandes, Saarbrücken, 30. Juli 2001.
Cristian A. Homescu Optimal control of continuous and discontinous flow
Ph. D Thesis, (164 pages) Florida State University,
College of Arts and Sciences
July 15, 2002
Professor Directing Thesis: I.M. NAVON
Andreas Wächter
IBM T. J. Watson Research Center
P.O. Box 218
Yorktown Heights, NY 10598
An Interior Point Algorithm for Large-Scale Nonlinear Optimization with Applications in Process Engineering.
Ph.D. Thesis
Carnegie Mellon University, Pittsburg, January 2002.
Meta Voelker
University of Wisconsin - Madison,
Computer Sciences & Statistics.
Optimization of Slice Models
Ph.D. Thesis
University of Wisconsin - Madison, 2002
Jin-Ho Lim
University of Wisconsin - Madison,
Computer Sciences & Statistics.
Optimization in Radiation Treatment Planning
Ph.D. Thesis
University of Wisconsin - Madison, 2002.
Vishnu V. Sadhana
University of Florida,
EFFICIENT PRESOLVING IN LINEAR PROGRAMMING
Master of Science Thesis
University of Florida, 2002.
Committee: Prof. Tim Davis, Prof. Hager, Dr. Baba Vemuri.
Ellen Fan
McMaster University - Hamilton, Ontario
Global optimization of Lennard-Jones atomic clusters.
Thesis: Master of Science, (141 pages)
McMaster University, February 26, 2002.
James Dale Cloyd
East Tennessee State University
Data mining with Newton's method.
Thesis: Master of Science, (113 pages)
East Tennessee State University, December 2002.
Bruno Carpentieri
CERFACS
Sparse preconditioners for dense linear systems from electromagnetic applications.
Ph.D. Thesis
l'Institut National Polytechnique de Toulouse
April 23, 2002.
Michael P. Friedlander
University of British Columbia
A globally convergent linearly constrained Lagrangian method for nonlinear optimization.
Ph.D. Thesis (Advisor: M.A. Saunders)
Stanford University - Stanford, August 2002
Frank Vanden Berghen
Universite Libre de Bruxelles,
Faculte des Scientes Appliqees,
DEA en Science Appliquees,
Directeur de Memoire: Pr. Dr. Ir. H. Bersini

Intermediate report on the development of an optimization code for smooth, continous objective functions when derivarives are not available
Faculte des Scientes Appliqees
IRIDIA
Annee Academique: 2002-2003

Clark Matthew Amerault Development of the COAMPS adjoint mesoscale modeling system for assimilating microwave radiances within hurricanes.
Ph.D. Thesis, Florida State University,
Spring Semester, 2005, 95 pages
Makoto Yamashita Paralell implementation of primal-dual interior-point methods for semidefinite programming.
Ph.D. Thesis, Tokyo Institute of Technology,
Supervisor: Prof. M. Kojima
March 2004, 88 pages
Vasile Lucian Basescu
Rensselaer Polytechnic Institute,
Department of Mathematical Sciences.

An analitic center cutting plane method in conic programming
Ph.D. Thesis (Professor John Mitchell)
Rensselaer Polytechnic Institute
July 2003
Advisor: John Eric Mitchell
140 pages

Michael Charles Grant
Department of Electrical Engineering, Stanford University
DISCIPLINED CONVEX PROGRAMMING
Ph.D. Thesis, Department of Electrical Engineering,
Stanford University
Supervisor: Professor Stephen Boyd
December 2004
145 pages
Melvyn Sim
National Univerity of Singapore (1996)
S.M, HPCES, Singapore-MIT-Alliance (2000)
Robust Optimization
Ph.D. Thesis, Department of Electrical Engineering,
Sloan School of Management
MASSACHUSETTS INSTITUTE OF TECHNOLOGY
Supervisor: Dimitris J. Bertsimas; James B. Orlin
May 14, 2004,
171 pages
Hilary (Sue) Dollar
Rutherford Appleton Laboratory, Chilton, Didcot, Oxfordshire, OX11 0QX, UK.
Iterative linear algebra for constrained optimization
Ph.D. Thesis, Keble College, Universisy of Oxford
Michaelmas, 2005
Supervisor: Professor Andy Wathen
235 pages
Hua Wei
University of Waterloo
Numerical Stability in Linear Programming and Semidefnite Programming
Ph.D. Thesis, University of Waterloo
Waterloo, Ontario, Canada, 2006
Supervisor: Professor Henry Wolkowicz
143 pages
Elena Olvovsky
Technion - Israel Institute of Technology
Novel gradient-type optimization algorithms for extremely large-scale nonsmooth convex optimization
Ph.D. Thesis, Technion
Haifa, Israel, 2005
Supervisor: Professors: Alexander Ioffe, Arie Leizarowitz, Arkadi Nemirovski
59 pages
Hongchao Zhang
University of Florida
Gradient methods for large scale nonlinear optimization
Ph.D. Thesis, University of Florida
Florida, U.S.A, 2006
Supervisor: Professor William W. Hager
140 pages
Mikael Fallgren
Royal Institute of Technology
On the robustness of conjugate-gradient methods and quasi-Newton methods
Master Thesis,
Department of Mathematics, Royal Institute of Technology, 7/9 - 2006
35 pages
Seppo Pulkkinen
University of Helsinki,
Department of Mathematics and Statistics
A Review of Methods for Unconstrained Optimization: Theory, Implementation and Testing
Master Thesis,
Department of Mathematics and Statistics
University of Helsinki
Kumpula Science Library
Supervisor Prof. Matti Vuorinen
November 2008, 89+IX pages
Vryan Gil S. Palma
Fachbereich Mathematik
Technische Universit¨at Kaiserslautern
Optimal Control of Fluids based on Lattice Boltzmann Method Discretizations
Master of Science in Industrial Mathematics,
Fachbereich Mathematik
Technische Universit¨at Kaiserslautern
Supervisor Prof. Dr. Ren´e Pinnau
August 11, 2008, 79 pages
Martha Salazar Neumann
Universit´e Libre de Bruxelles
Facult´e des Sciences
Advances in robust combinatorial optimization and linear programming
These presentee en vue de l’obtention du titre de Docteur en Sciences,
Universite Libre de Bruxelles,
Faculte des Sciences,
Supervisor Prof. Martine Labbe
Annee academique 2009-2010, 149 pages
Jeffrey L. Steward
The Florida State University
College of Arts and Sciences
Practical optimization algorithms in the data assimilation of large-scale systems with non-linear and non-smooth observation operators
A disertation submitted to the Department of Scientific Computing,
The Florida State of University,
College of Arts and Sciences,
Supervisor Prof. Ionel Michail Navon
Spring 2012, 98 pages