Constrained optimization and analytic spectral factorization

Mikhail Alexander Iakoubovski, University of Rhode Island

Abstract

Let G be function of eiq , 0 ≤q≤2p , and z∈CN , that takes m x m nonnegative matrix values and such that Geiq,z =Ge-iq,z&d1; for all q∈&sqbl0;0,2p ) and all z∈C . Denote by AN the space of N-vector valued functions continuous on the closed unit disc in C and analytic inside the disc whose Taylor series expansion about 0 has real coefficients. We consider the following problem: minimizesup q∥Ge iq,feiq ∥ m×m CONSTRAINED -OPT overf∈E where E is a subset of AN that may depend on given continuous N-vector valued functions Gl eiq whose entries have real Fourier coefficients, on given continuous scalar valued functions dleiq with real Fourier coefficients, and on given real constants cl. The set E we consider takes one of the following forms: 1E =feAN :&smallint;0

    2p
feiq Gl teiq dq2p =cl,1≤l≤n 1; 2E =feA N:&smallint; 0
    2p
f eiq tGl eiq dq2p =cl,1≤l≤n 1,and &smallint;0
    2p
fe iq tGl eiq dq2p≥ cl,n1 +1≤l≤n1+n2 ; 3E =feAN :f eiq tGj eiq =djeiq forall q∈0,2p andallj, 1≤j≤n1 We establish optimality conditions for each of these three cases that must be satisfied by a solution of the (CONSTRAINED-OPT) problem. These optimality conditions can be used for finding good candidates to solutions of the (CONSTRAINED-OPT), and we discuss algorithms for finding such candidates for E as in (1) and (2). Numerical examples are presented. ^ We also consider the problem of finding a spectral factorization of a given, possibly low rank, positive semidefinite matrix valued function on the unit circle of the complex plane. We derive operator equations that must be satisfied by solutions to the spectral factorization problem for either the low or the full rank cases. The equations we derive can be solved numerically using Newton's method. We prove that sufficient conditions for local quadratic convergence of the Newton's method are satisfied. Numerical examples are given. ^ Finally, we develop an implementation of a high level algorithm of Peller-Young for finding superoptimal approximants to a given matrix valued continuous function. Our implementation uses spectral factorization as well as other tools that we developed for this purpose. Also a numerical example is presented. ^

Subject Area

Mathematics

Recommended Citation

Mikhail Alexander Iakoubovski, "Constrained optimization and analytic spectral factorization" (1999). Dissertations and Master's Theses (Campus Access). Paper AAI9945205.
http://digitalcommons.uri.edu/dissertations/AAI9945205

Share

COinS