• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 15
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 22
  • 22
  • 10
  • 6
  • 5
  • 5
  • 4
  • 4
  • 3
  • 3
  • 3
  • 3
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Adaptive constraint aggregation for design optimization using adjoint sensitivity analysis.

Poon, Nicholas Ming-Ki. January 2005 (has links)
Thesis (M.A. Sc.)--University of Toronto, 2005.
2

Probabilistic analysis and results of combinatorial problems with military applications

Grundel, Don A. January 2004 (has links)
Thesis (Ph. D.)--University of Florida, 2004. / Title from title page of source document. Document formatted into pages; contains 135 pages. Includes vita. Includes bibliographical references.
3

A reliability-based method for optimization programming problems /

Esteban, Jaime, January 1992 (has links)
Thesis (M.S.)--Virginia Polytechnic Institute and State University, 1992. / Vita. Abstract. Includes bibliographical references (leaves 55-59). Also available via the Internet.
4

Analytical and experimental comparison of deterministic and probabilistic optimization /

Ponslet, Eric, January 1994 (has links)
Thesis (Ph. D.)--Virginia Polytechnic Institute and State University, 1994. / Vita. Abstract. Includes bibliographical references (leaves 111-118). Also available via the Internet.
5

Trajectory-based methods for solving nonlinear and mixed integer nonlinear programming problems

Oliphant, Terry-Leigh January 2016 (has links)
A thesis submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg, in fulfilment of the requirements for the degree of Doctor of Philosophy. Johannesburg, 2015. / I would like to acknowledge a number of people who contributed towards the completion of this thesis. Firstly, I thank my supervisor Professor Montaz Ali for his patience, enthusiasm, guidance and teachings. The skills I have acquired during this process have infiltrated every aspect of my life. I remain forever grateful. Secondly, I would like to say a special thank you to Professor Jan Snyman for his assistance, which contributed immensely towards this thesis. I would also like to thank Professor Dominque Orban for his willingness to assist me for countless hours with the installation of CUTEr, as well as Professor Jose Mario Martinez for his email correspondence. A heartfelt thanks goes out to my family and friends at large, for their prayers, support and faith in me when I had little faith in myself. Thank you also to my colleagues who kept me sane and motivated, as well as all the support staff who played a pivotal roll in this process. Above all, I would like to thank God, without whom none of this would have been possible.
6

Niching strategies for particle swarm optimization

Brits, Riaan. January 2002 (has links)
Thesis (M. Sc.)(Computer Science)--University of Pretoria, 2002. / Includes bibliographical references (p. 130-136).
7

Data dependent systems modeling analysis and optimal control via time series /

Pandit, Sudhakar M. January 1973 (has links)
Thesis--University of Wisconsin-Madison. / Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 479-488).
8

Reducing spacecraft state uncertainty through indirect trajectory optimization

Zimmer, Scott Jason 28 August 2008 (has links)
Not available / text
9

Approximating shortest paths in large networks /

Lorek, David Randolph. January 2005 (has links) (PDF)
Thesis (M.S.)--University of North Carolina at Wilmington, 2005. / Includes bibliographical references (leaves: leaf: 28)
10

ROI: An extensible R Optimization Infrastructure

Theußl, Stefan, Schwendinger, Florian, Hornik, Kurt 01 1900 (has links) (PDF)
Optimization plays an important role in many methods routinely used in statistics, machine learning and data science. Often, implementations of these methods rely on highly specialized optimization algorithms, designed to be only applicable within a specific application. However, in many instances recent advances, in particular in the field of convex optimization, make it possible to conveniently and straightforwardly use modern solvers instead with the advantage of enabling broader usage scenarios and thus promoting reusability. This paper introduces the R Optimization Infrastructure which provides an extensible infrastructure to model linear, quadratic, conic and general nonlinear optimization problems in a consistent way. Furthermore, the infrastructure administers many different solvers, reformulations, problem collections and functions to read and write optimization problems in various formats. / Series: Research Report Series / Department of Statistics and Mathematics

Page generated in 0.1472 seconds