A class of variable selection procedures for parametric models via nonconcave penalized likelihood was proposed by Fan and Li to simultaneously estimate parameters and select important variables. They demonstrated that this class of procedures has an oracle property when the number of parameters is finite. However, in most model selection problems the number of parameters should be large and grow with the sample size. In this paper some asymptotic properties of the nonconcave penalized likelihood are established for situations in which the number of parameters tends to as the sample size increases. Under regularity conditions we have established an oracle property and the asymptotic normality of the penalized likelihood estimators. Furthermore, the consistency of the sandwich formula of the covariance matrix is demonstrated. Nonconcave penalized likelihood ratio statistics are discussed, and their

No abstract uploaded!

In this paper, the first in a series, we study the deformed Hermitian-Yang-Mills (dHYM) equation from the variational point of view as an infinite dimensional GIT problem. The dHYM equation is mirror to the special Lagrangian equation, and our infinite dimensional GIT problem is mirror to Thomas' GIT picture for special Lagrangians. This gives rise to infinite dimensional manifold $\mathcal{H}$ closely related to Solomon's space of positive Lagrangians. In the hypercritical phase case we prove the existence of smooth approximate geodesics, and weak geodesics with $C^{1,\alpha}$ regularity. This is accomplished by proving sharp with respect to scale estimates for the Lagrangian phase operator on collapsing manifolds with boundary. As an application of our techniques we give a simplified proof of Chen's theorem on the existence of $C^{1,\alpha}$ geodesics in the space of K\"ahler metrics. In two follow up papers, these results will be used to examine algebraic obstructions to the existence of solutions to dHYM and special Lagrangians in Landau-Ginzburg models.

In this paper, two explicit conversion formulae between triangular and rectangular Bézier patches are derived. Using the formulae, one triangular Bézier patch of degree n can be converted into one rectangular Bézier patch of degree $n \times n$. And one rectangular Bézier patch of degree m × n can be converted into two triangular Bézier patches of degree $m + n$ . Besides, two stable recursive algorithms corresponding to the two conversion formulae are given. Using the algorithms, when converting triangular Bézier patches to rectangular Bézier patches, we can computer the relations between the control points of the two types of patches for any $n\ge2$ based on the relationships for $n=1$. When converting rectangular Bézier patches to triangular Bézier patches, we can computer the relations between the control points of the two types of patches for any $m\ge 2, n \subset N^+ $ and $n \ge 2, m \subset N^+$ based on the relationships for $m=n=1$.

No abstract uploaded!