Displaying similar documents to “Properties of projection and penalty methods for discretized elliptic control problems”

Necessary and sufficient optimality conditions for elliptic control problems with finitely many pointwise state constraints

Eduardo Casas (2007)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

The goal of this paper is to prove the first and second order optimality conditions for some control problems governed by semilinear elliptic equations with pointwise control constraints and finitely many equality and inequality pointwise state constraints. To carry out the analysis we formulate a regularity assumption which is equivalent to the first order optimality conditions. Though the presence of pointwise state constraints leads to a discontinuous adjoint state, we prove that...

On regularization methods for the numerical solution of parabolic control problems with pointwise state constraints

Ira Neitzel, Fredi Tröltzsch (2009)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

In this paper we study Lavrentiev-type regularization concepts for linear-quadratic parabolic control problems with pointwise state constraints. In the first part, we apply classical Lavrentiev regularization to a problem with distributed control, whereas in the second part, a Lavrentiev-type regularization method based on the adjoint operator is applied to boundary control problems with state constraints in the whole domain. The analysis for both classes of control problems is investigated...

Control for the sine-gordon equation

Madalina Petcu, Roger Temam (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

In this article we apply the optimal and the robust control theory to the sine-Gordon equation. In our case the control is given by the boundary conditions and we work in a finite time horizon. We present at the beginning the optimal control problem and we derive a necessary condition of optimality and we continue by formulating a robust control problem for which existence and uniqueness of solutions are derived.

Contents

Czesław Olech, Bronisław Jakubczyk, Jerzy Zabczyk (1985)

Banach Center Publications

Similarity:

Automatically Removing Widows and Orphans with lua-widow-control

Max Chernoff (2022)

Zpravodaj Československého sdružení uživatelů TeXu

Similarity:

The lua-widow-control package, for plain LuaTeX/LuaLaTeX/ConTeXt/OpTeX, removes widows and orphans without any user intervention. Using the power of LuaTeX, it does so without stretching any vertical glue or shortening any pages or columns. Instead, lua-widow-control automatically lengthens a paragraph on a page or column where a widow or orphan would otherwise occur. To use the lua-widow-control package, all that most LaTeX users need do is place in their preamble. No further changes...

Consensus-based impact-time-control guidance law for cooperative attack of multiple missiles

Qing Zhu, Xiaoli Wang, Qianyu Lin (2017)

Kybernetika

Similarity:

In this paper, a new guidance problem with the impact time constraint for cooperative attack of multiple missiles is investigated, which can be applied to salvo attack of anti-ship missiles. It can be used to guide multiple missiles to hit a stationary target simultaneously at a desirable impact time. The considered impact time control problem can be transformed into a range tracking problem. Then the range tracking problem can be viewed a consensus problem of multi-missile systems....

Well-posedness and sliding mode control

Tullio Zolezzi (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

Sliding mode control of ordinary differential equations is considered. A key robustness property, called approximability, is studied from an optimization point of view. It is proved that Tikhonov well-posedness of a suitably defined optimization problem is intimately related to approximability. Making use of this link, new approximability criteria are obtained for nonlinear sliding mode control systems.