2,840 research outputs found
Numerical Methods for Mixed-Integer Optimal Control with Combinatorial Constraints
This thesis is concerned with numerical methods for Mixed-Integer Optimal Control Problems with Combinatorial Constraints. We establish an approximation theorem
relating a Mixed-Integer Optimal Control Problem with Combinatorial Constraints to a continuous relaxed convexified Optimal Control Problems with Vanishing Constraints that provides the basis for numerical computations. We develop a a Vanishing-
Constraint respecting rounding algorithm to exploit this correspondence computationally.
Direct Discretization of the Optimal Control Problem with Vanishing Constraints yield a subclass of Mathematical Programs with Equilibrium Constraints. Mathematical Programs with Equilibrium Constraint constitute a class of challenging problems due to their inherent non-convexity and non-smoothness. We develop an active-set
algorithm for Mathematical Programs with Equilibrium Constraints and prove global convergence to Bouligand stationary points of this algorithm under suitable technical conditions.
For efficient computation of Newton-type steps of Optimal Control Problems, we establish the Generalized Lanczos Method for trust region problems in a Hilbert space
context. To ensure real-time feasibility in Online Optimal Control Applications with tracking-type Lagrangian objective, we develop a GauĂź-Newton preconditioner for
the iterative solution method of the trust region problem.
We implement the proposed methods and demonstrate their applicability and efficacy on several benchmark problems
Solving rank-constrained semidefinite programs in exact arithmetic
We consider the problem of minimizing a linear function over an affine
section of the cone of positive semidefinite matrices, with the additional
constraint that the feasible matrix has prescribed rank. When the rank
constraint is active, this is a non-convex optimization problem, otherwise it
is a semidefinite program. Both find numerous applications especially in
systems control theory and combinatorial optimization, but even in more general
contexts such as polynomial optimization or real algebra. While numerical
algorithms exist for solving this problem, such as interior-point or
Newton-like algorithms, in this paper we propose an approach based on symbolic
computation. We design an exact algorithm for solving rank-constrained
semidefinite programs, whose complexity is essentially quadratic on natural
degree bounds associated to the given optimization problem: for subfamilies of
the problem where the size of the feasible matrix is fixed, the complexity is
polynomial in the number of variables. The algorithm works under assumptions on
the input data: we prove that these assumptions are generically satisfied. We
also implement it in Maple and discuss practical experiments.Comment: Published at ISSAC 2016. Extended version submitted to the Journal of
Symbolic Computatio
The Physical Role of Gravitational and Gauge Degrees of Freedom in General Relativity - I: Dynamical Synchronization and Generalized Inertial Effects
This is the first of a couple of papers in which, by exploiting the
capabilities of the Hamiltonian approach to general relativity, we get a number
of technical achievements that are instrumental both for a disclosure of
\emph{new} results concerning specific issues, and for new insights about
\emph{old} foundational problems of the theory. The first paper includes: 1) a
critical analysis of the various concepts of symmetry related to the
Einstein-Hilbert Lagrangian viewpoint on the one hand, and to the Hamiltonian
viewpoint, on the other. This analysis leads, in particular, to a
re-interpretation of {\it active} diffeomorphisms as {\it passive and
metric-dependent} dynamical symmetries of Einstein's equations, a
re-interpretation which enables to disclose the (nearly unknown) connection of
a subgroup of them to Hamiltonian gauge transformations {\it on-shell}; 2) a
re-visitation of the canonical reduction of the ADM formulation of general
relativity, with particular emphasis on the geometro-dynamical effects of the
gauge-fixing procedure, which amounts to the definition of a \emph{global
(non-inertial) space-time laboratory}. This analysis discloses the peculiar
\emph{dynamical nature} that the traditional definition of distant simultaneity
and clock-synchronization assume in general relativity, as well as the {\it
gauge relatedness} of the "conventions" which generalize the classical
Einstein's convention.Comment: 45 pages, Revtex4, some refinements adde
Numerical Solution of Optimal Control Problems with Explicit and Implicit Switches
This dissertation deals with the efficient numerical solution of switched optimal control problems whose dynamics may coincidentally be affected by both explicit and implicit switches. A framework is being developed for this purpose, in which both problem classes are uniformly converted into a mixed–integer optimal control problem with combinatorial constraints. Recent research results relate this problem class to a continuous optimal control problem with vanishing constraints, which in turn represents a considerable subclass of an optimal control problem with equilibrium constraints. In this thesis, this connection forms the foundation for a numerical treatment.
We employ numerical algorithms that are based on a direct collocation approach and require, in particular, a highly accurate determination of the switching structure of the original problem. Due to the fact that the switching structure is a priori unknown in general, our approach aims to identify it successively. During this process, a sequence of nonlinear programs, which are derived by applying discretization schemes to optimal control problems, is solved approximatively. After each iteration, the discretization grid is updated according to the currently estimated switching structure.
Besides a precise determination of the switching structure, it is of central importance to estimate the global error that occurs when optimal control problems are solved numerically. Again, we focus on certain direct collocation discretization schemes and analyze error contributions of individual discretization intervals. For this purpose, we exploit a relationship between discrete adjoints and the Lagrange multipliers associated with those nonlinear programs that arise from the collocation transcription process. This relationship can be derived with the help of a functional analytic framework and by interrelating collocation methods and
Petrov–Galerkin finite element methods. In analogy to the dual-weighted residual methodology for Galerkin methods, which is well–known in the partial differential equation community, we then derive goal–oriented global error estimators. Based on those error estimators, we present mesh refinement strategies that allow for an equilibration and an efficient reduction of the global error. In doing so we note that the grid adaption processes with respect to both switching structure detection and global error reduction get along with each other. This allows us to distill an iterative solution framework.
Usually, individual state and control components have the same polynomial degree if they originate from a collocation discretization scheme. Due to the special role which some control components have in the proposed solution framework it is desirable to allow varying polynomial degrees. This results in implementation problems, which can be solved by means of clever structure exploitation techniques and a suitable permutation of variables and equations. The resulting algorithm was developed in parallel to this work and implemented in a software package.
The presented methods are implemented and evaluated on the basis of several benchmark problems. Furthermore, their applicability and efficiency is demonstrated.
With regard to a future embedding of the described methods in an online optimal control context and the associated real-time requirements, an extension of the well–known multi–level iteration schemes is proposed. This approach is based on the trapezoidal rule and, compared to a full evaluation of the involved Jacobians, it significantly reduces the computational costs in case of sparse data matrices
Dual methods and approximation concepts in structural synthesis
Approximation concepts and dual method algorithms are combined to create a method for minimum weight design of structural systems. Approximation concepts convert the basic mathematical programming statement of the structural synthesis problem into a sequence of explicit primal problems of separable form. These problems are solved by constructing explicit dual functions, which are maximized subject to nonnegativity constraints on the dual variables. It is shown that the joining together of approximation concepts and dual methods can be viewed as a generalized optimality criteria approach. The dual method is successfully extended to deal with pure discrete and mixed continuous-discrete design variable problems. The power of the method presented is illustrated with numerical results for example problems, including a metallic swept wing and a thin delta wing with fiber composite skins
- …