A locally computed suboptimal control strategy for a class of interconnected systems

In this paper, a locally computed suboptimal control strategy for a class of interconnected systems is introduced. First, optimal statefeedback control equations are derived for a finite-horizon quadratic cost. Then, the control for each subsystem is separated into two portions. The first portion stabilizes the isolated subsystem, and the second portion corresponds to the interactions. To achieve a locally calculable control, an approximation to the optimal control equations is introduced, and two iterative suboptimal control algorithms are developed. In the first algorithm, the initial conditions of subsystems are assumed to be known; in the second algorithm, this information is replaced by statistical distributions. The orders of errors in the iterations of the algorithm and in the suboptimality are given in terms of interconnections. An example with comparisons is also included to show the performance of the approach.     

Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions

A domain partitioning algorithm for minimizing or maximizing a Lipschitz continuous function is enhanced to yield two new, more efficient algorithms. The use of interval arithmetic in the case of rational functions and the estimates of Lipschitz constants valid in subsets of the domain in the case of others and the addition of local optimization have resulted in an algorithm which, in tests on standard functions, performs well.     

The Cross-Entropy Method for Continuous Multi-Extremal Optimization

In recent years, the cross-entropy method has been successfully applied to a wide range of discrete optimization tasks. In this paper we consider the cross-entropy method in the context of continuous optimization. We demonstrate the effectiveness of the cross-entropy method for solving difficult continuous multi-extremal optimization problems, including those with non-linear constraints.      

Multiscale kernels

This paper reconstructs multivariate functions from scattered data by a new multiscale technique. The reconstruction uses standard methods of interpolation by positive definite reproducing kernels in Hilbert spaces. But it adopts techniques from wavelet theory and shift-invariant spaces to construct a new class of kernels as multiscale superpositions of shifts and scales of a single compactly supported function φ. This means that the advantages of scaled regular grids are used to construct the kernels, while the advantages of unrestricted scattered data interpolation are maintained after the kernels are constructed. Using such a multiscale kernel, the reconstruction method interpolates at given scattered data. No manipulations of the data (e.g., thinning or separation into subsets of certain scales) are needed. Then, the multiscale structure of the kernel allows to represent the interpolant on regular grids on all scales involved, with cheap evaluation due to the compact support of the function φ, and with a recursive evaluation technique if φ is chosen to be refinable. There also is a wavelet-like data reduction effect, if a suitable thresholding strategy is applied to the coefficients of the interpolant when represented over a scaled grid. Various numerical examples are presented, illustrating the multiresolution and data compression effects.     

时滞差分系统基于两种度量的稳定性分析

本文建立了一些关于时滞差分系统（h0,h）稳定性（一致稳定性，渐近稳定性，一致渐近稳定性）的判定准则。在所得到的定理中，去除了△V为常负的限制，特别地，△V甚至可以恒为正，从而大大改进了已有结果，并更加便于应用。     

Analytic evaluation of the weighting functions for remote sensing of blackbody planetary atmospheres: a general linearization approach

An analytic approach is proposed for the evaluation of weighting functions for remote sensing of a blackbody planetary atmosphere based on straightforward, general linearization. In the present paper, this approach is applied to the case of remote sensing with the nadir (down-looking) geometry. Expressions for weighting functions for various atmospheric parameters are derived. It is demonstrated that in a realistic case of temperature-dependent atmospheric absorption, an additional term appears in the expression for the temperature weighting function which contains the temperature derivative of the atmospheric absorption coefficient. The approach is applied to the case of a semi-infinite atmosphere and then, to the atmosphere of a finite optical depth with the underlying surface. In this, latter case, the expressions are also obtained for partial derivatives of observed radiances with respect to surface parameters: surface pressure, temperature and emissivity.     

Adaptive Interpolation by Scaled Multiquadrics

We present an adaptive method to extract shape-preserving information from a univariate data sample. The behavior of the signal is obtained by interpolating at adaptively selected few data points by a linear combination of multiquadrics with variable scaling parameters. On the theoretical side, we give a sufficient condition for existence of the scaled multiquadric interpolant. On the practical side, we give various examples to show the applicability of the method.     

On generalized gradients

In this paper we present a concept of the construction of generalized gradients by considering a development of directional derivatives into spherical harmonics. This leads to a derivation system as a system of generalized partial derivatives. Necessary conditions for local extrema for a broad class of not necessarily differentiable function can be given and a characterization of points of differentiability can be proved by using generalized gradients.     

Differential subordinations concerning starlike functions

Denote byS ^* (⌕), (0≤⌕<1), the family consisting of functionsf(z)=z+a ₂z²+...+a_nzⁿ+... that are analytic and starlike of order ⌕, in the unit disc ⋎z⋎<1. In the present article among other things, with very simple conditions on μ, ⌕ andh(z) we prove the f’(z) (f(z)/z)^μ−1<h(z) implies f∈S^*(⌕). Our results in this direction then admit new applications in the study of univalent functions. In many cases these results considerably extend the earlier works of Miller and Mocanu [6] and others.     

Nonlinear multiple objective optimization: An algorithm and some theory

This paper presents an algorithm and the supporting theory for solving a class of nonlinear multiple criteria optimization problems using Zionts—Wallenius type of interaction. The Zionts—Wallenius method, as extended in this paper, can be used for solving multiple criteria problems with concave objective and (implicit) value functions and convex feasible regions. Modifications of the method to handle nonconvex feasible regions and general nonlinear objective functions are also discussed.This research was supported, in part, by a Faculty Research Development Award and by a Council of 100 Research Grant from Arizona State University (Roy), and by a grant from Y. Jahnsson Foundation, Finland (Wallenius). The research was performed while the second author was a Visiting Professor at Arizona State University.