Search

This paper deals with optimal control problems described by higher index DAEs. We introduce a class of problems which can be transformed to index one control problems. For these problems we show in the accompanying paper that, if the solutions to the adjoint equations are well-defined, then the first-order approximations to the functionals defining the problem can be expressed in terms of the adjoint variables. In this paper we show that the solutions to the adjoint equations are essentially bounded measurable functions. Then, based on the first order approximations, we derive the necessary optimality conditions for the considered class of control problems. These conditions do not require the transformation of the DAEs to index-one system; however, higher-index DAEs and their associated adjoint equations have to be solved. [ABSTRACT FROM AUTHOR]

In this paper, we study quasistatic abstract variational inequalities with time-dependent constraints. We prove existence results and present an approximation method valid for nonsmooth constraints. Then, we apply our results to the approximation of the quasistatic evolution of an elastic body in bilateral contact with a rigid foundation. The contact involves viscous friction of the Tresca or Coulomb type.We prove existence results for approximate problems and give a full asymptotic analysis, proving strong or weak convergence results. Our work is motivated by the numerical study in the paper [Delost, M.: Quasistatic Problem with Frictional Contact: Comparison between Numerical Methods and Asymptotic Analysis Related to Semi Discrete and Fully Discrete Approximations. University of Nice, Nice (2007, to appear)] and explains the choice of the approximation made in it. [ABSTRACT FROM AUTHOR]

The paper discusses several versions of the method of shortest residuals, a specific variant of the conjugate gradient algorithm, first introduced by Lemaréchal and Wolfe and discussed by Hestenes in a quadratic case. In the paper we analyze the global convergence of the versions considered. Numerical comparison of these versions of the method of shortest residuals and an implementation of a standard Polak–Ribière conjugate gradient algorithm is also provided. It supports the claim that the method of shortest residuals is a viable technique, competitive to other conjugate gradient algorithms. [ABSTRACT FROM AUTHOR]

The minimization of nonlinearly constrained network flow problems can be performed by using approximate subgradient methods. The idea is to solve this kind of problem by means of primal-dual methods, given that the minimization of nonlinear network flow problems can be done efficiently exploiting the network structure. In this work, it is proposed to solve the dual problem by using ϵ-subgradient methods, as the dual function is estimated by minimizing approximately a Lagrangian function, which includes the side constraints (nonnetwork constraints) and is subject only to the network constraints. Some well-known subgradient methods are modified in order to be used as ϵ-subgradient methods and the convergence properties of these new methods are analyzed. Numerical results appear very promising and effective for this kind of problems. [ABSTRACT FROM AUTHOR]