• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 6769
  • 2451
  • 1001
  • 805
  • 777
  • 234
  • 168
  • 119
  • 83
  • 79
  • 70
  • 63
  • 54
  • 52
  • 50
  • Tagged with
  • 15002
  • 2422
  • 1971
  • 1814
  • 1642
  • 1528
  • 1381
  • 1327
  • 1284
  • 1252
  • 1220
  • 1114
  • 972
  • 928
  • 926
  • 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.
741

Two Affine Scaling Methods for Solving Optimization Problems Regularized with an L1-norm

Li, Zhirong January 2010 (has links)
In finance, the implied volatility surface is plotted against strike price and time to maturity. The shape of this volatility surface can be identified by fitting the model to what is actually observed in the market. The metric that is used to measure the discrepancy between the model and the market is usually defined by a mean squares of error of the model prices to the market prices. A regularization term can be added to this error metric to make the solution possess some desired properties. The discrepancy that we want to minimize is usually a highly nonlinear function of a set of model parameters with the regularization term. Typically monotonic decreasing algorithm is adopted to solve this minimization problem. Steepest descent or Newton type algorithms are two iterative methods but they are local, i.e., they use derivative information around the current iterate to find the next iterate. In order to ensure convergence, line search and trust region methods are two widely used globalization techniques. Motivated by the simplicity of Barzilai-Borwein method and the convergence properties brought by globalization techniques, we propose a new Scaled Gradient (SG) method for minimizing a differentiable function plus an L1-norm. This non-monotone iterative method only requires gradient information and safeguarded Barzilai-Borwein steplength is used in each iteration. An adaptive line search with the Armijo-type condition check is performed in each iteration to ensure convergence. Coleman, Li and Wang proposed another trust region approach in solving the same problem. We give a theoretical proof of the convergence of their algorithm. The objective of this thesis is to numerically investigate the performance of the SG method and establish global and local convergence properties of Coleman, Li and Wang’s trust region method proposed in [26]. Some future research directions are also given at the end of this thesis.
742

Numerical Shape Optimization of Airfoils With Practical Aerodynamic Design Requirements

Buckley, Howard 05 January 2010 (has links)
Practical aerodynamic shape design problems must balance performance optimization over a range of on-design operating conditions with constraint satisfaction at off-design operating conditions. A multipoint optimization formulation can be used to represent on-design and off-design conditions with corresponding objective or constraint functions. Two methods are presented for obtaining optimal airfoil designs that satisfy all design objectives and constraints. The first method uses an unconstrained optimization algorithm where optimal design is achieved by minimizing a weighted sum of objective functions at each of the conditions. To address competing design objectives between on-design and off-design conditions, an automated procedure is used to weight off-design objective functions to limit their influence on the overall optimization. The second method uses the constrained optimization algorithm SNOPT, allowing aerodynamic constraints imposed at off-design conditions to be treated explicitly. Both methods are applied to the design of an airfoil for a hypothetical aircraft, which is formulated as an 18-point multipoint optimization.
743

Numerical Shape Optimization of Airfoils With Practical Aerodynamic Design Requirements

Buckley, Howard 05 January 2010 (has links)
Practical aerodynamic shape design problems must balance performance optimization over a range of on-design operating conditions with constraint satisfaction at off-design operating conditions. A multipoint optimization formulation can be used to represent on-design and off-design conditions with corresponding objective or constraint functions. Two methods are presented for obtaining optimal airfoil designs that satisfy all design objectives and constraints. The first method uses an unconstrained optimization algorithm where optimal design is achieved by minimizing a weighted sum of objective functions at each of the conditions. To address competing design objectives between on-design and off-design conditions, an automated procedure is used to weight off-design objective functions to limit their influence on the overall optimization. The second method uses the constrained optimization algorithm SNOPT, allowing aerodynamic constraints imposed at off-design conditions to be treated explicitly. Both methods are applied to the design of an airfoil for a hypothetical aircraft, which is formulated as an 18-point multipoint optimization.
744

Shape Optimization and Modular Discretization for the Development of a Morphing Wingtip

Morley, Joshua 22 November 2012 (has links)
Better knowledge in the areas of aerodynamics and optimization has allowed designers to develop efficient wingtip structures in recent years. However, the requirements faced by wingtip devices can be considerably different amongst an aircraft’s flight regimes. Traditional static wingtip devices are then a compromise between conflicting requirements, resulting in less than optimal performance within each regime. Alternatively, a morphing wingtip can reconfigure leading to improved performance over a range of dissimilar flight conditions. Developed within this thesis, is a modular morphing wingtip concept that centers on the use of variable geometry truss mechanisms to permit morphing. A conceptual design framework is established to aid in the development of the concept. The framework uses a metaheuristic optimization procedure to determine optimal continuous wingtip configurations. The configurations are then discretized for the modular concept. The functionality of the framework is demonstrated through a design study on a hypothetical wing/winglet within the thesis.
745

Shortest paths and multicommodity network flows

Wang, I-Lin 05 1900 (has links)
No description available.
746

Models and procedures for the pick-up and delivery problem

Kirca, Omer 12 1900 (has links)
No description available.
747

O(n) planar network shortest path algorithm

Hong, Chyi-Fu 05 1900 (has links)
No description available.
748

Solving linear programs using primal-dual subproblem simplex method and quasi-explicit matrices

Hu, Jing 08 1900 (has links)
No description available.
749

Geometrical heuristics for the traveling salesman problem

Cotton, Richard V. 08 1900 (has links)
No description available.
750

Optimal quantities for hospital supply groupings

Bramblett, Richard Massey 12 1900 (has links)
No description available.

Page generated in 0.0452 seconds