51 
Necessary conditions for a solution of a nonlinear programming problemLee, Linda May January 1973 (has links)
The conditions required for a solution of general nonlinear programming problems of the form
min{f(x): x є X, g(x) ≤ 0, h(x)=0};
where f is called the objective function, g the inequality constraint and. h the equality constraint, are presented in this thesis. The following cases are studied:
(1) X, a finite dimensional space; f, a real valued function; and g and h finite dimensional vector functions.
(2) X, an infinite dimensional space; f, a real valued function; and g and h either finite or infinite dimensional vector functions.
An application of this type of problem to optimal control will be given and the recent developments in this area will be discussed. / Science, Faculty of / Mathematics, Department of / Graduate

52 
A program development facilityDuMont, Mark Aurele Louis January 1974 (has links)
The implementation of a unified facility for program development and maintenance is described. The prototype (named "EightyOne") provides for the entry, editing and compilation of program text within a unified system in which source text is immediately transformed into an intermediate tree structured representation for storage. The implications of the unification of these facilities under this representation are discussed from the viewpoints of user convenience and system efficiency. Technical problems posed by the implementation are also discussed. Finally, some comments are made upon the nature of the user interface to systems of this type. / Science, Faculty of / Computer Science, Department of / Graduate

53 
Application of geometric programming to PID controller tuning with state constraintsCarver, Leonard James January 1976 (has links)
In the thesis, geometric programming is considered as a numerical
optimization technique. The problem of minimizing the integral square error of a system characterized by a second order plant with proportional
integralderivative (PID) controller is investigated. Constraints
are imposed upon the state of the system In order to obtain feasible solutions and conditions that are amenable to the geometric programming technique.
The application of geometric programming requires the use of approximation procedures to eliminate untenable conditions in the objective
and constraint functions. The techniques utilized render solutions that are easily obtainable, usually amounting to solving a set of linear equations and requiring no differentiation of terms. In addition, there is rapid convergence to an optimum. The accuracy of the results is dependent upon the validity of the approximations. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate

54 
Continuous methods for convex programming and convex semidefinite programmingQian, Xun 07 August 2017 (has links)
In this thesis, we study several interior point continuous trajectories for linearly constrained convex programming (CP) and convex semidefinite programming (SDP). The continuous trajectories are characterized as the solution trajectories of corresponding ordinary differential equation (ODE) systems. All our ODE systems are closely related to interior point methods.. First, we propose and analyze three continuous trajectories, which are the solutions of three ODE systems for linearly constrained convex programming. The three ODE systems are formulated based on an variant of the affine scaling direction, the central path, and the affine scaling direction in interior point methods. The resulting solutions of the first two ODE systems are called generalized affine scaling trajectory and generalized central path, respectively. Under some mild conditions, the properties of the continuous trajectories, the optimality and convergence of the continuous trajectories are all obtained. Furthermore, we show that for the example of Gilbert et al. [Math. Program., { 103}, 6394 (2005)], where the central path does not converge, our generalized central path converges to an optimal solution of the same example in the limit.. Then we analyze two primal dual continuous trajectories for convex programming. The two continuous trajectories are derived from the primaldual pathfollowing method and the primaldual affine scaling method, respectively. Theoretical properties of the two interior point continuous trajectories are fully studied. The optimality and convergence of both interior point continuous trajectories are obtained for any interior feasible point under some mild conditions. In particular, with proper choice of some parameters, the convergence for both continuous trajectories does not require the strict complementarity or the analyticity of the objective function.. For convex semidefinite programming, four interior continuous trajectories defined by matrix differential equations are proposed and analyzed. Optimality and convergence of the continuous trajectories are also obtained under some mild conditions. We also propose a strategy to guarantee the optimality of the affine scaling algorithm for convex SDP.

55 
Studies related to the process of program developmentWilliams, Morgan Howard January 1994 (has links)
The submitted work consists of a collection of publications arising from research carried out at Rhodes University (19701980) and at HeriotWatt University (19801992). The theme of this research is the process of program development, i.e. the process of creating a computer program to solve some particular problem. The papers presented cover a number of different topics which relate to this process, viz. (a) Programming methodology programming. (b) Properties of programming languages. aspects of structured. (c) Formal specification of programming languages. (d) Compiler techniques. (e) Declarative programming languages. (f) Program development aids. (g) Automatic program generation. (h) Databases. (i) Algorithms and applications.

56 
Ordinaltheoretic properties of logic programsBagai, Rajiv 19 June 2018 (has links)
The work described in this dissertation is mainly a study of some ordinaltheoretic properties of logic programs that are related to the downward powers of their immediateconsequence functions. The downward powers for any program give rise to an interesting nonincreasing sequence of interpretations, whose point of convergence is called the downward closure ordinal of that program. The last appearance of ground atoms that get eliminated somewhere in this sequence is called their downward order.
While it is wellknown that there is no general procedure that can determine downward orders of atoms in any program, we present some rules for constructing such a procedure for a restricted class of programs.
Another existing result is that for every ordinal up to and including the least nonrecursive ordinal [special characters omitted] there is a logic program having that ordinal as its downward closure ordinal. However, the literature contains only a few examples of programs, constructed in an ad hoc manner, with downward closure ordinal greater than the least transfinite ordinal (ω). We contribute to bridging this wide gap between the abstract and concrete knowledge by showing the connection between some of the existing examples and the wellknown concept of the order of a vertex in a graph. Using this connection and a convenient notation system for ordinals involving ground terms as bases, we construct a family [special characters omitted] of logic programs where [special characters omitted] is the least fixpoint of the function λβ[ωβ] and any member Pα of the family has downward closure ordinal ω + α.
We also present an organization of a general transformation system, in which the objective is to search for transformations on syntax objects that satisfy preestablished semantic constraints. As desired transformations are not always guaranteed to exist, we present necessary and sufficient conditions for their existence. In this framework, we proceed to give transformations on logic programs for the successor and addition operations on their downward closure ordinals. / Graduate

57 
Sufficient conditions and duality in nonsmooth programming problems.January 1984 (has links)
by Yung Wai Lok. / Bibliography: leaves 3637 / Thesis (M.Ph.)Chinese University of Hong Kong, 1984

58 
A dataflow diagram generatorSpecht, Alicia Ellen January 2010 (has links)
Typescript (photocopy). / Digitized by Kansas Correctional Industries / Department: Computer Science.

59 
Multitasking in a user partition with a contour model of processesAllen, Lee January 2010 (has links)
Digitized by Kansas Correctional Industries

60 
Method of lagrange multipliers and the KuhnTucker conditionsGupta, Pramod Kumar January 2010 (has links)
Digitized by Kansas Correctional Industries

Page generated in 0.1257 seconds