Computation of symmetric positive definite Toeplitz matrices by the hybrid steepest descent method

This paper studies the problem of finding the nearest symmetric positive definite Toeplitz matrix to a given symmetric one. Additional design constraints, which are also formed as closed convex sets in the real Hilbert space of all symmetric matrices, are imposed on the desired matrix. An algorithmic solution to the problem given by the hybrid steepest descent method is established also in the case of inconsistent design constraints.

[1]  R. Wittmann.  Approximation of fixed points of nonexpansive mappings , 1992 .

[2]  P. Lions.  Approximation de Points Fixes de Contractions , 1977 .

[3]  Patrick L. Combettes,et al.  Inconsistent signal feasibility problems: least-squares solutions in a product space , 1994, IEEE Trans. Signal Process..

[4]  R. Dykstra,et al.  A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces , 1986 .

[5]  Patrick L. Combettes,et al.  Hard-constrained inconsistent signal feasibility problems , 1999, IEEE Trans. Signal Process..

[6]  I. Yamada.  A numerically robust hybrid steepest descent method for the convexly constrained generalized inverse problems , 2002 .

[7]  I. Yamada,et al.  NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING , 2002 .

[8]  Isao Yamada,et al.  Spectrum estimation of real vector wide sense stationary processes by the Hybrid Steepest Descent Method , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[9]  I. Yamada.  The Hybrid Steepest Descent Method for the Variational Inequality Problem over the Intersection of Fixed Point Sets of Nonexpansive Mappings , 2001 .

[10]  Gene H. Golub,et al.  Matrix computations , 1983 .

[11]  Karolos M. Grigoriadis,et al.  Application of alternating convex projection methods for computation of positive Toeplitz matrices , 1994, IEEE Trans. Signal Process..

[12]  K. Grigoriadis,et al.  Alternating convex projection methods for discrete-time covariance control design , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[13]  I. Yamada,et al.  Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings , 1998 .

[14]  Yongyi Yang,et al.  Vector Space Projections: A Numerical Approach to Signal and Image Processing, Neural Nets, and Optics , 1998 .

[15]  P. L. Combettes.  The foundations of set theoretic estimation , 1993 .

[16]  I. Ekeland,et al.  Convex analysis and variational problems , 1976 .

[17]  Patrick L. Combettes,et al.  Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization , 2000, SIAM J. Control. Optim..

[18]  W. Cheney,et al.  Proximity maps for convex sets , 1959 .

[19]  Alvaro R. De Pierro,et al.  On the convergence of Han's method for convex programming with quadratic objective , 1991, Math. Program..

[20]  N. Higham.  COMPUTING A NEAREST SYMMETRIC POSITIVE SEMIDEFINITE MATRIX , 1988 .

[21]  P. L. Combettes,et al.  Foundation of set theoretic estimation , 1993 .

[22]  Billy E. Rhoades.  Quadratic optimization of fixed points for a family of nonexpansive mappings in Hilbert space , 2004 .

[23]  Boris Polyak,et al.  The method of projections for finding the common point of convex sets , 1967 .

[24]  E. Zeidler.  Nonlinear functional analysis and its applications , 1988 .

[25]  Heinz H. Bauschke,et al.  On Projection Algorithms for Solving Convex Feasibility Problems , 1996, SIAM Rev..