Related papers: An Invariant Set Approach for Optimization on Inte…
In this paper, we propose an approach for computing invariant sets of discrete-time nonlinear systems by lifting the nonlinear dynamics into a higher dimensional linear model. In particular, we focus on the \emph{maximal admissible…
Tools of the intrinsic analysis on manifolds, helpful in solving the invariant inverse problem of the calculus of variations are being presented comprising a combined approach which consists in the simultaneous imposition of symmetry…
This paper develops numerical methods for optimal control of mechanical systems in the Lagrangian setting. It extends the theory of discrete mechanics to enable the solutions of optimal control problems through the discretization of…
We consider the problem of computing the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints that admit quadratic relaxations. These non-convex constraints include semialgebraic sets and other…
This article establishes the foundation for a new theory of invariant/integral manifolds for non-autonomous dynamical systems. Current rigorous support for dimensional reduction modelling of slow-fast systems is limited by the rare events…
Constrained Optimization solution algorithms are restricted to point based solutions. In practice, single or multiple objectives must be satisfied, wherein both the objective function and constraints can be non-convex resulting in multiple…
In this paper, we study a method for finding robust solutions to multiobjective optimization problems under uncertainty. We follow the set-based minmax approach for handling the uncertainties which leads to a certain set optimization…
Lifting methods allow to transform hard variational problems such as segmentation and optical flow estimation into convex problems in a suitable higher-dimensional space. The lifted models can then be efficiently solved to a global optimum,…
This note considers the maximal positively invariant set for polynomial discrete time dynamics subject to constraints specified by a basic semialgebraic set. The note utilizes a relatively direct, but apparently overlooked, fact stating…
We develop a geometric version of the inverse problem of the calculus of variations for discrete mechanics and constrained discrete mechanics. The geometric approach consists of using suitable Lagrangian and isotropic submanifolds. We also…
We characterize the maximum controlled invariant (MCI) set for discrete- as well as continuous-time nonlinear dynamical systems as the solution of an infinite-dimensional linear programming problem. For systems with polynomial dynamics and…
In this paper, we consider the problem of invariant set computation for black-box switched linear systems using merely a finite set of observations of system trajectories. In particular, this paper focuses on polyhedral invariant sets. We…
Invariant manifolds are important sets arising in the stability theory of dynamical systems. In this article, we take a brief review of invariant sets. We provide some results regarding the existence of invariant lines and parabolas in…
In practice, optimization tasks have some structure that allows developing new algorithms for every problem with faster convergence rates. Using the structure of optimization tasks, we can propose algorithms with more optimistic convergence…
Optimization plays an important role in solving many inverse problems. Indeed, the task of inversion often either involves or is fully cast as a solution of an optimization problem. In this light, the mere non-linear, non-convex, and…
We prove for the first time that, if a linear inverse problem exhibits a group symmetry structure, gradient-based optimizers can be designed to exploit this structure for faster convergence rates. This theoretical finding demonstrates the…
A new framework for adaptive regulation to invariant sets is proposed. Reaching the target dynamics (invariant set) is to be ensured by state feedback while adaptation to parametric uncertainties is provided by additional adaptation…
Various versions of the Dynamical Systems Method (DSM) are proposed for solving linear ill-posed problems with bounded and unbounded operators. Convergence of the proposed methods is proved. Some new results concerning discrepancy principle…
This paper aims at reviewing nonlinear methods for model order reduction of structures with geometric nonlinearity, with a special emphasis on the techniques based on invariant manifold theory. Nonlinear methods differ from linear based…
In this paper, we generalize the chance optimization problems and introduce constrained volume optimization where enables us to obtain convex formulation for challenging problems in systems and control. We show that many different problems…