Page 1

Displaying 1 – 14 of 14

Showing per page

On convex sets that minimize the average distance

Antoine Lemenant, Edoardo Mainini (2012)

ESAIM: Control, Optimisation and Calculus of Variations

In this paper we study the compact and convex sets K ⊆ Ω ⊆ ℝ2that minimize Ω ( , K ) d + λ 1 Vol ( K ) + λ 2 Per ( K ) ∫ Ω dist ( x ,K ) d x + λ 1 Vol ( K ) + λ 2 Per ( K ) for some constantsλ1 and λ2, that could possibly be zero. We compute in particular the second order derivative of the functional and use it to exclude smooth points of positive curvature for the problem with volume constraint. The problem with perimeter constraint behaves differently since polygons are never minimizers. Finally using a purely geometrical argument from...

Optimal control for a class of compartmental models in cancer chemotherapy

Andrzej Świerniak, Urszula Ledzewicz, Heinz Schättler (2003)

International Journal of Applied Mathematics and Computer Science

We consider a general class of mathematical models P for cancer chemotherapy described as optimal control problems over a fixed horizon with dynamics given by a bilinear system and an objective which is linear in the control. Several two- and three-compartment models considered earlier fall into this class. While a killing agent which is active during cell division constitutes the only control considered in the two-compartment model, Model A, also two three-compartment models, Models B and C, are...

Optimal control problems on parallelizable riemannian manifolds : theory and applications

Ram V. Iyer, Raymond Holsapple, David Doman (2006)

ESAIM: Control, Optimisation and Calculus of Variations

The motivation for this work is the real-time solution of a standard optimal control problem arising in robotics and aerospace applications. For example, the trajectory planning problem for air vehicles is naturally cast as an optimal control problem on the tangent bundle of the Lie Group S E ( 3 ) , which is also a parallelizable riemannian manifold. For an optimal control problem on the tangent bundle of such a manifold, we use frame co-ordinates and obtain first-order necessary conditions employing calculus...

Optimal control problems on parallelizable Riemannian manifolds: theory and applications

Ram V. Iyer, Raymond Holsapple, David Doman (2005)

ESAIM: Control, Optimisation and Calculus of Variations

The motivation for this work is the real-time solution of a standard optimal control problem arising in robotics and aerospace applications. For example, the trajectory planning problem for air vehicles is naturally cast as an optimal control problem on the tangent bundle of the Lie Group SE(3), which is also a parallelizable Riemannian manifold. For an optimal control problem on the tangent bundle of such a manifold, we use frame co-ordinates and obtain first-order necessary conditions...

Optimal design of turbines with an attached mass

Boris P. Belinskiy, C. Maeve McCarthy, Terry J. Walters (2003)

ESAIM: Control, Optimisation and Calculus of Variations

We minimize, with respect to shape, the moment of inertia of a turbine having the given lowest eigenfrequency of the torsional oscillations. The necessary conditions of optimality in conjunction with certain physical parameters admit a unique optimal design.

Optimal design of turbines with an attached mass

Boris P. Belinskiy, C. Maeve McCarthy, Terry J. Walters (2010)

ESAIM: Control, Optimisation and Calculus of Variations

We minimize, with respect to shape, the moment of inertia of a turbine having the given lowest eigenfrequency of the torsional oscillations. The necessary conditions of optimality in conjunction with certain physical parameters admit a unique optimal design.

Optimality Conditions for D.C. Vector Optimization Problems under D.C. Constraints

Gadhi, N., Metrane, A. (2004)

Serdica Mathematical Journal

2000 Mathematics Subject Classification: Primary 90C29; Secondary 49K30.In this paper, we establish necessary optimality conditions and sufficient optimality conditions for D.C. vector optimization problems under D.C. constraints. Under additional conditions, some results of [9] and [15] are also recovered.

Currently displaying 1 – 14 of 14

Page 1