Related papers: Robust pole placement with Moore's algorithm
Robustness of linear systems with constant coefficients is considered. There exist methods and tools for analyzing the stability of systems with random or deterministic uncertainties. At the same time, there are no approaches for the…
Robust principal component analysis is an important representative method in data analysis. It is usually viewed as an optimization problem involving the rank and $\ell_0$-norm of matrices. In this paper, we study the rank and $\ell_0$…
Randomized iterative methods have gained recent interest in machine learning and signal processing for solving large-scale linear systems. One such example is the randomized Douglas-Rachford (RDR) method, which updates the iterate by…
A reinforcement algorithm solves a classical optimization problem by introducing a feedback to the system which slowly changes the energy landscape and converges the algorithm to an optimal solution in the configuration space. Here, we use…
In this paper, we build on recent work using a mathematical programming approach for incremental state update in analysis of non-linear mechanics models. In particular, we consider quasi-static analysis of continuum problems in the…
We consider problems with multiple linear objectives and linear constraints and use Adjustable Robust Optimization and Polynomial Optimization as tools to approximate the Pareto set with polynomials of arbitrarily large degree. The main…
We discuss a definition of robust dominant eigenvector of a family of stochastic matrices. Our focus is on application to ranking problems, where the proposed approach can be seen as a robust alternative to the standard PageRank technique.…
This paper introduces an effective memetic algorithm for the linear ordering problem with cumulative costs. The proposed algorithm combines an order-based recombination operator with an improved forward-backward local search procedure and…
The techniques and analysis presented in this thesis provide new methods to solve optimization problems posed on Riemannian manifolds. These methods are applied to the subspace tracking problem found in adaptive signal processing and…
The output of physical systems is often accessible by measurements such as the 3D position of a robotic arm actuated by many actuators or the speckle patterns formed by shining the spot of a laser pointer on a wall. The selection of the…
The stable allocation problem is one of the broadest extensions of the well-known stable marriage problem. In an allocation problem, edges of a bipartite graph have capacities and vertices have quotas to fill. Here we investigate the case…
We study and derive algorithms for nonlinear eigenvalue problems, where the system matrix depends on the eigenvector, or several eigenvectors (or their corresponding invariant subspace). The algorithms are derived from an implicit…
This work aims to solve a stochastic nonconvex nonsmooth composite optimization problem. Previous works on composite optimization problem requires the major part to satisfy Lipschitz smoothness or some relaxed smoothness conditions, which…
The paper presents a distinctive and straightforward technique for stabilization of multi-variable systems. The idea is to decouple the system state matrix depending on different inputs and outputs. Refined special canonical transformations…
Several heuristic procedures to estimate the rotor position of permanent magnet synchronous motors (PMSM) via signal injection have been reported in the literature. Using averaging theory, a framework to analyse such schemes has been…
This article presents a generic method to solve 2D multi-objective placement problem for free-form components. The proposed method is a relaxed placement technique combined with an hybrid algorithm based on a genetic algorithm and a…
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by parametrized polynomial matrix inequalities (PMI). These…
Motivated by a use case in theoretical hadron physics, we revisit an application of a pole-sum fit to dressing functions of a confined quark propagator. More precisely, we investigate approaches to determine the number and positions of the…
We consider the problem of performing ranging measurements between a source and multiple receivers efficiently and accurately, as required by distance-based wireless localization systems. To this end, a new multipoint ranging algorithm is…
This paper describes a node relocation algorithm based on nonlinear optimization which delivers excellent results for both unstructured and structured plane triangle meshes over convex as well as non-convex domains with high curvature. The…