Conditions d'optimalité du second ordre nécessaires ou suffisantes pour les problèmes de commande optimale avec une contrainte sur l'état et une commande scalaires

This Note deals with optimal control problems with only one control variable and one state constraint, of arbitrary order. We consider the case of finitely many boundary arcs and touch times. We obtain a no-gap theory of second-order conditions, allowing us to characterize second-order quadratic growth. To cite this article: J.F. Bonnans, A. Hermant, C. R. Acad. Sci. Paris, Ser. I 343 (2006).     

Optimization of capacity expansion planning for gas transportation networks

This paper presents techniques for solving the problem of minimizing investment costs on an existing gas transportation network. The goal of this program is to find, first, the optimal location of pipeline segments to be reinforced and, second, the optimal sizes (among a discrete commercial list of diameters) under the constraint of satisfaction of demands with high enough pressure for all users.     

Bestimmung der Dextrose

Ohne Zusammenfassung     

A Shooting Algorithm for Optimal Control Problems with Singular Arcs

In this article, we propose a shooting algorithm for a class of optimal control problems for which all control variables appear linearly. The shooting system has, in the general case, more equations than unknowns and the Gauss–Newton method is used to compute a zero of the shooting function. This shooting algorithm is locally quadratically convergent, if the derivative of the shooting function is one-to-one at the solution. The main result of this paper is to show that the latter holds whenever a sufficient condition for weak optimality is satisfied. We note that this condition is very close to a second order necessary condition. For the case when the shooting system can be reduced to one having the same number of unknowns and equations (square system), we prove that the mentioned sufficient condition guarantees the stability of the optimal solution under small perturbations and the invertibility of the Jacobian matrix of the shooting function associated with the perturbed problem. We present numerical tests that validate our method.     

Mild Synthesis of Amino‐Poly(ethylene glycol)s. Application to Steric Stabilization of Clays

The hydroxyl end groups of poly(ethylene glycol) (PEG) have been transformed easily and quantitatively into amino groups via the Mitsunobu reaction. Phthalimide was alkylated with PEGs and the hydrazinolysis of the resulting phthalimido‐PEGs gave the amino compounds in high yields. Quaternization of the amino groups leads to hydrophilic polymer chains bearing a positive charge on one or two ends, depending on the chosen PEG. Such products can be used to protect sterically, negatively charged particles such as clays.

     

On the choice of the function spaces for some state-constrained control problems

We study a quadratic parabolic control problem with pointwise final state constraints. As the set of admissible states has an empty interior, the existence of Lagrange multipliers cannot be proved directly. We obtain, however some optimality conditions by expressing the fact that among a space of regular perturbations of the optimal control, the null perturbation is optimal. We show that the qualification hypothesis can be effectively checked in some examples and that the information given by the optimality conditions is useful because it allows to get some regularity results for the optimal control.     

Local analysis of Newton-type methods for variational inequalities and nonlinear programming

This paper presents some new results in the theory of Newton-type methods for variational inequalities, and their application to nonlinear programming. A condition of semistability is shown to ensure the quadratic convergence of Newton's method and the superlinear convergence of some quasi-Newton algorithms, provided the sequence defined by the algorithm exists and converges. A partial extension of these results to nonsmooth functions is given. The second part of the paper considers some particular variational inequalities with unknowns (x, ), generalizing optimality systems. Here only the question of superlinear convergence of {x ^k } is considered. Some necessary or sufficient conditions are given. Applied to some quasi-Newton algorithms they allow us to obtain the superlinear convergence of {x ^k }. Application of the previous results to nonlinear programming allows us to strengthen the known results, the main point being a characterization of the superlinear convergence of {x ^k } assuming a weak second-order condition without strict complementarity.