Globally convergent algorithms for robust pole assignment by state feedback

DOI10.1109/9.539425zbMath0884.93030OpenAlexW2160272666MaRDI QIDQ5689350

André L. Tits, Ya-Guang Yang

Publication date: 6 January 1997

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1903/5598

zbMATH Keywords

convergencecomputational methodeigenstructure assignmentrobust pole assignmentclosed-loop eigenvector matrixKNV algorithm

Mathematics Subject Classification ID

Related Items (16)

Pole assignment via the Schur form ⋮ Feedback norm minimisation with regional pole placement ⋮ A polynomial arc-search interior-point algorithm for linear programming ⋮ Arbitrary pole placement with the extended Kautsky–Nichols–van Dooren parametric form ⋮ A robust BFGS algorithm for unconstrained nonlinear optimization problems ⋮ Solution to sylvester equation associated to linear descriptor systems ⋮ A unified method for optimal arbitrary pole placement ⋮ Pole assignment for linear and quadratic systems with time‐delay in control ⋮ Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming ⋮ Singular \(\mathcal {H}_2\)-optimization problems for discrete-time systems ⋮ Unified gradient approach to performance optimization under a pole assignment constraint. ⋮ Multiobjective controller synthesis via eigenstructure assignment with state feedback ⋮ Systematic Formulation of Model Uncertainties and Robust Control in Smart Structures Using H ∞ and μ-Analysis ⋮ Pole placement parameterisation for full-state feedback with minimal dimensionality and range ⋮ Numerical methods in control ⋮ A modified Schur method for robust pole assignment in state feedback control

Uses Software

• mctoolbox

This page was built for publication: Globally convergent algorithms for robust pole assignment by state feedback