Minimax optimal control problems. Numerical analysis of the finite horizon case
Minimax optimal control problems. Numerical analysis of the finite horizon case
In this paper we consider the numerical computation of the optimal cost function associated to the problem that consists in finding the minimum of the maximum of a scalar functional on a trajectory. We present an approximation method for the numerical solution which employs both discretization on time and on spatial variables. In this way, we obtain a fully discrete problem that has unique solution. We give an optimal estimate for the error between the approximated solution and the optimal cost function...
Minimisation d'une fonction convexe séparable avec contraintes de rapport entre les variables
Minimización global de un polinomio en la recta real.
En este artículo presentamos y probamos numéricamente un nuevo algoritmo para la minimización global de un polinomio de grado par. El algoritmo está basado en la simple idea de trasladar verticalmente el grafo del polinomio hasta que el eje OX sea tangente al grafo del polinomio trasladado. En esta privilegiada posición, cualquier raíz real del polinomio trasladado es un mínimo global del polinomio original.
Minimization of a convex quadratic function subject to separable conical constraints in granular dynamics
The numerical solution of granular dynamics problems with Coulomb friction leads to the problem of minimizing a convex quadratic function with semidefinite Hessian subject to a separable conical constraints. In this paper, we are interested in the numerical solution of this problem. We suggest a modification of an active-set optimal quadratic programming algorithm. The number of projection steps is decreased by using a projected Barzilai-Borwein method. In the numerical experiment, we compare our...
Minimization of Extended Quadratic Functions.
Mise à jour de la métrique dans les méthodes de quasi-Newton réduites en optimisation avec contraintes d'égalité
Mixed formulation of elliptic variational inequalities and its approximation
The approximation of a mixed formulation of elliptic variational inequalities is studied. Mixed formulation is defined as the problem of finding a saddle-point of a properly chosen Lagrangian on a certain convex set . Sufficient conditions, guaranteeing the convergence of approximate solutions are studied. Abstract results are applied to concrete examples.
Mixed formulations for a class of variational inequalities
A general setting is proposed for the mixed finite element approximations of elliptic differential problems involving a unilateral boundary condition. The treatment covers the Signorini problem as well as the unilateral contact problem with or without friction. Existence, uniqueness for both the continuous and the discrete problem as well as error estimates are established in a general framework. As an application, the approximation of the Signorini problem by the lowest order mixed finite element...
Mixed formulations for a class of variational inequalities
A general setting is proposed for the mixed finite element approximations of elliptic differential problems involving a unilateral boundary condition. The treatment covers the Signorini problem as well as the unilateral contact problem with or without friction. Existence, uniqueness for both the continuous and the discrete problem as well as error estimates are established in a general framework. As an application, the approximation of the Signorini problem by the lowest order mixed finite element...
Modélisation et optimisation numérique pour la reconstruction d'un polyèdre à partir de son image gaussienne généralisée
Modelling and control in pseudoplate problem with discontinuous thickness
This paper concerns an obstacle control problem for an elastic (homogeneous) and isotropic) pseudoplate. The state problem is modelled by a coercive variational inequality, where control variable enters the coefficients of the linear operator. Here, the role of control variable is played by the thickness of the pseudoplate which need not belong to the set of continuous functions. Since in general problems of control in coefficients have no optimal solution, a class of the extended optimal control...
Modifications of the limited-memory BFGS method based on the idea of conjugate directions
Simple modifications of the limited-memory BFGS method (L-BFGS) for large scale unconstrained optimization are considered, which consist in corrections of the used difference vectors (derived from the idea of conjugate directions), utilizing information from the preceding iteration. For quadratic objective functions, the improvement of convergence is the best one in some sense and all stored difference vectors are conjugate for unit stepsizes. The algorithm is globally convergent for convex sufficiently...
Modified golden ratio algorithms for pseudomonotone equilibrium problems and variational inequalities
We propose a modification of the golden ratio algorithm for solving pseudomonotone equilibrium problems with a Lipschitz-type condition in Hilbert spaces. A new non-monotone stepsize rule is used in the method. Without such an additional condition, the theorem of weak convergence is proved. Furthermore, with strongly pseudomonotone condition, the $R$-linear convergence rate of the method is established. The results obtained are applied to a variational inequality problem, and the convergence rate...
Multigrid method for in three dimensions.
Multiple objective optimization of hydro-thermal systems using Ritz's method.