A unified framework for solving a general class of conditional and robust set-membership estimation problems

In this paper we present a unified framework for solving a general class of problems arising in the context of set-membership estimation/identification theory. More precisely, the paper aims at providing an original approach for the computation of optimal conditional and robust projection estimates in a nonlinear estimation setting where the operator relating the data and the parameter to be estimated is assumed to be a generic multivariate polynomial function and the uncertainties affecting the data are assumed to belong to semialgebraic sets. By noticing that the computation of both the conditional and the robust projection optimal estimators requires the solution to min-max optimization problems that share the same structure, we propose a unified two-stage approach based on semidefinite-relaxation techniques for solving such estimation problems. The key idea of the proposed procedure is to recognize that the optimal functional of the inner optimization problems can be approximated to any desired precision by a multivariate polynomial function by suitably exploiting recently proposed results in the field of parametric optimization. Two simulation examples are reported to show the effectiveness of the proposed approach.Comment: Accpeted for publication in the IEEE Transactions on Automatic Control (2014

Stable Nonlinear Identification From Noisy Repeated Experiments via Convex Optimization

This paper introduces new techniques for using convex optimization to fit input-output data to a class of stable nonlinear dynamical models. We present an algorithm that guarantees consistent estimates of models in this class when a small set of repeated experiments with suitably independent measurement noise is available. Stability of the estimated models is guaranteed without any assumptions on the input-output data. We first present a convex optimization scheme for identifying stable state-space models from empirical moments. Next, we provide a method for using repeated experiments to remove the effect of noise on these moment and model estimates. The technique is demonstrated on a simple simulated example

Latent class analysis for segmenting preferences of investment bonds

Market segmentation is a key component of conjoint analysis which addresses consumer preference heterogeneity. Members in a segment are assumed to be homogenous in their views and preferences when worthing an item but distinctly heterogenous to members of other segments. Latent class methodology is one of the several conjoint segmentation procedures that overcome the limitations of aggregate analysis and a-priori segmentation. The main benefit of Latent class models is that market segment membership and regression parameters of each derived segment are estimated simultaneously. The Latent class model presented in this paper uses mixtures of multivariate conditional normal distributions to analyze rating data, where the likelihood is maximized using the EM algorithm. The application focuses on customer preferences for investment bonds described by four attributes; currency, coupon rate, redemption term and price. A number of demographic variables are used to generate segments that are accessible and actionable.peer-reviewe

On the interpretation and identification of dynamic Takagi-Sugenofuzzy models

Dynamic Takagi-Sugeno fuzzy models are not always easy to interpret, in particular when they are identified from experimental data. It is shown that there exists a close relationship between dynamic Takagi-Sugeno fuzzy models and dynamic linearization when using affine local model structures, which suggests that a solution to the multiobjective identification problem exists. However, it is also shown that the affine local model structure is a highly sensitive parametrization when applied in transient operating regimes. Due to the multiobjective nature of the identification problem studied here, special considerations must be made during model structure selection, experiment design, and identification in order to meet both objectives. Some guidelines for experiment design are suggested and some robust nonlinear identification algorithms are studied. These include constrained and regularized identification and locally weighted identification. Their usefulness in the present context is illustrated by examples

Membership-set estimation using random scanning and principal component analysis

A set-theoretic approach to parameter estimation based on the bounded-error concept is an appropriate choice when incomplete knowledge of observation error statistics and unavoidable structural model error invalidate the presuppositions of stochastic methods. Within this class the estimation of non-linear-in-the-parameters models is examined. This situation frequently occurs in modelling natural systems. The output error method proposed is based on overall random scanning with iterative reduction of the size of the scanned region. In order to overcome the problem of computational inefficiency, which is particularly serious when there is interaction between the parameter estimates, two modifications to the basic method are introduced. The first involves the use of principal component transformations to provide a rotated parameter space in the random scanning because large areas of the initial parameter space are thus excluded from further examination. The second improvement involves the standardization of the parameters so as to obtain an initial space with equal size extension in all directions. This proves to largely increase the computational robustness of the method. The modified algorithm is demonstrated by application to a simple three-parameter model of diurnal dissolved oxygen patterns in a lake

Low X-Ray Luminosity Galaxy Clusters: Main goals, sample selection, photometric and spectroscopic observations

We present the study of nineteen low X-ray luminosity galaxy clusters (L$_X \sim$ 0.5--45 $\times$ $10^{43}$ erg s$^{-1}$), selected from the ROSAT Position Sensitive Proportional Counters (PSPC) Pointed Observations (Vikhlinin et al. 1998) and the revised version of Mullis et al. (2003) in the redshift range of 0.16 to 0.7. This is the introductory paper of a series presenting the sample selection, photometric and spectroscopic observations and data reduction. Photometric data in different passbands were taken for eight galaxy clusters at Las Campanas Observatory; three clusters at Cerro Tololo Interamerican Observatory; and eight clusters at the Gemini Observatory. Spectroscopic data were collected for only four galaxy clusters using Gemini telescopes. With the photometry, the galaxies were defined based on the star-galaxy separation taking into account photometric parameters. For each galaxy cluster, the catalogues contain the PSF and aperture magnitudes of galaxies within the 90\% completeness limit. They are used together with structural parameters to study the galaxy morphology and to estimate photometric redshifts. With the spectroscopy, the derived galaxy velocity dispersion of our clusters ranged from 507 km~s$^{-1}$ for [VMF98]022 to 775 km~s$^{-1}$ for [VMF98]097 with signs of substructure. Cluster membership has been extensively discussed taking into account spectroscopic and photometric redshift estimates. In this sense, members are the galaxies within a projected radius of 0.75 Mpc from the X-ray mission peak and with cluster centric velocities smaller than the cluster velocity dispersion or 6000 km~s$^{-1}$, respectively. These results will be used in forthcoming papers to study, among the main topics, the red cluster sequence, blue cloud and green populations; the galaxy luminosity function and cluster dynamics.Comment: 13 pages, 6 tables, 9 figures. Uses emulateapj. Accepted for publication in The Astronomical Journal. Some formatting errors fixe

Fuzzy Modeling and Parallel Distributed Compensation for Aircraft Flight Control from Simulated Flight Data

A method is described that combines fuzzy system identification techniques with Parallel Distributed Compensation (PDC) to develop nonlinear control methods for aircraft using minimal a priori knowledge, as part of NASAs Learn-to-Fly initiative. A fuzzy model was generated with simulated flight data, and consisted of a weighted average of multiple linear time invariant state-space cells having parameters estimated using the equation-error approach and a least-squares estimator. A compensator was designed for each subsystem using Linear Matrix Inequalities (LMI) to guarantee closed-loop stability and performance requirements. This approach is demonstrated using simulated flight data to automatically develop a fuzzy model and design control laws for a simplified longitudinal approximation of the F-16 nonlinear flight dynamics simulation. Results include a comparison of flight data with the estimated fuzzy models and simulations that illustrate the feasibility and utility of the combined fuzzy modeling and control approach

Towards Efficient Maximum Likelihood Estimation of LPV-SS Models

How to efficiently identify multiple-input multiple-output (MIMO) linear parameter-varying (LPV) discrete-time state-space (SS) models with affine dependence on the scheduling variable still remains an open question, as identification methods proposed in the literature suffer heavily from the curse of dimensionality and/or depend on over-restrictive approximations of the measured signal behaviors. However, obtaining an SS model of the targeted system is crucial for many LPV control synthesis methods, as these synthesis tools are almost exclusively formulated for the aforementioned representation of the system dynamics. Therefore, in this paper, we tackle the problem by combining state-of-the-art LPV input-output (IO) identification methods with an LPV-IO to LPV-SS realization scheme and a maximum likelihood refinement step. The resulting modular LPV-SS identification approach achieves statical efficiency with a relatively low computational load. The method contains the following three steps: 1) estimation of the Markov coefficient sequence of the underlying system using correlation analysis or Bayesian impulse response estimation, then 2) LPV-SS realization of the estimated coefficients by using a basis reduced Ho-Kalman method, and 3) refinement of the LPV-SS model estimate from a maximum-likelihood point of view by a gradient-based or an expectation-maximization optimization methodology. The effectiveness of the full identification scheme is demonstrated by a Monte Carlo study where our proposed method is compared to existing schemes for identifying a MIMO LPV system