求解广义线性互补问题的光滑牛顿法(英文)

The extended linear complementarity problem(denoted by ELCP) can be reformulated as the solution of a nonsmooth system of equations. By the symmetrically perturbed CHKS smoothing function, the ELCP is approximated by a family of parameterized smooth equations. A one-step smoothing Newton method is designed for solving the ELCP. The proposed algorithm is proved to be globally convergent under suitable assumptions.     

随机线性二次最优控制:从离散到连续时间模型

在一般情形下,分析了离散时间LQ问题与连续时间情形两者之间的自然联系.首先回顾了连续时间和离散时间随机LQ问题及对应Riccati微分/差分方程的相关结论.接下来在假设Riccati微分方程有解的前提下,证明了离散化步长足够小时,Riccati差分方程有解.然后针对连续和离散时间模型,采用配对问题最优控制的反馈形式,分别构造了一个辅助反馈控制,并证明该控制可驱使对应模型的性能指标逼近于配对问题的值函数,以此得到了关于两个模型之间联系的初步结论.最后藉由前述结论以及控制问题的特性,揭晓了连续时间和离散时间模型之间的自然联系,并给出了Riccati差分方程和微分方程的解之间的误差估计.由此联系,可构造相应离散系统和LQ问题,以适当的阶估计连续时间LQ问题的解,抑或为离散时间模型构造一个近似最优控制.无论哪种思路,都旨在降低直接求解原问题的难度和复杂性.     

一类随机线性互补问题的求法

考虑一类随机互线性补问题的求解方法,目的是通过定义NCP函数来使正则化期望残差最小化.通过拟蒙洛包洛方法产生一系列观察值并且证得离散近似问题最小值解的聚点就是相应随机线性互补问题的期望残差最小值ERM,同时得到利用ERM到解为有界的充分条件.进一步证明ERM法能够得到具有稳定性和最小灵敏度的稳健解.     

反射的椭圆随机偏微分方程的网格逼近

研究了由可乘噪声驱动的反射的椭圆随机偏微分方程网格近似解的收敛性,其中考虑区域D:=(0,1)~d,d=1,2,3.此外,还研究确定的椭圆障碍问题离散格式的解存在唯一性,并得到解关于障碍函数的连续依赖性和收敛性.     

随机P矩阵和随机P0矩阵线性互补问题

定义了随机P矩阵和随机P0矩阵,给出了矩阵为随机P矩阵或随机P0矩阵的充要条件.研究了随机线性互补问题(SLCP)的矩阵为随机P矩阵时,期望残差方法(ERM)解集的有界性.得到了期望矩阵为P矩阵时,(ERM)解集非空有界.并且研究离散情形(ERM)与期望值方法(EV)解的关系,给出了(ERM)解唯一的条件.     

线性互补问题与多目标优化

本文研究了求解线性互补问题的一类新方法:把线性互补问题转化为多目标优化问题,利用多目标优化有效解的定义,给出了零有效解的概念;进而获得多目标优化问题的零有效解就是线性互补问题的最优解.最后给出了有解、无解线性互补问题,并分别把这些问题转化为多目标优化,采用极大极小方法求解转化后的多目标优化问题.数值实验结果表明了该方法的正确性和有效性,完善了文献[19]的数值结果.     

半参数变系数异方差部分线性模型下的经验似然

Consider the semiparametric varying-coefficient heteroscedastic partially linear model Y i = Xτiβ + Zτiα(Ti) + σiei,1 ≤ i ≤ n,where σ 2 i = f(Ui),β is a p × 1 column vector of unknown parameter,(Xi,Zi,Ti,Ui) are random design points,Y i are the response variables,α(·) is a q-dimensional vector of unknown functions,e i are random errors.For both cases that f(·) is known and unknown,we propose the empirical log-likelihood ratio statistics for the parameter β.For each case,a nonparametric version of Wilks’ theorem is derived.The results are then used to construct confidence regions of the parameter.Simulation studies are carried out to assess the performance of the empirical likelihood method.     

$P_*(\kappa)$线性互补问题的Mehrotra型预估-校正算法

Mehrotra-type predictor-corrector algorithm,as one of most efficient interior point methods,has become the backbones of most optimization packages.Salahi et al.proposed a cut strategy based algorithm for linear optimization that enjoyed polynomial complexity and maintained its efficiency in practice.We extend their algorithm to P_*（κ）linear complementarity problems.The way of choosing corrector direction for our algorithm is different from theirs. The new algorithm has been proved to have an ο(（1+4κ）（17+19κ） √（1+2κn）^3/2log[（x⁰）^Ts⁰/ε] worst case iteration complexity bound.An numerical experiment verifies the feasibility of the new algorithm.     

非凸变分不等式的隐式迭代算法

1引言变分问题是运筹学与计算数学的一个交叉研究领域.它与数学领域的其它分支如非线性规划、极大极小、不动点理论等有紧密联系,在力学、工程、经济、交通等许多实际部门有广泛的应用。但目前国内外的变分问题的理论与算法的大部分结论都是在凸锥的条件下得到的,这些结论不能直接用于非凸集上的变分问题,因为这些结论大部分都是建立在投影算子在凸集上的性质上的.     

Expected Residual Minimization Method for Stochastic Variational Inequality Problems

This paper considers a stochastic variational inequality problem (SVIP). We first formulate SVIP as an optimization problem (ERM problem) that minimizes the expected residual of the so-called regularized gap function. Then, we focus on a SVIP subclass in which the function involved is assumed to be affine. We study the properties of the ERM problem and propose a quasi-Monte Carlo method for solving the problem. Comprehensive convergence analysis is included as well. This work was supported in part by SRF for ROCS, SEM and Project 10771025 supported by NSFC.     

Convergence Results of the ERM Method for Nonlinear Stochastic Variational Inequality Problems

This paper considers the expected residual minimization (ERM) method proposed by Luo and Lin (J. Optim. Theory Appl. 140:103–116, 2009) for a class of stochastic variational inequality problems. Different from the work mentioned above, the function involved is assumed to be nonlinear in this paper. We first consider a quasi-Monte Carlo method for the case where the underlying sample space is compact and show that the ERM method is convergent under very mild conditions. Then, we suggest a compact approximation approach for the case where the sample space is noncompact. This work was supported in part by Project 10771025 supported by NSFC and SRFDP 20070141063 of China.     

关于线性互补问题解的存在性

讨论线性互补问题解的存在性。证明关于解的唯一性定理。用反例表明:对于线性互补问题解的存在性,"M是半正定矩阵"既不是充分条件,也不是必要条件。     

求解一类非单调线性互补问题的宽邻域内点方法及其计算复杂性

对于一类非单调线性互补问题给出了一种新的算法——宽邻域内点算法，并讨论了其计算复杂性。     

弹塑性问题线性互补方程的凝缩解法

本文提出了将由变分不等方程导出的弹塑性问题的线性互补方程采用凝缩求解的方法,在避免了迭代计算所节省的时间之外又进一步大大节省了计算时间,极大地提高了对大型结构进行弹塑性分析的效率。     

一种无约束全局优化的水平值下降算法

本文研究无约束全局优化问题,建立了一种新的水平值下降算法(Level-value Descent Method,LDM).讨论并建立了概率意义下取全局最小值的一个充分必要条件,证明了算法LDM是依概率测度收敛的.这种LDM算法是基于重点度取样(Improtance Sampling)和Markov链Monte-Carlo随机模拟实现的,并利用相对熵方法(TheCross-Entropy Method)自动更新取样密度,算例表明LDM算法具有较高的数值精度和较好的全局收敛性.     

Stochastic Linear Quadratic Optimal Control Problems

This paper is concerned with the stochastic linear quadratic optimal control problem (LQ problem, for short) for which the coefficients are allowed to be random and the cost functional is allowed to have a negative weight on the square of the control variable. Some intrinsic relations among the LQ problem, the stochastic maximum principle, and the (linear) forward—backward stochastic differential equations are established. Some results involving Riccati equation are discussed as well. Accepted 15 May 2000. Online publication 1 December 2000     

随机线性不等式组的确定性等价式

在大量的决策问题中，经常会出现含有随机变量的不等式或不等式组。把这类含有随机变理的模型转化成确定性的模型是解决问题的重要途径。它们在随机控制和不完全信息群体决策随机决策问题中起着重要的作用。因此，如何将随机不等林或随机不等式组转化为相应的确定性等价式的问题受到人们的关注。本文对含有确定分布的随机变量的线性不等式组，就其相应的概率表达式作出分类，并根据其左端系数矩阵和右端向量含有随机因素的情形分别进行讨论，系统地导出了它们相应的确定性等价式。     

Feasible Semismooth Newton Method for a Class of Stochastic Linear Complementarity Problems

We consider a class of stochastic linear complementarity problems (SLCPs) with finitely many realizations. In this paper we reformulate this class of SLCPs as a constrained minimization (CM) problem. Then, we present a feasible semismooth Newton method to solve this CM problem. Preliminary numerical results show that this CM reformulation may yield a solution with high safety for SLCPs.