An alternative approach for non-linear optimal control problems based on the method of moments

We propose an alternative method for computing effectively the solution of non-linear, fixed-terminal-time, optimal control problems when they are given in Lagrange, Bolza or Mayer forms. This method works well when the nonlinearities in the control variable can be expressed as polynomials. The essential of this proposal is the transformation of a non-linear, non-convex optimal control problem into an equivalent optimal control problem with linear and convex structure. The method is based on global optimization of polynomials by the method of moments. With this method we can determine either the existence or lacking of minimizers. In addition, we can calculate generalized solutions when the original problem lacks of minimizers. We also present the numerical schemes to solve several examples arising in science and technology.     

On the vector field problem for O(n)/O(1)xO(1)xO(n-2)

We prove new results about the vector field problem on the real flag manifolds O(n)/O(1) x O(1) x O(n - 2). For some infinite families of these manifolds, we completely solve the vector field problem.     

Diagramme polythermique du systeme ternaire H2O—Al(NO3)3—Mg(NO3)2

The solid—liquid equilibria of the ternary system H₂O—Al(NO₃)₃—Mg(NO₃)₂ were studied at –30, –20, –10 and 0°C by using a synthetic method which allows to detemine all the characteristic points of isothermal sections. The stable solid phases which appear are respectively: ice, Al(NO₃)₃·9H₂O, Mg(NO₃)₂·9H₂O and Mg(NO₃)₂·6H₂O. Neither double salts nor mixed crystals are observed in the temperature and composition field studied. Polytherm diagram layout show two invariant transformations correspond with an eutectic point and a peritectic point.This revised version was published online in November 2005 with corrections to the Cover Date.     

Synthesis of a new class of uridine phosphorylase inhibitors

A new series of potent uridine phosphorylase inhibitors have been prepared from barbituric acid. Among them, 1-[(2-hydroxyethoxy)methyl]-5-)(m--benzyloxy)benzylbarbituric acid ( 37 , BBBA) is the most promising having a K_i value of 1.1 ± 0.2 nM with uridine phosphorylase from human liver. The new inhibitors are easily synthesized and are better inhibitors of human uridine phosphorylase than their uracil counterparts.     

GDDP: Generalized Dual Dynamic Programming Theory

This document presents theoretical considerations about the solution of dynamic optimization problems integrating the Benders Theory, the Dynamic Programming approach and the concepts of Control Theory. The so called Generalized Dual Dynamic Programming Theory (GDDP) can be considered as an extension of two previous approaches known as Dual Dynamic Programming (DDP): The first is the work developed by Pereira and Pinto [3–5], which was revised by Velásquez and others [8,9]. The second is the work developed by Read and others [2,6,7].     

Banach-Saks operators on spaces of continuous functions

Summary Let K be a compact Hausdorff space and let E be a Banach space. We denote by C(K, E) the Banach space of all E-valued continuous functions defined on K, endowed with the supremum norm. We study in this paper Banach-Saks operators defined on C(K, E) spaces. We characterize these operators for a large class of compacts K (the scattered ones), or for a large class of Banach spaces E (the superreflexive ones). We also show by some examples that our theorems can not be extended directly.Partially supported by C.A.I.C.Y.T. grant 0338-84. The author wishes to thank Professor F.Bombal for his encouragement.     

The Problem of Capacity Addition in Multi-user Elastic Demand Communication Networks

In this paper we consider some properties on prices under flow control in a network that is to be shared by noncooperative users. Each user is faced with an optimization problem which is formulated as the minimization of its own criterion subject to constraint on the flows of the other users. The operating points of the network are the Nash equilibria of the underlying routing game. Our objective is to study the behavior of prices of all users when the network designer needs to allocate capacities to network links. For parallel links topologies, we show that degradation of the performances such as prices will not take place, as well as the users may find it beneficial to improve their requests     

Approximating Clarke’s subgradients of semismooth functions by divided differences

We show that the algorithm presented in an earlier paper by Studniarski (Numer. Math., 55:685–693, 1989) can be applied, after only a small modification, to approximate numerically Clarke’s subgradients of semismooth functions of two variables. Results of computational testing of this modified algorithm are also reported.