Robust estimation for partially linear models with large-dimensional covariates

We are concerned with robust estimation procedures to estimate the parameters in partially linear models with large-dimensional covariates. To enhance the interpretability, we suggest implementing a nonconcave regularization method in the robust estimation procedure to select important covariates from the linear component. We establish the consistency for both the linear and the nonlinear components when the covariate dimension diverges at the rate of o(n1/2), where n is the sample size. We show that the robust estimate of linear component performs asymptotically as well as its oracle counterpart which assumes the baseline function and the unimportant covariates were known a priori. With a consistent estimator of the linear component, we estimate the nonparametric component by a robust local linear regression. It is proved that the robust estimate of nonlinear component performs asymptotically as well as if the linear component were known in advance.Comprehensive simulation studies are carried out and an application is presented to examine the fnite-sample performance of the proposed procedures.     

COMPOSITE-STEP LIKE FILTER METHODS FOR EQUALITY CONSTRAINT PROBLEMS

In a composite-step approach, a step sk is computed as the sum of two components vk and hk. The normal component vk, which is called the vertical step, aims to improve the linearized feasibility, while the tangential component hk, which is also called horizontal step, concentrates on reducing a model of the merit functions. As a filter method, it reduces both the infeasibility and the objective function. This is the same property of these two methods. In this paper, one concerns the composite-step like filter approach. That is, a step is tangential component hk if the infeasibility is reduced. Or else, sk is a compositestep composed of normal component Vk and tangential component hk.     

Generalized profile LSE in varying-coefficient partially linear models with measurement errors

This paper is concerned with the estimating problem of a semiparametric varying-coefficient partially linear errors-in-variables model Yi=Xτiβ+Zτiα(Ui)+εi , Wi=Xi+ξi,i=1, ··· , n. Due to measurement errors, the usual profile least square estimator of the parametric component, local polynomial estimator of the nonparametric component and profile least squares based estimator of the error variance are biased and inconsistent. By taking the measurement errors into account we propose a generalized profile least squares estimator for the parametric component and show it is consistent and asymptotically normal. Correspondingly, the consistent estimation of the nonparametric component and error variance are proposed as well. These results may be used to make asymptotically valid statistical inferences. Some simulation studies are conducted to illustrate the finite sample performance of these proposed estimations.     

FIXED-DESIGN SEMIPARAMETRIC REGRESSION FOR LINEAR TIME SERIES

This article studies parametric component and nonparametric component estimators in a semiparametric regression model with linear time series errors; their r-th mean consistency and complete consistency are obtained under suitable conditions. Finally, the author shows that the usual weight functions based on nearest neighbor methods satisfy the designed assumptions imposed.     

Efficient statistical inference for partially nonlinear errors-in-variables models

In this paper, we consider the partially nonlinear errors-in-variables models when the non- parametric component is measured with additive error. The profile nonlinear least squares estimator of unknown parameter and the estimator of nonparametric component are constructed, and their asymptotic properties are derived under general assumptions. Finite sample performances of the proposed statistical inference procedures are illustrated by Monte Carlo simulation studies.     

THE DISTANCE BETWEEN DIFFERENT COMPONENTS OF THE UNIVERSAL TEICHMULLER SPACE

The model of the universal Teichmuller space by the derivatives of logarithm is the union of infinite disconnected components. In this paper, it is proved that the distance between different components is 0, and the distance from the center of a component to every other component is 2.     

Coordinating pricing and inventory control in a fluctuating environment

This paper addresses the simultaneous determination of pricing and inventory replenishment strate- gies under a fluctuating environment. Specifically, we analyze the single item, periodic review model. The demand consists of two parts： the deterministic component, which is influenced by the price, and the stochastic component （perturbation）. The distribution of the stochastic component is determined by the current state of an exogenous Markov chain. The price that is charged in any given period can be specified dynamically. A replenishment order may be placed at the beginning of some or all of the periods, and stockouts are fully backlogged. Ordering costs that are lower semicontinuous, and inventory/backlog （or surplus） costs that are continuous with polynomial growth. Finite-horizon and infinite-horizon problems are addressed. Existence of optimal policies is established. Furthermore, optimality of （s,S,p）-type policies is proved when the ordering cost consists of fixed and proportional cost components and the surplus cost （these costs are all state-dependent） is convex.     

Outlier Mining Based on Principal Component Estimation

Outlier mining is an important aspect in data mining and the outlier mining based on Cook distance is most commonly used. But we know that when the data have multicoUinearity, the traditional Cook method is no longer effective. Considering the excellence of the principal component estimation, we use it to substitute the least squares estimation, and then give the Cook distance measurement based on principal component estimation, which can be used in outlier mining. At the same time, we have done some research on related theories and application problems.     

Precision Matrix Estimation by Inverse Principal Orthogonal Decomposition

We investigate the structure of a large precision matrix in Gaussian graphical models by decomposing it into a low rank component and a remainder part with sparse precision matrix.Based on the decomposition,we propose to estimate the large precision matrix by inverting a principal orthogonal decomposition(IPOD).The IPOD approach has appealing practical interpretations in conditional graphical models given the low rank component,and it connects to Gaussian graphical models with latent variables.Specifically,we show that the low rank component in the decomposition of the large precision matrix can be viewed as the contribution from the latent variables in a Gaussian graphical model.Compared with existing approaches for latent variable graphical models,the IPOD is conveniently feasible in practice where only inverting a low-dimensional matrix is required.To identify the number of latent variables,which is an objective of its own interest,we investigate and justify an approach by examining the ratios of adjacent eigenvalues of the sample covariance matrix?Theoretical properties,numerical examples,and a real data application demonstrate the merits of the IPOD approach in its convenience,performance,and interpretability.     

On pointwise bounded approximation

Let G be an open subset in the extended complex plane and let A（G） denote the algebra of all functions analytic on G and continuous on G. We call a domain multi-nicely connected if there is a circular domain W and a conformal map ~ from W onto G such that the boundary value function of φ is univalent almost everywhere with respect to the arclength on aW. Suppose that every component of G is finitely connected and none of the components of G have single point boundary components. We show that for every bounded analytic function on G to be the pointwise limit of a bounded sequence of functions in A（G）, it is necessary and sufficient that each component of G is multi-nicely connected and the harmonic measures of G are mutually singular. This generalizes the corresponding result of Davie for the case when the components of G are simply connected.     

RECENT PROGRESS ON SPHERICAL HARMONIC APPROXIMATION MADE BY BNU RESEARCH GROUP ——In memory of Professor Sun Yongsheng

As early as in 1990, Professor Sun Yongsheng, suggested his students at Beijing Normal University to consider research problems on the unit sphere. Under his guidance and encouragement his students started the research on spherical harmonic analysis and approximation. In this paper, we incompletely introduce the main achievements in this area obtained by our group and relative researchers during recent 5 years （2001-2005）. The main topics are： convergence of Cesaro summability, a.e. and strong summability of Fourier-Laplace series; smoothness and K-functionals; Kolmogorov and linear widths.     

Instructions for Authors

<正>Submission Authors must use LaTeX for typewriting,and visit our website www.actamath.com to submit your paper.Our address is Editorial Office of Acta Mathematica Sinica,Academy of Mathematics and Systems Science,Chinese Academy of Sciences,Beijing 100190,P.R.China.     

THE 8~(th) INTERNATIONAL CONGRESS ON INDUSTRIAL AND APPLIED MATHEMATICS

正August 10-14,2015Beijin,China The International Congress on Industrial and Applied Mathematics(ICIAM)is the premier international congress in the field of applied mathematics held every four years under the auspices of the International Council for Industrial and Applied Mathematics.From August 10 to 14,2015,mathematicians,scientists     

Boundedness for commutators of multipliers on Hardy type spaces

In this paper, we study the commutators generalized by multipliers and a BMO function. Under some assumptions, we establish its boundedness properties from certain atomic Hardy space Hb^p（R^n） into the Lebesgue space L^p with p 〈 1.     

A unified approach to certain problems of best local approximation

In this paper we study best local quasi-rational approximation and best local approximation from finite dimensional subspaces of vectorial functions of several variables. Our approach extends and unifies several problems concerning best local multi-point approximation in different norms.     

Towards Excellence in Science Chinese Academy of Sciences

<正>May 26,2014,Beijing Science is a human enterprise in the pursuit of knowledge.The scientific revolution that occurred in the 17th Century initiated the advances of modern science.The scientific knowledge system created by     

THE 8~(th) INTERNATIONAL CONGRESS ON INDUSTRIAL AND APPLIED MATHEMATICS

<正>August 10-14,2015Beijing,ChinaThe International Congress on Industrial and Applied Mathematics(ICIAM)is the premier international congress in the field of applied mathematics held every four years under the auspices of the International Council for Industrial and Applied Mathematics.From August 10 to 14,2015,mathematicians,scientists     

Bounds for the zeros of polynomials

Let P(z)=∑↓j=0↑n ajx^j be a polynomial of degree n. In this paper we prove a more general result which interalia improves upon the bounds of a class of polynomials. We also prove a result which includes some extensions and generalizations of Enestrǒm-Kakeya theorem.