Home » Dissertations » Stanford university theses and dissertations

Stanford university theses and dissertations

SOL PhD Dissertations

  • Some eloquent observations about keeping a thesis crisp and short &#133
    Yesteryear, present and way forward for the PhD thesis. Nature Editorial, Nature535, 7 (07 This summer 2016).
  • However: a 353-page masterpiece (single-spaced) &#133
    Exact and Fast Algorithms for Mixed-Integer Nonlinear Programming. genehmigte Dissertation,
    Ambros M. Gleixner. Konrad-Zuse-Zentrum f&#252r Informationstechnik Berlin (ZIB), Technical College of Berlin (24 June 2015).

    • Stanford thesis format:

    • Jul 2016: Start your thesis using these lines:

      documentclass[10pt]
      usepackage
      usepackage[total=, top=1.25in, left=1.5in]
      setstretch

    Line 1 sees that 10pt is very large enough and saves paper.
    Line 2 uses many years of evolving macros.
    Line 3 gives 1.5in margins right and left (great for binding and PDF viewing).
    Line 4 gives single spacing.

    Marly 2015: Success finally! Santiago Akle’s thesis was posted in 10pt with single spacing (setstretch). Thesis formatting at Stanford has become checked only through the Primary Advisor (who takes tacit responsibility when pressing the “Accept” button following online submission). We are able to now bypass a few of the archaic specifications of ProQuest Dissertation Publishing (Ann Arbor), who’ve been serving the requirements of microfiche storage.

  • August 2014 (revised August 2016): Stanford Thesis style file from Emma Pease, CSLI: suthesis-2e.sty webpage.
    The instance starts with documentclass[12pt], and suthesis-2e.sty specifies setstretch.
    We highly recommend [10pt] and setstretch for the reason that no-one must maximize the size of their thesis.
    Hopefully the Registrar will formally allow setstretch (single spacing) before an excessive amount of longer, like the majority of books and journals and technical papers that people read every single day.

    Stanford university theses and dissertations PhD thesis, Stanford University, April

    November 2007: Example LaTeX driver from Felix Kwok: felix-thesis-example.tex.
    In order to save trees, it uses 10pt, twoside, and setstretch, as allowed through the Registrar.
    Update (June 2011): Emma Pease presently has setstretch in suthesis-2e.sty, but setstretch still appears enough.

    12 , 2004: Earlier example LaTeX driver from Michael Friedlander: mpfthesis-example.tex.
    This is what it appears as though (19 short pages): mpfthesis-example.pdf.
    This is when setstretch started.
    pdflatex appears the easiest method to go nowadays. Figures may include pdf, png, or digital files.
    Some earlier help to make readable ps and pdf files is here now: readme.txt.

    Portable PDF files:

    • The next Unix or Linux command constitutes a Pdf truly portable by embedding all necessary fonts inside the file:
      ps2pdf -dPDFSETTINGS=/prepress thesis.pdf thesis_font_embed.pdf
      A side-benefit would be that the quality shrinks! (Because of David Fong for locating this command.)
    • Jiyan Yang (ICME).
      Randomized Straight line Algebra for big-Scale Data Applications.
      PhD thesis, Stanford College, August 2016.
  • Yuekai Sun (ICME).
    Regularization in High-Dimensional Statistics.
    PhD thesis, Stanford College, June 2015.
  • Santiago Akle Serrano (ICME).
    Algorithms for Unsymmetric Cone Optimization as well as an Implementation for Issues with the Exponential Cone.
    PhD thesis, Stanford College, March 2015.
  • Tomas Tinoco De Rubira (EE).
    Statistical Optimization and Modeling Approaches for Power System Operations and Planning.
    Stanford university theses and dissertations thesis crisp and


    PhD thesis, Stanford College, March 2015.

  • Xiangrui Meng (ICME).
    Randomized Algorithms for big-scale Strongly Over-determined Straight line Regression Problems.
    PhD thesis, Stanford College, June 2014.
  • Arwen Meister (ICME).
    Learning and Conjecture with Dynamical System Types of Gene Regulation.
    PhD thesis, Stanford College, November 2013.
  • Youngsoo Choi (ICME).
    Synchronised Analysis and style in PDE-Restricted Optimization.
    PhD thesis, Stanford College, December 2012.
  • Nicholas Henderson (ICME).
    Arc Search Means of Linearly Restricted Optimization.
    PhD thesis, Stanford College, June 2012.
  • Nicole Taheri (ICME).
    Straight line Optimization Means of Vehicle Energy and Communication Systems.
    PhD thesis, Stanford College, June 2012.
  • David Fong (ICME).
    Minimum-Residual Means of Sparse Least-Squares Using Golub-Kahan Bidiagonalization.
    PhD thesis, Stanford College, December 2011.
  • Howard Shek (ICME).
    Record and Formula Facets of Optimal Portfolios.
    PhD thesis, Stanford College, March 2011.
  • Christopher Maes (ICME).
    A Regularized Active-set Way of Sparse Convex Quadratic Programming.
    PhD thesis, Stanford College, November 2010.
  • Michael Haythorpe (School of Mathematics and Statistics, College of South Australia).
    Markov Chain Based Algorithms for that Hamiltonian Cycle Problem.
    PhD thesis, College of South Australia, This summer 2010.
  • Linzhong Deng (ICME).
    Multiple-Rank Updates to Matrix Factorizations for Nonlinear Analysis and Circuit Design.
    PhD thesis, Stanford College, May 2010.
  • Andrew Bradley (ICME).
    Algorithms for that Equilibration of Matrices as well as their Application to Limited-Memory Quasi-Newton Methods.
    PhD thesis, Stanford College, May 2010.
  • David Gleich (ICME).
    Models and Algorithms for PageRank Sensitivity.
    PhD thesis, Stanford College, September 2009.
  • Rene Schaub.
    Stochastic Programming Methods to Logistics Management.
    PhD thesis, Stanford College, March 2009.
  • Kaustuv (SCCM).
    IPSOL: An Inside Point Solver for Nonconvex Optimization Problems.
    PhD thesis, Stanford College, December 2008.
  • Hanh Huynh (SCCM).
    A Sizable-scale Quadratic Programming Solver According to Block-LU Updates from the KKT System.
    PhD thesis, Stanford College, September 2008.
  • Leo Tenenblat (IMPA).
    Iterative Refinements and Zoom: Acceleration and Warmstarting of Interior Point Methods
    PhD thesis, IMPA, Rio de Janeiro, South america, draft of June 2008.
    The Zoom technique for speeding up and warm-beginning interior methods
    PhD defense slides, IMPA, Rio de Janeiro, South america, This summer 2008.
  • Sou-Cheng Choi (ICME).
    Iterative Means of Singular Straight line Equations and Least-Squares Problems.
    PhD thesis, Stanford College, December 2006.
  • Samantha Infeld (Aero/Astro).
    Optimization of Mission The perception of Restricted Libration Point Space Missions.
    PhD thesis, Stanford College, March 2006. (version 12 ,.16, 2005)
  • Carol Jin.
    Scalable Sensor Localization Algorithms for Wireless Sensor Systems.
    PhD thesis, College of Toronto (joint research with Stanford College), November 2005.
    M. W. Carter, H. H. Jin, M. A. Saunders, and Y. Ye.
    SpaseLoc: An adaptive subproblem formula for scalable wireless sensor network localization .
    SIAM J. on Optimization 17(4), 1102-1128, December 2006.
  • Vinayak (Uday) Shanbhag.
    Decomposition and Sampling Means of Stochastic Equilibrium Problems.
    PhD thesis, Stanford College, December 2005.
    Champion of 2006 A. W. Tucker Prize awarded through the Mathematical Programming Society.
  • Che-Lin Su.
    Equilibrium Issues with Equilibrium Constraints: Stationarities, Algorithms, and Applications.
    PhD thesis, Stanford College, September 2005.
  • Zheng Su (SCCM).
    Computational Means of Least Squares Problems and Numerous Studies.
    PhD thesis, Stanford College, June 2005.
  • Alexis Collomb.
    Dynamic Asset Allocation by Stochastic Programming Methods.
    PhD thesis, Stanford College, December 2004.
  • Maureen Doyle.
    An Obstacle Formula for big Nonlinear Optimization Problems.
    PhD thesis, Stanford College, December 2003.
  • Carl-Magnus Fransson (Visiting Investigator, 2001-2003).
    Optimization Means of Robust Control, with Application to Resistive Wall Modes in Tokamaks.
    PhD thesis, Dept of Signals and Systems, Chalmers College of Technology, Goteborg, Norway, September 2003.
  • Byunggyoo Kim.
    Statistical Optimization Means of Image Restoration.
    PhD thesis, Stanford College, December 2002.
  • Michael P. Friedlander.
    A Globally Convergent Linearly Restricted Lagrangian Way of Nonlinear Optimization.
    PhD thesis, Stanford College, August 2002.
  • Kien-Ming Ng.
    A Continuation Method for Solving Nonlinear Optimization Issues with Discrete Variables.
    PhD thesis, Stanford College, June 2002. (ps )
  • Chih-Hung Lin.
    A Null-Space Primal-Dual Formula for Nonlinear Network Optimization.
    PhD thesis, Stanford College, March 2002. (ps )
  • Michael J. O’Sullivan.
    New Means of Dynamic Programming Over a vast Time Horizon.
    PhD thesis, Stanford College, Feb 2002. (ps )
  • Heiko Pieper.
    Algorithms for Mathematical Programs with Equilibrium Constraints with Applications to Deregulated Electricity Markets.
    PhD thesis, Stanford College, June 2001. (ps )
  • Titus F. Dorstenstein.
    Constructive and Exchange Algorithms for that Frequency Assignment Problem.
    PhD thesis, Stanford College, June 2001.
  • Angel-Victor de Miguel.
    Two Decomposition Algorithms for Nonconvex Optimization Issues with Global Variables.
    PhD thesis, Stanford College, April 2001. (ps )
  • Marty O’Brien.
    Approaches for Incorporating Expected Value Constraints into Stochastic Programs.
    PhD thesis, Stanford College, June 2000.
  • Antonino Del Gatto.
    A Subspace Method With different Differential Equation Method of Solve Unconstrained Optimization Problems.
    PhD thesis, Stanford College, June 2000. (ps )
  • Aparna Gupta (SCCM).
    Optimum Asset Allocation with Behavior Utilities: An Agenda for Obtaining and Consuming Retirement Funds.
    PhD thesis, SCCM, Stanford College, May 2000.
  • Meredith J. Goldsmith.
    Consecutive Quadratic Programming Methods According to Indefinite Hessian Approximations.
    PhD thesis, Stanford College, March 1999. (ps )
  • Erik Boman (SCCM).
    Infeasibility and Negative Curvature in Optimization.
    PhD thesis, Stanford College, Feb 1999.
  • William Behrman (SCCM).
    A Competent Gradient Flow Way of Unconstrained Optimization.
    PhD thesis, Stanford College, June 1998.

    Share this:
    • custom writing low cost
    Order custom writing

    ads