• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 87
  • 20
  • 7
  • 5
  • 4
  • 3
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 157
  • 157
  • 56
  • 34
  • 34
  • 33
  • 24
  • 23
  • 20
  • 19
  • 18
  • 18
  • 16
  • 15
  • 15
  • 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.

Resolution of Ties in Parametric Quadratic Programming

Wang, Xianzhi January 2004 (has links)
We consider the convex parametric quadratic programming problem when the end of the parametric interval is caused by a multiplicity of possibilities ("ties"). In such cases, there is no clear way for the proper active set to be determined for the parametric analysis to continue. In this thesis, we show that the proper active set may be determined in general by solving a certain non-parametric quadratic programming problem. We simplify the parametric quadratic programming problem with a parameter both in the linear part of the objective function and in the right-hand side of the constraints to a quadratic programming without a parameter. We break the analysis into three parts. We first study the parametric quadratic programming problem with a parameter only in the linear part of the objective function, and then a parameter only in the right-hand side of the constraints. Each of these special cases is transformed into a quadratic programming problem having no parameters. A similar approach is then applied to the parametric quadratic programming problem having a parameter both in the linear part of the objective function and in the right-hand side of the constraints.

Use of linear quadratic and quadratic programming methods in model-based process control /

Cheng, Chun-Min. January 1986 (has links)
Thesis (Ph. D.)--University of Washington, 1986. / Vita. Bibliography: leaves [164]-168.

Barrier function algorithms for linear and convex quadratic programming

Ben Daya, Mohamed 12 1900 (has links)
No description available.

Algorithms for the solution of the quadratic programming problem

Vankova, Martina January 2004 (has links)
The purpose of this dissertation was to provide a review of the theory of Optimization, in particular quadratic programming, and the algorithms suitable for solving both convex and non-convex quadratic programming problems. Optimization problems arise in a wide variety of fields and many can be effectively modeled with linear equations. However, there are problems for which linear models are not sufficient thus creating a need for non-linear systems. This dissertation includes a literature study of the formal theory necessary for understanding optimization and an investigation of the algorithms available for solving a special class of the non-linear programming problem, namely the quadratic programming problem. It was not the intention of this dissertation to discuss all possible algorithms for solving the quadratic programming problem, therefore certain algorithms for convex and non-convex quadratic programming problems were selected for a detailed discussion in the dissertation. Some of the algorithms were selected arbitrarily, because limited information was available comparing the efficiency of the various algorithms. Algorithms available for solving general non-linear programming problems were also included and briefly discussed as they can be used to solve quadratic programming problems. A number of algorithms were then selected for evaluation, depending on the frequency of use in practice and the availability of software implementing these algorithms. The evaluation included a theoretical and quantitative comparison of the algorithms. The quantitative results were analyzed and discussed and it was shown that the results supported the theoretical comparison. It was also shown that it is difficult to conclude that one algorithm is better than another as the efficiency of an algorithm greatly depends on the size of the problem, the complexity of an algorithm and many other implementation issues. Optimization problems arise continuously in a wide range of fields and thus create the need for effective methods of solving them. This dissertation provides the fundamental theory necessary for the understanding of optimization problems, with particular reference to quadratic programming problems and the algorithms that solve such problems. Keywords: Quadratic Programming, Quadratic Programming Algorithms, Optimization, Non-linear Programming, Convex, Non-convex.

Clock Distribution Network Optimization by Sequential Quadratic Programing

Mekala, Venkata 2010 May 1900 (has links)
Clock mesh is widely used in microprocessor designs for achieving low clock skew and high process variation tolerance. Clock mesh optimization is a very diffcult problem to solve because it has a highly connected structure and requires accurate delay models which are computationally expensive. Existing methods on clock network optimization are either restricted to clock trees, which are easy to be separated into smaller problems, or naive heuristics based on crude delay models. A clock mesh sizing algorithm, which is aimed to minimize total mesh wire area with consideration of clock skew constraints, has been proposed in this research work. This algorithm is a systematic solution search through rigorous Sequential Quadratic Programming (SQP). The SQP is guided by an efficient adjoint sensitivity analysis which has near-SPICE(Simulation Program for Integrated Circuits Emphasis)-level accuracy and faster-than-SPICE speed. Experimental results on various benchmark circuits indicate that this algorithm leads to substantial wire area reduction while maintaining low clock skew in the clock mesh. The reduction in mesh area achieved is about 33%.

Quadratic programming algorithms, anomalies [and] applications.

Boot, John C. G., January 1964 (has links)
Proefschrift--Nederlandsche Economische Hoogeschool, Rotterdam. / "Stellingen": [4] p. inserted.

Framework combining static optimization, dynamic scheduling and decision analysis applicable to complex primary HVAC & R systems /

Jiang, Wei. Reddy, Agami T January 2005 (has links)
Thesis (Ph. D.)--Drexel University, 2005. / Includes abstract and vita. Includes bibliographical references (leaves 192-204).

Cancer treatment optimization

Cha, Kyungduck. January 2008 (has links)
Thesis (Ph. D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2008. / Committee Chair: Lee, Eva K.; Committee Member: Barnes, Earl; Committee Member: Hertel, Nolan E.; Committee Member: Johnson, Ellis; Committee Member: Monteiro, Renato D.C.

Aerodynamic design applying automatic differentiation and using robust variable fidelity optimization

Takemiya, Tetsushi. January 2008 (has links)
Thesis (Ph.D)--Aerospace Engineering, Georgia Institute of Technology, 2009. / Committee Chair: Mavris, Dimitri; Committee Member: Alley, Nicholas; Committee Member: Lakshmi, Sankar; Committee Member: Sriram, Rallabhandi; Committee Member: Stephen, Ruffin. Part of the SMARTech Electronic Thesis and Dissertation Collection.

Quadratic programming algorithms, anomalies [and] applications.

Boot, John C. G., January 1964 (has links)
Proefschrift--Nederlandsche Economische Hoogeschool, Rotterdam. / "Stellingen": [4] p. inserted.

Page generated in 0.1379 seconds