Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 6 (1970), S. 381-409 
    ISSN: 1573-2878
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper considers the problem of extremizing a functionalI which depends on the statex(t), the controlu(t), and the parameter π. The state is ann-vector, the control is anm-vector, and the parameter is ap-vector. At the initial point, the state is prescribed. At the final point, the state and the parameter are required to satisfyq scalar relations. Along the interval of integration, the state, the control, and the parameter are required to satisfyn scalar differential equations. A modified quasilinearization algorithm is developed; its main property is a descent property in the performance indexR, the cumulative error in the constraints and the optimum conditions. Modified quasilinearization differs from ordinary quasilinearization because of the inclusion of a scaling factor (or stepsize) α in the system of variations. The stepsize α is determined by a one-dimensional search so as to ensure the decrease in the performance indexR; this can be achieved through a bisection process starting from α = 1. Convergence is achieved whenR becomes smaller than some preselected value. In order to start the algorithm, some nominal functionsx(t),u(t), π and multipliers λ(t), μ must be chosen. In a real problem, the selection ofx(t),u(t), π can be made on the basis of physical considerations. Concerning λ(t) and μ, no useful guidelines have been available thus far. In this paper, a method for selecting λ(t) and μ optimally is presented: the performance indexR is minimized with respect to λ(t) and μ. Since the functionalR is quadratically dependent on λ(t) and μ, the resulting variational problem is governed by Euler equations and boundary conditions which are linear. Two numerical examples are presented, and it is shown that, if the initial multipliers λ(t) and μ are chosen optimally, modified quasilinearization converges rapidly to the solution. On the other hand, if the initial multipliers are chosen arbitrarily, modified quasilinearization may or may not converge to the solution. From the examples, it is concluded that the beneficial effects associated with the optimal initial choice of the multipliers λ(t) and μ lie primarily in increasing the likelihood of convergence rather than accelerating convergence. However, this optimal choice does not guarantee convergence, since convergence depends on the functional being extremized, the differential constraints, the boundary conditions, and the nominal functionsx(t),u(t), π chosen in order to start the algorithm.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 38 (1982), S. 83-96 
    ISSN: 1573-2878
    Keywords: Numerical methods ; multiple shooting method ; optimal control ; aircraft trajectories ; flight mechanics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Three-dimensional minimum-time 180° turns of a fighter aircraft are computed for several initial velocitiesV 0 and altitudesh 0. It is shown that the optimum turns consist of split -S maneuvers forV 0≦V 10, three-dimensional maneuvers forV 10〈V 0〈V 20, and half-loops forV 0≧V 20, withV 10,V 20 being functions of altitude or thrust/weight ratio.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 12 (1973), S. 285-319 
    ISSN: 1573-2878
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper considers the numerical solution of optimal control problems involving a functionalI subject to differential constraints, a state inequality constraint, and terminal constraints. The problem is to find the statex(t), the controlu(t), and the parameter π so that the functional is minimized, while the constraints are satisfied to a predetermined accuracy. A modified quasilinearization algorithm is developed. Its main property is the descent property in the performance indexR, the cumulative error in the constraints and the optimality conditions. Modified quasilinearization differs from ordinary quasilinearization because of the inclusion of the scaling factor (or stepsize) α in the system of variations. The stepsize is determined by a one-dimensional search on the performance indexR. Since the first variation δR is negative, the decrease inR is guaranteed if α is sufficiently small. Convergence to the solution is achieved whenR becomes smaller than some preselected value. Here, the state inequality constraint is handled in a direct manner. A predetermined number and sequence of subarcs is assumed and, for the time interval for which the trajectory of the system lies on the state boundary, the control is determined so that the state boundary is satisfied. The state boundary and the entrance conditions are assumed to be linear inx and π, and the modified quasilinearization algorithm is constructed in such a way that the state inequality constraint is satisfied at each iteration and along all of the subarcs composing the trajectory. At first glance, the assumed linearity of the state boundary and the entrance conditions appears to be a limitation to the theory. Actually, this is not the case. The reason is that every constrained minimization problem can be brought to the present form through the introduction of additional state variables. In order to start the algorithm, some nominal functionsx(t),u(t), π and nominal multipliers λ(t), ρ(t), σ, μ must be chosen. In a real problem, the selection of the nominal functions can be made on the basis of physical considerations. Concerning the nominal multipliers, no useful guidelines have been available thus far. In this paper, an auxiliary minimization algorithm for selecting the multipliers optimally is presented: the performance indexR is minimized with respect to λ(t), ρ(t), σ, μ. Since the functionalR is quadratically dependent on the multipliers, the resulting variational problem is governed by optimality conditions which are linear and, therefore, can be solved without difficulty. The numerical examples illustrating the theory demonstrate the feasibility as well as the rapidity of convergence of the technique developed in this paper.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    Helvetica Chimica Acta 27 (1944), S. 1648-1669 
    ISSN: 0018-019X
    Keywords: Chemistry ; Organic Chemistry
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: Es wird gezeigt, dass es mit Hilfe des negativ drehenden Antipoden von 1, 1′-Dinaphtyl-2, 2′-dioxy 3, 3′-dicarbonsäure möglich ist, den nicht, natürlichen Antipoden von Leucin [das d(-)-Leucin] neben grossen Mengen des natürlichen Antipoden [l(+)-Leucin] in Substanz nachzuweisen. Die Methode beruht darauf, dass die negativ drehende Säure mit d(-)-Leucin-methylester ein gut krystallisierendes, schwer lösliches Salz bildet, während das Salz mit l(+)-Leucinmethylester leicht löslich ist und nicht krystallisiert. Die Empfindlichkeit des direkten Nachweises liegt, bezogen auf das insgesamt anwesende Leucin, zwischen 0,5 und 0,8%.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...