This note modifies a previous algorithm for solving a certain convex optimization problem, introduced by Byrnes, Georgiou, and Lindquist, to determine any Nevanlinna-Pick interpolant satisfying degree constraint. The modified algorithm is based on a continuation method with predictor-corrector steps and it turns out to be quite efficient and numerically robust.
No takes yet. Share an insight, caveat, or question.
Ryozo Nagamune (2003) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: