非线性l1问题的光滑近似算法

为非线性l1问题的求解构造了光滑逼近函数.首先将非线性l1问题转化为等价的不可微优化问题;其次通过两步提出光滑逼近函数的一般性构造方法;最后进行了数值仿真.文中介绍了光滑逼近函数的有关性质,指出相关文献已有的光滑函数方法是本文的特例,并证明了方法的收敛性及有效性.     

基于光滑化方法求解非线性l1问题

讨论了求解非线性l1问题的一种新的光滑函数法.通过对非线性l1问题模型的转化,将该问题化为一个不可微优化问题,据此提出了基于BFGS迭代的非线性l1问题的光滑函数法,介绍了非线性l1问题的光滑函数的有关性质、算法步骤及其收敛性.数值仿真显示了提出的光滑函数方法可以避免数值计算的溢出,具有一定的有效性.     

On a differential-algebraic problem

The method of quasilinearization is a procedure for obtaining approximate solutions of differential equations. In this paper, this technique is applied to a differential-algebraic problem. Under some natural assumptions, monotone sequences converge quadratically to a unique solution of our problem.     

A primal interior point method for the linear semidefinite programming problem

The linear semidefinite programming problem is examined. A primal interior point method is proposed to solve this problem. It extends the barrier-projection method used for linear programs. The basic properties of the proposed method are discussed, and its local convergence is proved.     

A splitting method for quadratic programming problem

1. IntroductionThe quadratic programming (QP) problem is the most simple one in nonlinear pro-gramming and plays a very important role in optimization theory and applications.It is well known that matriX splitting teChniques are widely used for solving large-scalelinear system of equations very successfully. These algorithms generate an infinite sequence,in contrast to the direct algorithms which terminate in a finite number of steps. However,iterative algorithms are considerable simpler tha…     

一类特殊优化问题的光滑梯度法

对一类在压缩感知、图像处理等相关领域有广泛应用的特殊非光滑优化问题进行了研究,给出了求解此类问题的光滑梯度法及算法的全局收敛性证明,相关的数值实验表明算法的有效性.     

A projection and contraction method for symmetric cone complementarity problem

ABSTRACT

This paper considers the symmetric cone complementarity problem. A new projection and contraction method is presented which only requires some projection calculations and functional computations. It is proved that the iteration sequence produced by the proposed method converges to a solution of the symmetric cone complementarity problem under the condition that the underlying transformation is monotone. Numerical experiments also show the effectiveness of this method.     

A C0 finite element method for the biharmonic problem without extrinsic penalization

A symmetric C ⁰ finite element method for the biharmonic problem is constructed and analyzed. In our approach, we introduce one‐sided discrete second‐order derivatives and Hessian matrices to formulate our scheme. We show that the method is stable and converge with optimal order in a variety of norms. A distinctive feature of the method is that the results hold without extrinsic penalization of the gradient across interelement boundaries. Numerical experiments are given that support the theoretical results, and the extension to Kirchhoff plates is also discussed. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 1254–1278, 2014     

Numerical solution of a relaxed control problem by the epsilon method

A relaxed control problem is solved using the epsilon method of Balakrishnan. The singularity of the problem with respect to one of the controls presents no difficulty. However, solutions are sensitive to the initial guess of the states and controls. For a system with true dynamics, terminal conditions may generally be approximated, but cannot be satisfied exactly.This paper is based on the MS Thesis of K. Shmueli at the Department of Aeronautical Engineering, Technion-Israel Institute of Technology, Haifa, Israel.     

一种求解非线性互补问题的filter内点算法

利用Armijio条件和信赖域方法,构造新的价值函数.首次将内点算法与filter技术结合起来,提出一种求解非线性互补问题的新算法,即filter内点算法.在主算法中使用Armijio型线搜索求取步长,在修复算法中使用信赖域方法进行适当控制以保证算法的收敛性.文章还讨论了算法的全局收敛性.最后用数值实验表明了该方法是有效的.     

On a multi-channel change-point problem

A continuous change-point problem is studied in which N independent diffusion processes X _j are observed. Each process X _j is associated with a “channel”, each has an unknown piecewise constant drift and the unit diffusion coefficient. All the channels are connected only by a common change-point of drift. As the result, a change-point problem is defined in which the unknown and unidentifiable drift forms a 2N-dimensional nuisance parameter. The asymptotics of the minimax rate in estimating the change-point is studied as N → ∞. This rate is compared with the case of the known drift. This problem is a special case of an open change-point detection problem in the high-dimensional diffusion with nonparametric drift.      

关于求解变分不等式问题的2-次梯度外梯度算法收敛性的一个补注

Yair Censor,Aviv Gibali和Simeon Reich为求解变分不等式问题提出了2-次梯度外梯度算法。关于此算法的收敛性,作者给出了部分证明,有一个问题：由算法产生的迭代点列能否收敛到变分不等式问题的一个解上,没有得到解决。此问题作为一个公开问题在文章“Extensions of Korpelevich's extragradient method for the variational inequalityproblem in Euclidean space”(Optimization,61(9)：1119-1132,2012)中被提出。在这篇简短的补注性文章中,对所提出的问题给出了答案：由算法产生的迭代点列能收敛到变分不等式问题的一个解上。给出2-次梯度外梯度算法的全局收敛性的一个完整证明,证明了从任意起始点开始,由算法产生的迭代点列都能收敛到变分不等式问题的一个解上。     

A non-interior-point smoothing method for variational inequality problem

In this paper, we focus on the variational inequality problem. Based on the Fischer-Burmeister function with smoothing parameters, the variational inequality problem can be reformulated as a system of parameterized smooth equations, a non-interior-point smoothing method is presented for solving the problem. The proposed algorithm not only has no restriction on the initial point, but also has global convergence and local quadratic convergence, moreover, the local quadratic convergence is established without a strict complementarity condition. Preliminary numerical results show that the algorithm is promising.     

An 12 constrained best approximation problem

A problem of minimizing a quadratic function over the unit ball of l₂is considered,the motivation being a minimum norm problem for the heat equation controlled by the constrained initial condition. A constructive method for finding an ?-solution is developed and its convergence rate is estimated. The dependence of the solution, on the data is studied.     

A modified SQP-filter method for nonlinear complementarity problem

The nonlinear complementarity problem can be reformulated as a nonlinear programming. For solving nonlinear programming, sequential quadratic programming (SQP) type method is very effective. Moreover, filter method, for its good numerical results, are extensively studied to handle nonlinear programming problems recently. In this paper, a modified quadratic subproblem is proposed. Based on it, we employ filter technique to tackle nonlinear complementarity problem. This method has no demand on initial point. The restoration phase, which is always used in traditional filter method, is not needed. Global convergence results of the proposed algorithm are established under suitable conditions. Some numerical results are reported in this paper.     

Numerical solution of a mixed singularly perturbed parabolic-elliptic problem

A one-dimensional singularly perturbed problem of mixed type is considered. The domain under consideration is partitioned into two subdomains. In the first subdomain a parabolic reaction-diffusion problem is given and in the second one an elliptic convection-diffusion-reaction problem. The solution is decomposed into regular and singular components. The problem is discretized using an inverse-monotone finite volume method on condensed Shishkin meshes. We establish an almost second-order global pointwise convergence in the space variable, that is uniform with respect to the perturbation parameter.     

Local convergence in a generalized Fermat-Weber problem

In the Fermat-Weber problem, the location of a source point in ^N is sought which minimizes the sum of weighted Euclidean distances to a set of destinations. A classical iterative algorithm known as the Weiszfeld procedure is used to find the optimal location. Kuhn proves global convergence except for a denumerable set of starting points, while Katz provides local convergence results for this algorithm. In this paper, we consider a generalized version of the Fermat-Weber problem, where distances are measured by anl _p norm and the parameterp takes on a value in the closed interval [1, 2]. This permits the choice of a continuum of distance measures from rectangular (p=1) to Euclidean (p=2). An extended version of the Weiszfeld procedure is presented and local convergence results obtained for the generalized problem. Linear asymptotic convergence rates are typically observed. However, in special cases where the optimal solution occurs at a singular point of the iteration functions, this rate can vary from sublinear to quadratic. It is also shown that for sufficiently large values ofp exceeding 2, convergence of the Weiszfeld algorithm will not occur in general.     

A parameter robust numerical method for a two dimensional reaction-diffusion problem

In this paper a singularly perturbed reaction-diffusion partial differential equation in two space dimensions is examined. By means of an appropriate decomposition, we describe the asymptotic behaviour of the solution of problems of this kind. A central finite difference scheme is constructed for this problem which involves an appropriate Shishkin mesh. We prove that the numerical approximations are almost second order uniformly convergent (in the maximum norm) with respect to the singular perturbation parameter. Some numerical experiments are given that illustrate in practice the theoretical order of convergence established for the numerical method.

     

A UNIFORM NUMERICAL METHOD FOR QUASILINEAR SINGULAR PERTURBATION PROBLEM WITH A TURNING POINT

A nonlinear difference scheme is given for solving a quasilinear siagularly perturbed two-point boundary value problem with a turning point. The method uses non-equidistant discretization meshes. The solution of the scheme is shown to be first order accurate in the discrete L^∞ norm, uniformly in the perturbation parameter.     

On the numerical approach of the enthalpy method for the Stefan problem

In this article an error bound is derived for a piecewise linear finite element approximation of an enthalpy formulation of the Stefan problem; we have analyzed a semidiscrete Galerkin approximation and completely discrete scheme based on the backward Euler method and a linearized scheme is given and its convergence is also proved. A second‐order error estimates are derived for the Crank‐Nicolson Galerkin method. In the second part, a new class of finite difference schemes is proposed. Our approach is to introduce a new variable and transform the given equation into an equivalent system of equations. Then, we prove that the difference scheme is second order convergent. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2004