Inexact Interior-Point Method

In this paper, we introduce an inexact interior-point algorithm for a constrained system of equations. The formulation of the problem is quite general and includes nonlinear complementarity problems of various kinds. In our convergence theory, we interpret the inexact interior-point method as an inexact Newton method. This enables us to establish a global convergence theory for the proposed algorithm. Under the additional assumption of the invertibility of the Jacobian at the solution, the superlinear convergence of the iteration sequence is proved.     

Numerical analysis for the quadratic matrix equations from a modification of fixed‐point type

In this paper, we study the quadratic matrix equations. To improve the application of iterative schemes, we use a transform of the quadratic matrix equation into an equivalent fixed‐point equation. Then, we consider an iterative process of Chebyshev‐type to solve this equation. We prove that this iterative scheme is more efficient than Newton's method. Moreover, we obtain a local convergence result for this iterative scheme. We finish showing, by an application to noisy Wiener‐Hopf problems, that the iterative process considered is computationally more efficient than Newton's method.     

General Information

In this paper, we propose and analyze an SQP-type method for solving linearly constrained convex minimization problems where the objective functions are too complex to be evaluated exactly. Some basic results for global convergence and local superlinear convergence are obtained according to the properties of the approximation sequence. We illustrate the applicability of our approach by proposing a new method for solving two-stage stochastic programs with fixed recourse.     

Complete f-moment Convergence for Widely Orthant Dependent Random Variables and Its Application in Nonparametric Models

In this paper, we study the complete f-moment convergence for widely orthant dependent (WOD, for short) random variables. A general result on complete f-moment convergence for arrays of rowwise WOD random variables is obtained. As applications, we present some new results on complete f-moment convergence for WOD random variables. We also give an application to nonparametric regression models based on WOD errors by using the complete convergence that we established. Finally, the choice of the fixed design points and the weight functions for the nearest neighbor estimator are proposed, and a numerical simulation is provided to verify the validity of the theoretical result.     

连续时间下非参数回归模型的误差密度估计

本文研究连续时间下非参数回归的误差密度估计问题，给出误差密度的一个核估计量，利用回归函数的核估计在紧区间上一致均收敛的结论证明了该统计量渐近无偏差，均方相合法，并说明了该核估计中窗宽选取的办法。     

Superlinear Convergence of a Newton-Type Algorithm for Monotone Equations

We consider the problem of finding solutions of systems of monotone equations. The Newton-type algorithm proposed in Ref. 1 has a very nice global convergence property in that the whole sequence of iterates generated by this algorithm converges to a solution, if it exists. Superlinear convergence of this algorithm is obtained under a standard nonsingularity assumption. The nonsingularity condition implies that the problem has a unique solution; thus, for a problem with more than one solution, such a nonsingularity condition cannot hold. In this paper, we show that the superlinear convergence of this algorithm still holds under a local error-bound assumption that is weaker than the standard nonsingularity condition. The local error-bound condition may hold even for problems with nonunique solutions. As an application, we obtain a Newton algorithm with very nice global and superlinear convergence for the minimum norm solution of linear programs.This research was supported by the Singapore-MIT Alliance and the Australian Research Council.     

关于非齐次马氏过程散度的极限性质

将数列上的绝对平均收敛性推广到平面上,并得出相应的引理.利用这个概念给出非齐次马氏过程散度率存在的一个条件.     

无穷限反常积分收敛时被积函数的极限状态

根据无穷限反常积分∫a^＋∞f（x）dx收敛的柯西准则和定积分的性质,讨论被积函数f（x）当x→∞时。的极限状态,并得出当无穷限反常积分∫a^＋∞f（x）dx收敛且f（x）在[a,＋∞）上连续,或者无穷限反常积分∫a^＋∞f（x）dx绝对收敛时,存在数列{xn}∩[a,＋∞]且xn→＋∞（n→∞）,使limn→∞xnf（xn）=0.     

Pointwise -convergence and -convergence in measure of sequences of functions

Let be an ideal. We say that a sequence of real numbers is -convergent to if for every neighborhood U of y the set of n's satisfying y_nU is in . Basing upon this notion we define pointwise -convergence and -convergence in measure of sequences of measurable functions defined on a measure space with finite measure. We discuss the relationship between these two convergences. In particular we show that for a wide class of ideals including Erdős–Ulam ideals and summable ideals the pointwise -convergence implies the -convergence in measure. We also present examples of very regular ideals such that this implication does not hold.     

Homogenization of periodic optimal control problems via multi-scale convergence

The aim of this paper is to provide an alternate treatment of the homogenization of an optimal control problem in the framework of two-scale (multi-scale) convergence in the periodic case. The main advantage of this method is that we are able to show the convergence of cost functionals directly without going through the adjoint equation. We use a corrector result for the solution of the state equation to achieve this.     

一个新的SQP方法及其超线性收敛性

由Ｗｉｌｓｏｎ,Ｈａｎ,Ｐｏｗｅｌｌ发展的ＳＱＰ技术是解非线性规划的最有效的方法之一,但是,如果其中的二次子规划问题无可行解或者其搜索方向向量无界,该方法ａｎ和Ｂｕｒｋｅ「３」,周广路「２」分别对二次规划问题作了修正,克服了上述矛盾,本文在「２」的基础上,进上步修正,证明在Ａｒｍｉｊｏ搜索下算法具有全局收敛性,并通过解一辅助线性方程组,利用弧式搜索,得出该方法具有超线性收敛性。     

Convergence Results for Weak Efficiency in Vector Optimization Problems with Equilibrium Constraints

In this paper, we consider weak efficiency in vector optimization problems with equilibrium constraints. We obtain results on the convergence of the marginal map, the value, and the solution sets. This research was supported by Hong Kong Polytechnic University under Grant G-YY33 and by National Science Foundation of China under Grant 10401043. The authors express their gratitude to Professor Guangya Chen for careful reading of an earlier version of this paper. The authors are grateful to the anonymous referees for helpful comments and constructive suggestions.     

On the formulation and theory of the Newton interior-point method for nonlinear programming

In this work, we first study in detail the formulation of the primal-dual interior-point method for linear programming. We show that, contrary to popular belief, it cannot be viewed as a damped Newton method applied to the Karush-Kuhn-Tucker conditions for the logarithmic barrier function problem. Next, we extend the formulation to general nonlinear programming, and then validate this extension by demonstrating that this algorithm can be implemented so that it is locally and Q-quadratically convergent under only the standard Newton method assumptions. We also establish a global convergence theory for this algorithm and include promising numerical experimentation.The first two authors were supported in part by NSF Cooperative Agreement No. CCR-8809615, by Grants AFOSR 89-0363, DOE DEFG05-86ER25017, ARO 9DAAL03-90-G-0093, and the REDI Foundation. The fourth author was supported in part by NSF DMS-9102761 and DOE DE-FG02-93ER25171. The authors would like to thank Sandra Santos for painstakingly proofreading an earlier verion of this paper.     

Nonsmooth Equation Based BFGS Method for Solving KKT Systems in Mathematical Programming

In this paper, we present a BFGS method for solving a KKT system in mathematical programming, based on a nonsmooth equation reformulation of the KKT system. We split successively the nonsmooth equation into equivalent equations with a particular structure. Based on the splitting, we develop a BFGS method in which the subproblems are systems of linear equations with symmetric and positive-definite coefficient matrices. A suitable line search is introduced under which the generated iterates exhibit an approximate norm descent property. The method is well defined and, under suitable conditions, converges to a KKT point globally and superlinearly without any convexity assumption on the problem.     

Relationships between different types of initial conditions for simultaneous root finding methods

The construction of initial conditions of an iterative method is one of the most important problems in solving nonlinear equations. In this paper, we obtain relationships between different types of initial conditions that guarantee the convergence of iterative methods for simultaneously finding all zeros of a polynomial. In particular, we show that any local convergence theorem for a simultaneous method can be converted into a convergence theorem with computationally verifiable initial conditions which is of practical importance. Thus, we propose a new approach for obtaining semilocal convergence results for simultaneous methods via local convergence results.     

Active-Set Projected Trust-Region Algorithm for Box-Constrained Nonsmooth Equations

In this paper, by means of an active-set strategy, we present a trust-region method for solving box-constrained nonsmooth equations. Nice properties of the proposed method include: (a) all iterates remain feasible; (b) the search direction, as adequate combination of the projected gradient direction and the trust-region direction, is an asymptotic Newton direction under mild conditions; (c) the subproblem of the proposed method, possessing the form of an unconstrained trust-region subproblem, can be solved by existing methods; (d) the subproblem of the proposed method is of reduced dimension, which is potentially cheaper when applied to solve large-scale problems. Under appropriate conditions, we establish global and local superlinear/quadratic convergence of the method. Preliminary numerical results are given.     

On the Convergence of the Cross-Entropy Method

The cross-entropy method is a relatively new method for combinatorial optimization. The idea of this method came from the simulation field and then was successfully applied to different combinatorial optimization problems. The method consists of an iterative stochastic procedure that makes use of the importance sampling technique. In this paper we prove the asymptotical convergence of some modifications of the cross-entropy method.     

Globally and superlinearly convergent trust-region algorithm for convex SC1-minimization problems and its application to stochastic programs

A function mapping from ⁿ to is called an SC¹-function if it is differentiable and its derivative is semismooth. A convex SC¹-minimization problem is a convex minimization problem with an SC¹-objective function and linear constraints. Applications of such minimization problems include stochastic quadratic programming and minimax problems. In this paper, we present a globally and superlinearly convergent trust-region algorithm for solving such a problem. Numerical examples are given on the application of this algorithm to stochastic quadratic programs.This work was supported by the Australian Research Council.We are indebted to Dr. Xiaojun Chen for help in the computation. We are grateful to two anonymous referees for their comments and suggestions, which improved the presentation of this paper.     

An Asymptotic Expansion for Probabilities of Moderate Deviations for Multivariate Martingales

We derive formulae for probabilities of large deviations in a moderate range for multivariate martingales. Although we give an elementary proof for univariate martingales, there is no elementary extension to the multivariate case. The hard point is to produce a proper estimate for the norming factor. For this we develop a method of sequential projectors which allows us to obtain the desired natural extension of the result in the univariate case.     

On Rough ℐ2-Convergence of Double Sequences

In this study, we introduce the notion of rough ?₂-convergence and the set of rough ?₂-limit points of a double sequence and obtained two rough ?₂-convergence criteria associated with this set. Later, we proved that this set is closed and convex. Finally, we examined the relationships between the set of cluster points and the set of rough ?₂-limit points of a double sequence.