Unitary orthogonalization processes

All methods for solving least-squares problems involve orthogonalization in one way or another. Certain fundamental estimation and prediction problems of signal processing and time-series analysis can be formulated as least-squares problems. In these problems, the sequence that is to be orthogonalized is generated by an underlying unitary operator. A prime example of an efficient orthogonalization procedure for this class of problems is Gragg's isometric Arnoldi process, which is the abstract encapsulation of a number of concrete algorithms. In this paper, we discuss a two-sided orthogonalization process that is equivalent to Gragg's process but has certain conceptual strengths that warrant its introduction. The connections with classical algorithms of signal processing are discussed.     

On counter orthogonalization processes

Equations for counter orthogonalization of homogeneous (i.e., generated by isometric operators) vector systems in a Hilbert space are deduced. This theory can be applied to solving Toeplitz algebraic and integral equations, some problems of signals estimation, and inverse problems of mathematical modeling and identification.     

Asymptotic distribution of residual autocorrelations from estimation of ARMA processes by Gram-Schmidt orthogonalization

One computationally efficient procedure for obtaining maximum likelihood parameter estimates for an ARMA process is based on the Gram-Schmidt orthogonalization of the space generated by the finite series of observations. This paper shows that the asymptotic distribution of the autocorrelations of the resulting residuals coincides with that for least-square residuals.     

On orthogonalization of bases

An example of a basis for space C, close to the Schauder system, is constructed which, after orthogonalization by the Schmidt method, is not a basis for space LP for any p [1, 2) +(2,].Translated from Matematicheskie Zametki, Vol. 6, No. 6, pp. 713–724, December, 1969.This work was completed under the guidance of P. L. Ul'yanov to whom the author indicates his deep gratitude.     

Fast block Toeplitz orthogonalization

Summary Algorithms are presented which compute theQR factorization of a block-Toeplitz matrix inO(n) ² block-operations, wheren is the block-order of the matrix and a block-operation is a multiplication, inversion or a set of Householder operations involving one or two blocks. The algorithms are in general analogous to those presented in the scalar Toeplitz case in a previous paper, but the basic operation is the Householder transform rather than the Givens transform, and the computation of the Householder coefficients and other working matrices requires special treatment. Two algorithms are presented-the first computes onlyR explicitly and the second computes bothQ andR.     

Optimal switching for alternating processes

This paper is concerned with the problems of optimal switching for general stochastic processes. We show the existence of the maximal element of a class of dynamic programming inequalities by the method of impulsive control. We obtain results on the existence of optimal control for general and cyclic switching problems.     

Optimal control of hydroforming processes

We consider an optimal control problem for sheet metal hydroforming. As a first step derivative free optimization algorithms are used to control the time dependent blank holder force and the fluid pressure, which are typical control variables. Our goal is to obtain a desired final configuration. We present numerical examples for 2D and 3D ABAQUS simulations for the hydroforming process of complexly curved sheet metals with bifurcated cross-sections. Since a single ABAQUS simulation takes a long time, optimization algorithms based on reduced models are under investigation. The reduced order model is based on a Galerkin solver for the elastoplasticity problem. (© 2011 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Optimal iterative processes for root-finding

Letf ₀(x) be a function of one variable with a simple zero atr ₀. An iteration scheme is said to be locally convergent if, for some initial approximationsx ₁, ...,x _s nearr ₀ and all functionsf which are sufficiently close (in a certain sense) tof ₀, the scheme generates a sequence {x _k} which lies nearr ₀ and converges to a zeror off. The order of convergence of the scheme is the infimum of the order of convergence of {x _k} for all such functionsf. We study iteration schemes which are locally convergent and use only evaluations off,f, ...,f ^[d] atx ₁, ...,x _k–1 to determinex _k, and we show that no such scheme has order greater thand+2. This bound is the best possible, for it is attained by certain schemes based on polynomial interpolation.This work was supported (in part) by the Office of Naval Research under contract numbers N0014-69-C-0023 and N0014-71-C-0112.     

Optimal stopping for extremal processes

For an extremal process (Z_t)_t the optimal stopping problem for X_t = f(Z_t)?g(t) gives the continuous time analogue of the optimal stopping problem for max{Y₁,…,Y_k}?c_k where Y₁, Y₂,… are i.i.d. For the continuous time problem we derive optimal stopping times in explicit form and also show that the optimal stopping boundary is the limit of the optimal stopping boundaries for suitably standardized discrete problems.     

Least-squares orthogonalization using semidefinite programming

We consider the problem of constructing an optimal set of orthogonal vectors from a given set of vectors in a real Hilbert space. The vectors are chosen to minimize the sum of the squared norms of the errors between the constructed vectors and the given vectors. We show that the design of the optimal vectors, referred to as the least-squares (LS) orthogonal vectors, can be formulated as a semidefinite programming (SDP) problem. Using the many well-known algorithms for solving SDPs, which are guaranteed to converge to the global optimum, the LS vectors can be computed very efficiently in polynomial time within any desired accuracy.By exploiting the connection between our problem and a quantum detection problem we derive a closed form analytical expression for the LS orthogonal vectors, for vector sets with a broad class of symmetry properties. Specifically, we consider geometrically uniform (GU) sets with a possibly non-abelian generating group, and compound GU sets which consist of subsets that are GU.     

Optimal sampling of independent increment processes

A sample function drawn from a large class of independent increment processes with one of two sets of parameters is observed at evenly spaced time instants. The error probabilities associated with a standard hypothesis testing problem are studied as a function of the time interval between observations, holding the total number of observations fixed. A partial solution is obtained to the problem of choosing the optimal sampling rate.     

Optimal processes in smooth-convex minimization problems

The paper elaborates a general method for studying smooth-convex conditional minimization problems that allows one to obtain necessary conditions for solutions of these problems in the case where the image of the mapping corresponding to the constraints of the problem considered can be of infinite codimension. On the basis of the elaborated method, the author proves necessary optimality conditions in the form of an analog of the Pontryagin maximum principle in various classes of quasilinear optimal control problems with mixed constraints; moreover, the author succeeds in preserving a unified approach to obtaining necessary optimality conditions for control systems without delays, as well as for systems with incommensurable delays in state coordinates and control parameters. The obtained necessary optimality conditions are of a constructive character, which allows one to construct optimal processes in practical problems (from biology, economics, social sciences, electric technology, metallurgy, etc.), in which it is necessary to take into account an interrelation between the control parameters and the state coordinates of the control object considered. The result referring to systems with aftereffect allows one to successfully study many-branch product processes, in particular, processes with constraints of the “bottle-neck” type, which were considered by R. Bellman, and also those modern problems of flight dynamics, space navigation, building, etc. in which, along with mixed constraints, it is necessary to take into account the delay effect. The author suggests a general scheme for studying optimal process with free right endpoint based on the application of the obtained necessary optimality conditions, which allows one to find optimal processes in those control systems in which no singular cases arise. The author gives an effective procedure for studying the singular case (the procedure for calculating a singular control in quasilinear systems with mixed constraints. Using the obtained necessary optimality conditions, the author constructs optimal processes in concrete control systems. __________ Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 42, Optimal Control, 2006.     

Optimal control of stationary Markov processes

Sufficient conditions are given for the optimal control of Markov processes when the control policy is stationary and the process possesses a stationary distribution. The costs are unbounded and additive, and may or may not be discounted. Applications to Semi-Markov processes are included, and the results for random walks are related to the author's previous papers on diffusion processes.     

Optimal stopping of strong Markov processes

We characterize the value function and the optimal stopping time for a large class of optimal stopping problems where the underlying process to be stopped is a fairly general Markov process. The main result is inspired by recent findings for Lévy processes obtained essentially via the Wiener–Hopf factorization. The main ingredient in our approach is the representation of the β$\beta$-excessive functions as expected suprema. A variety of examples is given.     

Optimal boundary control of glass cooling processes

In this paper, an optimal control problem for glass cooling processes is studied. We model glass cooling using the SP1 approximations to the radiative heat transfer equations. The control variable is the temperature at the boundary of the domain. This results in a boundary control problem for a parabolic/elliptic system which is treated by a constrained optimization approach. We consider several cost functionals of tracking‐type and formally derive the first‐order optimality system. Several numerical methods based on the adjoint variables are investigated. We present results of numerical simulations illustrating the feasibility and performance of the different approaches. Copyright © 2004 John Wiley & Sons, Ltd.