The determination of direct control algorithms activation moments using a real-time scheduling algorithm
The extended adjoint method
Searching for the optimal partitioning of a domain leads to the use of the adjoint method in topological asymptotic expansions to know the influence of a domain perturbation on a cost function. Our approach works by restricting to local subproblems containing the perturbation and outperforms the adjoint method by providing approximations of higher order. It is a universal tool, easily adapted to different kinds of real problems and does not need the fundamental solution of the problem; furthermore...
The extended adjoint method
Searching for the optimal partitioning of a domain leads to the use of the adjoint method in topological asymptotic expansions to know the influence of a domain perturbation on a cost function. Our approach works by restricting to local subproblems containing the perturbation and outperforms the adjoint method by providing approximations of higher order. It is a universal tool, easily adapted to different kinds of real problems and does not need...
The Gauss center research in multiscale scientific computation.
The gradient projection method for solving an optimal control problem
A gradient method for solving an optimal control problem described by a parabolic equation is considered. The gradient projection method is applied to solve the problem. The convergence of the projection algorithm is investigated.
The labeling method on two-dimensional networks
The Lazy Travelling Salesman Problem in
We study a parameter (σ) dependent relaxation of the Travelling Salesman Problem on . The relaxed problem is reduced to the Travelling Salesman Problem as 0. For increasing σ it is also an ordered clustering algorithm for a set of points in . A dual formulation is introduced, which reduces the problem to a convex optimization, provided the minimizer is in the domain of convexity of the relaxed functional. It is shown that this last condition is generically satisfied, provided σ is large enough. ...
The maximal solution of a restricted subadditive inequality in numerical analysis.
The method of bilinear programming for nonconvex quadratic programming
The Metric Gradient in Normed Linear Spaces.
The Mortar finite element method for Bingham fluids
This paper deals with the flow problem of a viscous plastic fluid in a cylindrical pipe. In order to approximate this problem governed by a variational inequality, we apply the nonconforming mortar finite element method. By using appropriate techniques, we are able to prove the convergence of the method and to obtain the same convergence rate as in the conforming case.
The mortar finite element method for Bingham fluids
This paper deals with the flow problem of a viscous plastic fluid in a cylindrical pipe. In order to approximate this problem governed by a variational inequality, we apply the nonconforming mortar finite element method. By using appropriate techniques, we are able to prove the convergence of the method and to obtain the same convergence rate as in the conforming case.
The Nonlinear Programming Method of Wilson, Han, and Powell with an Augmented Lagrangian Type Line Search Function. Part 1 : Convergence Analysis.
The Nonlinear Programming Method of Wilson, Han, and Powell with an Augmented Lagrangian Type Line Search Function. Part 2 : An Efficient Implementation with Linear Least Squares Subproblems.
The operation of infimal convolution [Book]
The optimization of heat radiation intensity
This article focuses on the problem of calculating the intensity of heat radiation and its optimization across the surface of an aluminium or nickel mould. The inner mould surface is sprinkled with a special PVC powder and the outer mould surface is warmed by infrared heaters located above the mould. In this way artificial leathers are produced in the car industry (e.g., the artificial leather on a car dashboard). The article includes a description of how a mathematical model allows us to calculate the...
The perturbed generalized proximal point algorithm
The problem of data assimilation for soil water movement
The soil water movement model governed by the initial-boundary value problem for a quasilinear 1-D parabolic equation with nonlinear coefficients is considered. The generalized statement of the problem is formulated. The solvability of the problem is proved in a certain class of functional spaces. The data assimilation problem for this model is analysed. The numerical results are presented.
The problem of data assimilation for soil water movement
The soil water movement model governed by the initial-boundary value problem for a quasilinear 1-D parabolic equation with nonlinear coefficients is considered. The generalized statement of the problem is formulated. The solvability of the problem is proved in a certain class of functional spaces. The data assimilation problem for this model is analysed. The numerical results are presented.
The second-order methods in discrete optimal control problems