Optimization techniques for solving elliptic control problems with control and state constraints. Part 2: Distributed control

Helmut Maurer, Hans Mittelmann

Research output: Contribution to journalArticlepeer-review

27 Scopus citations

Abstract

Part 2 continues the study of optimization techniques for elliptic control problems subject to control and state constraints and is devoted to distributed control. Boundary conditions are of mixed Dirichlet and Neumann type. Necessary conditions of optimality are formally stated in form of a local Pontryagin minimum principle. By introducing suitable discretization schemes, the control problem is transcribed into a nonlinear programming problem. The problems are formulated as AMPL (R. Fourer, D.M. Gay, and B.W. Kernighan, "AMPL: A modeling Language for Mathematical Programming", Duxbury Press, Brooks-Cole Publishing Company, 1993) scripts and several optimization codes are applied. In particular, it is shown that a recently developed interior point method is able to solve theses problems even for high discretizations. Several numerical examples with Dirichlet and Neumann boundary conditions are provided that illustrate the performance of the algorithm for different types of controls including bang-bang controls. The necessary conditions of optimality of checked numerically in the presence of active control and state constraints.

Original languageEnglish (US)
Pages (from-to)141-160
Number of pages20
JournalComputational Optimization and Applications
Volume18
Issue number2
DOIs
StatePublished - Feb 2001

Keywords

  • Control and state constraints
  • Discretization techniques
  • Distributed control
  • Elliptic control problems
  • NLP-methods

ASJC Scopus subject areas

  • Control and Optimization
  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Optimization techniques for solving elliptic control problems with control and state constraints. Part 2: Distributed control'. Together they form a unique fingerprint.

Cite this