Displaying 21 – 40 of 517

Showing per page

A minimum effort optimal control problem for elliptic PDEs

Christian Clason, Kazufumi Ito, Karl Kunisch (2012)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

This work is concerned with a class of minimum effort problems for partial differential equations, where the control cost is of L∞-type. Since this problem is non-differentiable, a regularized functional is introduced that can be minimized by a superlinearly convergent semi-smooth Newton method. Uniqueness and convergence for the solutions to the regularized problem are addressed, and a continuation strategy based on a model function is proposed. Numerical examples for a convection-diffusion equation...

A minimum effort optimal control problem for elliptic PDEs

Christian Clason, Kazufumi Ito, Karl Kunisch (2012)

ESAIM: Mathematical Modelling and Numerical Analysis

This work is concerned with a class of minimum effort problems for partial differential equations, where the control cost is of L∞-type. Since this problem is non-differentiable, a regularized functional is introduced that can be minimized by a superlinearly convergent semi-smooth Newton method. Uniqueness and convergence for the solutions to the regularized problem are addressed, and a continuation strategy based on a model function is proposed. Numerical examples for a convection-diffusion equation...

A modified filter SQP method as a tool for optimal control of nonlinear systems with spatio-temporal dynamics

Ewaryst Rafajłowicz, Krystyn Styczeń, Wojciech Rafajłowicz (2012)

International Journal of Applied Mathematics and Computer Science

Our aim is to adapt Fletcher's filter approach to solve optimal control problems for systems described by nonlinear Partial Differential Equations (PDEs) with state constraints. To this end, we propose a number of modifications of the filter approach, which are well suited for our purposes. Then, we discuss possible ways of cooperation between the filter method and a PDE solver, and one of them is selected and tested.

A moving mesh fictitious domain approach for shape optimization problems

Raino A.E. Mäkinen, Tuomo Rossi, Jari Toivanen (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

A new numerical method based on fictitious domain methods for shape optimization problems governed by the Poisson equation is proposed. The basic idea is to combine the boundary variation technique, in which the mesh is moving during the optimization, and efficient fictitious domain preconditioning in the solution of the (adjoint) state equations. Neumann boundary value problems are solved using an algebraic fictitious domain method. A mixed formulation based on boundary Lagrange multipliers is...

A necessity measure optimization approach to linear programming problems with oblique fuzzy vectors

Masahiro Inuiguchi (2006)

Kybernetika

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 new method based on least-squares support vector regression for solving optimal control problems

Mitra Bolhassani, Hassan Dana Mazraeh, Kourosh Parand (2024)

Kybernetika

In this paper, a new application of the Least Squares Support Vector Regression (LS-SVR) with Legendre basis functions as mapping functions to a higher dimensional future space is considered for solving optimal control problems. At the final stage of LS-SVR, an optimization problem is formulated and solved using Maple optimization packages. The accuracy of the method are illustrated through numerical examples, including nonlinear optimal control problems. The results demonstrate that the proposed...

A new one-step smoothing newton method for second-order cone programming

Jingyong Tang, Guoping He, Li Dong, Liang Fang (2012)

Applications of Mathematics

In this paper, we present a new one-step smoothing Newton method for solving the second-order cone programming (SOCP). Based on a new smoothing function of the well-known Fischer-Burmeister function, the SOCP is approximated by a family of parameterized smooth equations. Our algorithm solves only one system of linear equations and performs only one Armijo-type line search at each iteration. It can start from an arbitrary initial point and does not require the iterative points to be in the sets...

A new regular multiplier embedding

Gemayqzel Bouza Allende, Jürgen Guddat (2013)

Kybernetika

Embedding approaches can be used for solving non linear programs P. The idea is to define a one-parametric problem such that for some value of the parameter the corresponding problem is equivalent to P. A particular case is the multipliers embedding, where the solutions of the corresponding parametric problem can be interpreted as the points computed by the multipliers method on P. However, in the known cases, either path-following methods can not be applied or the necessary conditions for its convergence...

A penalty method for topology optimization subject to a pointwise state constraint

Samuel Amstutz (2010)

ESAIM: Control, Optimisation and Calculus of Variations

This paper deals with topology optimization of domains subject to a pointwise constraint on the gradient of the state. To realize this constraint, a class of penalty functionals is introduced and the expression of the corresponding topological derivative is obtained for the Laplace equation in two space dimensions. An algorithm based on these concepts is proposed. It is illustrated by some numerical applications.

Currently displaying 21 – 40 of 517