A general Hilbert space approach to framelets.
A necessity measure optimization approach to linear programming problems with oblique fuzzy vectors
In this paper, a necessity measure optimization model of linear programming problems with fuzzy oblique vectors is discussed. It is shown that the problems are reduced to linear fractional programming problems. Utilizing a special structure of the reduced problem, we propose a solution algorithm based on Bender’s decomposition. A numerical example is given.
A posteriori error estimation for semilinear parabolic optimal control problems with application to model reduction by POD
We consider the following problem of error estimation for the optimal control of nonlinear parabolic partial differential equations: let an arbitrary admissible control function be given. How far is it from the next locally optimal control? Under natural assumptions including a second-order sufficient optimality condition for the (unknown) locally optimal control, we estimate the distance between the two controls. To do this, we need some information on the lowest eigenvalue of the reduced Hessian....
An hp-Discontinuous Galerkin Method for the Optimal Control Problem of Laser Surface Hardening of Steel
In this paper, we discuss an hp-discontinuous Galerkin finite element method (hp-DGFEM) for the laser surface hardening of steel, which is a constrained optimal control problem governed by a system of differential equations, consisting of an ordinary differential equation for austenite formation and a semi-linear parabolic differential equation for temperature evolution. The space discretization of the state variable is done using an hp-DGFEM, time and control discretizations are based on a discontinuous Galerkin...
An hp-Discontinuous Galerkin Method for the Optimal Control Problem of Laser Surface Hardening of Steel
In this paper, we discuss an hp-discontinuous Galerkin finite element method (hp-DGFEM) for the laser surface hardening of steel, which is a constrained optimal control problem governed by a system of differential equations, consisting of an ordinary differential equation for austenite formation and a semi-linear parabolic differential equation for temperature evolution. The space discretization of the state variable is done using an hp-DGFEM, time and control discretizations are based on a discontinuous Galerkin...
Approximation d'équations aux dérivées partielles par des méthodes de décomposition
Bundle-based decomposition : conditions for convergence
Computational aspects of DYNAMICO : a model of trade and development in the world economy
Configuration des lignes d'usinage à boîtiers multibroches : une approche mixte
Ce travail porte sur l'optimisation des lignes d'usinage pour la grande série. Une telle ligne comporte plusieurs postes de travail, chacun étant équipé avec boîtiers multibroches. Un boîtier multibroche exécute plusieurs opérations en parallèle. Lors de la conception en avant-projet, il est nécessaire d'affecter toutes les opérations à des boîtiers et des postes de travail de sorte à minimiser le nombre de postes et de boîtiers utilisés. Pour ce nouveau problème d'équilibrage des lignes de production,...
Decomposition of large-scale stochastic optimal control problems
In this paper, we present an Uzawa-based heuristic that is adapted to certain type of stochastic optimal control problems. More precisely, we consider dynamical systems that can be divided into small-scale subsystems linked through a static almost sure coupling constraint at each time step. This type of problem is common in production/portfolio management where subsystems are, for instance, power units, and one has to supply a stochastic power demand at each time step. We outline the framework...
Lagrangean decomposition for integer programming : theory and applications
Least regret control, virtual control and decomposition methods
Least regret control, virtual control and decomposition methods
"Least regret control" consists in trying to find a control which "optimizes the situation" with the constraint of not making things too worse with respect to a known reference control, in presence of more or less significant perturbations. This notion was introduced in [7]. It is recalled on a simple example (an elliptic system, with distributed control and boundary perturbation) in Section 2. We show that the problem reduces to a standard optimal control problem for augmented state equations. On...
Maximum norm analysis of an overlapping nonmatching grids method for the obstacle problem.
Method of fundamental solutions for biharmonic equation based on Almansi-type decomposition
The aim of this paper is to analyze mathematically the method of fundamental solutions applied to the biharmonic problem. The key idea is to use Almansi-type decomposition of biharmonic functions, which enables us to represent the biharmonic function in terms of two harmonic functions. Based on this decomposition, we prove that an approximate solution exists uniquely and that the approximation error decays exponentially with respect to the number of the singular points. We finally present results...
Optimum beam design via stochastic programming
The purpose of the paper is to discuss the applicability of stochastic programming models and methods to civil engineering design problems. In cooperation with experts in civil engineering, the problem concerning an optimal design of beam dimensions has been chosen. The corresponding mathematical model involves an ODE-type constraint, uncertain parameter related to the material characteristics and multiple criteria. As a~result, a~multi-criteria stochastic nonlinear optimization model is obtained....
Original title unknown
POD a-posteriori error based inexact SQP method for bilinear elliptic optimal control problems
An optimal control problem governed by a bilinear elliptic equation is considered. This problem is solved by the sequential quadratic programming (SQP) method in an infinite-dimensional framework. In each level of this iterative method the solution of linear-quadratic subproblem is computed by a Galerkin projection using proper orthogonal decomposition (POD). Thus, an approximate (inexact) solution of the subproblem is determined. Based on a POD a-posteriori error estimator developed by Tröltzsch...
POD a-posteriori error based inexact SQP method for bilinear elliptic optimal control problems∗
An optimal control problem governed by a bilinear elliptic equation is considered. This problem is solved by the sequential quadratic programming (SQP) method in an infinite-dimensional framework. In each level of this iterative method the solution of linear-quadratic subproblem is computed by a Galerkin projection using proper orthogonal decomposition (POD). Thus, an approximate (inexact) solution of the subproblem is determined. Based on a POD...
Proper orthogonal decomposition for optimality systems
Proper orthogonal decomposition (POD) is a powerful technique for model reduction of non-linear systems. It is based on a Galerkin type discretization with basis elements created from the dynamical system itself. In the context of optimal control this approach may suffer from the fact that the basis elements are computed from a reference trajectory containing features which are quite different from those of the optimally controlled trajectory. A method is proposed which avoids this problem of unmodelled...