Inexact Newton and quasi-Newton methods for the output feedback pole assignment problem

The pole assignment problem (PAP) is a special algebraic inverse eigenvalue problem. In this paper, we present two types of algorithms, namely a quasi-Newton method with line search and some variants of the inexact Newton methods to tackle that problem. For a nonmonotone version of inexact Newton–Kr...

Full description

Saved in:
Bibliographic Details
Published in:Computational and Applied Mathematics 2014-10, Vol.33 (3), p.517-542
Main Authors: Mostafa, El-Sayed M. E., Tawhid, Mohamed A., Elwan, Eman R.
Format: Article
Language:English
Subjects:
Applications of Mathematics
Computational Mathematics and Numerical Analysis
Mathematical Applications in Computer Science
Mathematical Applications in the Physical Sciences
Mathematics
Mathematics and Statistics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The pole assignment problem (PAP) is a special algebraic inverse eigenvalue problem. In this paper, we present two types of algorithms, namely a quasi-Newton method with line search and some variants of the inexact Newton methods to tackle that problem. For a nonmonotone version of inexact Newton–Krylov method, we give local convergence under the assumptions of semismoothness and B D -regularity at the solution and global convergence under a nonmonotonic backtracking strategy. For a quasi-Newton method with line search, under suitable assumptions, we show local Q-superlinear convergence. Also, we consider a proximal point quasi-Newton algorithm for solving PAP. Moreover, we modify these methods to tackle the PAP where the corresponding control system is with time delay. Numerical results illustrate the performance of the proposed methods.
ISSN:0101-8205
1807-0302
DOI:10.1007/s40314-013-0078-7