共查询到20条相似文献,搜索用时 31 毫秒
1.
The Fourier-domain Douglas–Rachford (FDR) algorithm is analyzed for phase retrieval with a single random mask. Since the uniqueness of phase retrieval solution requires more than a single oversampled coded diffraction pattern, the extra information is imposed in either of the following forms: 1) the sector condition on the object; 2) another oversampled diffraction pattern, coded or uncoded.For both settings, the uniqueness of projected fixed point is proved and for setting 2) the local, geometric convergence is derived with a rate given by a spectral gap condition. Numerical experiments demonstrate global, power-law convergence of FDR from arbitrary initialization for both settings as well as for 3 or more coded diffraction patterns without oversampling. In practice, the geometric convergence can be recovered from the power-law regime by a simple projection trick, resulting in highly accurate reconstruction from generic initialization. 相似文献
2.
ZHANG Shibin ZHANG Xinsheng & SUN Shuguang School of Management Fudan University Shanghai China Department of Mathematics Shanghai Maritime University Shanghai China 《中国科学A辑(英文版)》2006,49(9):1231-1257
The stationary Gamma-OU processes are recommended to be the volatility of the financial assets. A parametric estimation for the Gamma-OU processes based on the discrete observations is considered in this paper. The estimator of an intensity parameter A and its convergence result are given, and the simulations show that the estimation is quite accurate. Assuming that the parameter A is estimated, the maximum likelihood estimation of shape parameter c and scale parameter a, whose likelihood function is not explicitly computable, is considered. By means of the Gaver-Stehfest algorithm, we construct an explicit sequence of approximations to the likelihood function and show that it converges the true (but unkown) one. Maximizing the sequence results in an estimator that converges to the true maximum likelihood estimator and the approximation shares the asymptotic properties of the true maximum likelihood estimator. Some simulation experiments reveal that this method is still quite accurate in most of rational situations for the background of volatility. 相似文献
3.
A smoothing sample average approximation (SAA) method based on the log-exponential function is proposed for solving a stochastic mathematical program with complementarity constraints (SMPCC) considered by Birbil et al. (S. I. Birbil, G. Gürkan, O. Listes: Solving stochastic mathematical programs with complementarity constraints using simulation, Math. Oper. Res. 31 (2006), 739–760). It is demonstrated that, under suitable conditions, the optimal solution of the smoothed SAA problem converges almost surely to that of the true problem as the sample size tends to infinity. Moreover, under a strong second-order sufficient condition for SMPCC, the almost sure convergence of Karash-Kuhn-Tucker points of the smoothed SAA problem is established by Robinson’s stability theory. Some preliminary numerical results are reported to show the efficiency of our method. 相似文献
4.
Louis Tebou 《Comptes Rendus Mathematique》2009,347(13-14):779-784
We consider the heat equation with fast oscillating periodic density, and an interior control in a bounded domain. First, we prove sharp convergence estimates depending explicitly on the initial data for the corresponding uncontrolled equation; these estimates are new, and their proof relies on a judicious smoothing of the initial data. Then we use those estimates to prove that the original equation is uniformly null controllable, provided a carefully chosen extra vanishing interior control is added to that equation. This uniform controllability result is the first in the multidimensional setting for the heat equation with oscillating density. Finally, we prove that the sequence of null controls converges to the optimal null control of the limit equation when the period tends to zero. To cite this article: L. Tebou, C. R. Acad. Sci. Paris, Ser. I 347 (2009). 相似文献
5.
6.
Abstract This article discusses the convergence of the Gibbs sampling algorithm when it is applied to the problem of outlier detection in regression models. Given any vector of initial conditions, theoretically, the algorithm converges to the true posterior distribution. However, the speed of convergence may slow down in a high-dimensional parameter space where the parameters are highly correlated. We show that the effect of the leverage in regression models makes very difficult the convergence of the Gibbs sampling algorithm in sets of data with strong masking. The problem is illustrated with examples. 相似文献
7.
Jin-bao Jian Xiao-yan Ke Hai-yan Zheng Chun-ming Tang 《Journal of Computational and Applied Mathematics》2009
Based on the ideas of norm-relaxed sequential quadratic programming (SQP) method and the strongly sub-feasible direction method, we propose a new SQP algorithm for the solution of nonlinear inequality constrained optimization. Unlike the previous work, at each iteration, the norm-relaxed quadratic programming subproblem (NRQPS) in our algorithm only consists of the constraints corresponding to an estimate of the active set, and the high-order correction direction (used to avoid the Maratos effect) is obtained by solving a system of linear equations (SLE) which also only consists of such a subset of constraints and gradients. Moreover, the line search technique can effectively combine the initialization process with the optimization process, and therefore (if the starting point is not feasible) the iteration points always get into the feasible set after a finite number of iterations. The global convergence is proved under the Mangasarian–Fromovitz constraint qualification (MFCQ), and the superlinear convergence is obtained without assuming the strict complementarity. Finally, the numerical experiments show that the proposed algorithm is effective and promising for the test problems. 相似文献
8.
《Journal of Computational and Applied Mathematics》2012,236(5):621-630
The IDR() method proposed by Sonneveld and van Gijzen is an effective method for solving nonsymmetric linear systems, but usually with irregular convergence behavior. In this paper, we reformulate the relations of residuals and their auxiliary vectors generated by the IDR() method in matrix form. Then, using this new formulation and motivated by other QMR-type methods, we propose a variant of the IDR() method, called QMRIDR(), for overcoming the disadvantage of its irregular convergence behavior. Both fast and smooth convergence behaviors of the QMRIDR() method can be shown. Numerical experiments are reported to show the efficiency of our proposed method. 相似文献
9.
Edilson F. Arruda Fabrício O. Ourique Jason LaCombe Anthony Almudevar 《European Journal of Operational Research》2013
This work proposes an algorithm that makes use of partial information to improve the convergence properties of the value iteration algorithm in terms of the overall computational complexity. The algorithm iterates on a series of increasingly refined approximate models that converges to the true model according to an optimal linear rate, which coincides with the convergence rate of the original value iteration algorithm. The paper investigates the properties of the proposed algorithm and features a series of switchover queue examples which illustrates the efficacy of the method. 相似文献
10.
Hiroyuki Moriyama Nobuo Yamashita Masao Fukushima 《Computational Optimization and Applications》2003,26(2):107-141
In this paper, we consider the Extended Kalman Filter (EKF) for solving nonlinear least squares problems. EKF is an incremental iterative method based on Gauss-Newton method that has nice convergence properties. Although EKF has the global convergence property under some conditions, the convergence rate is only sublinear under the same conditions. One of the reasons why EKF shows slow convergence is the lack of explicit stepsize. In the paper, we propose a stepsize rule for EKF and establish global convergence of the algorithm under the boundedness of the generated sequence and appropriate assumptions on the objective function. A notable feature of the stepsize rule is that the stepsize is kept greater than or equal to 1 at each iteration, and increases at a linear rate of k under an additional condition. Therefore, we can expect that the proposed method converges faster than the original EKF. We report some numerical results, which demonstrate that the proposed method is promising. 相似文献
11.
对图像与信号处理中遇到的一类齐次多项式优化问题,本文首先借助平移技术将目标函数转化为凸函数,然后结合初始点技术提出了求解该类问题的一个全局优化算法.与求解该类问题的幂方法相比,本文给出的方法不但能在一般情形下保证算法的全局收敛性,而且数值结果表明在多数情况下可以得到问题的一个全局最优值解. 相似文献
12.
Regina S. Burachik Alfredo N. Iusem Jefferson G. Melo 《Journal of Global Optimization》2010,46(3):347-361
We apply a modified subgradient algorithm (MSG) for solving the dual of a nonlinear and nonconvex optimization problem. The
dual scheme we consider uses the sharp augmented Lagrangian. A desirable feature of this method is primal convergence, which means that every accumulation point of a primal sequence (which is automatically generated during the process), is
a primal solution. This feature is not true in general for available variants of MSG. We propose here two new variants of
MSG which enjoy both primal and dual convergence, as long as the dual optimal set is nonempty. These variants have a very
simple choice for the stepsizes. Moreover, we also establish primal convergence when the dual optimal set is empty. Finally,
our second variant of MSG converges in a finite number of steps. 相似文献
13.
Ali Foroush Bastani Mahdieh Tahmasebi 《Journal of Computational and Applied Mathematics》2012,236(7):1903-1918
In this paper, we are concerned with the numerical approximation of stochastic differential equations with discontinuous/nondifferentiable drifts. We show that under one-sided Lipschitz and general growth conditions on the drift and global Lipschitz condition on the diffusion, a variant of the implicit Euler method known as the split-step backward Euler (SSBE) method converges with strong order of one half to the true solution. Our analysis relies on the framework developed in [D. J. Higham, X. Mao and A. M. Stuart, Strong convergence of Euler-type methods for nonlinear stochastic differential equations, SIAM Journal on Numerical Analysis, 40 (2002) 1041-1063] and exploits the relationship which exists between explicit and implicit Euler methods to establish the convergence rate results. 相似文献
14.
An interior Newton method for quadratic programming 总被引:2,自引:0,他引:2
We propose a new (interior) approach for the general quadratic programming problem. We establish that the new method has strong
convergence properties: the generated sequence converges globally to a point satisfying the second-order necessary optimality
conditions, and the rate of convergence is 2-step quadratic if the limit point is a strong local minimizer. Published alternative
interior approaches do not share such strong convergence properties for the nonconvex case. We also report on the results
of preliminary numerical experiments: the results indicate that the proposed method has considerable practical potential.
Received October 11, 1993 / Revised version received February 20, 1996
Published online July 19, 1999 相似文献
15.
基于已有文献的研究成果及前期工作,我们考察了非线性弱奇性Volterra积分方程(VIE)的谱配置法,并对该方法进行了收敛性分析.得到的结论是数值误差呈谱收敛.误差收敛阶与配置点个数及方程解的正则性相关.数值实验也证实了这一结论.本文的方法解决了已有文献中类似数值方法(Allaei(2016),Sohrabi(2017))存在的问题. 相似文献
16.
Fenghui Wang 《Numerical Algorithms》2018,77(3):925-938
In this paper, we are concerned with the split feasibility problem (SFP) whenever the convex sets involved are composed of level sets. By applying Polyak’s gradient method, we get a new and simple algorithm for such a problem. Under standard assumptions, we prove that the whole sequence generated by the algorithm weakly converges to a solution. We also modify the proposed algorithm and state the strong convergence without regularity conditions on the sets involved. Numerical experiments are included to illustrate its applications in signal processing. 相似文献
17.
The space-time fractional diffusion-wave equation (FDWE) is a generalization of classical diffusion and wave equations which is used in modeling practical phenomena of diffusion and wave in fluid flow, oil strata and others. This paper reports an accurate spectral tau method for solving the two-sided space and time Caputo FDWE with various types of nonhomogeneous boundary conditions. The proposed method is based on shifted Legendre tau (SLT) procedure in conjunction with the shifted Legendre operational matrices of Riemann-Liouville fractional integral, left-sided and right-sided fractional derivatives. We focus primarily on implementing this algorithm in both temporal and spatial discretizations. In addition, convergence analysis is provided theoretically for the Dirichlet boundary conditions, along with graphical analysis for several special cases using other conditions. These suggest that the Legendre Tau method converges exponentially provided that the data in the given FDWE are smooth. Finally, several numerical examples are given to demonstrate the high accuracy of the proposed method. 相似文献
18.
Xiu Yang Xiaoyun Jiang Hui Zhang 《Mathematical Methods in the Applied Sciences》2019,42(18):6475-6489
The object of this paper is to present the numerical solution of the time‐space fractional telegraph equation. The proposed method is based on the finite difference scheme in temporal direction and Fourier spectral method in spatial direction. The fast Fourier transform (FFT) technique is applied to practical computation. The stability and convergence analysis are strictly proven, which shows that this method is stable and convergent with (2?α) order accuracy in time and spectral accuracy in space. Moreover, the Levenberg‐Marquardt (L‐M) iterative method is employed for the parameter estimation. Finally, some numerical examples are given to confirm the theoretical analysis. 相似文献
19.
Han-Fu Chen Hai-Tao Fang Li-Li Zhang 《Journal of Mathematical Analysis and Applications》2011,382(2):822-842
The principal component analysis is to recursively estimate the eigenvectors and the corresponding eigenvalues of a symmetric matrix A based on its noisy observations Ak=A+Nk, where A is allowed to have arbitrary eigenvalues with multiplicity possibly bigger than one. In the paper the recursive algorithms are proposed and their ordered convergence is established: It is shown that the first algorithm a.s. converges to a unit eigenvector corresponding to the largest eigenvalue, the second algorithm a.s. converges to a unit eigenvector corresponding to either the second largest eigenvalue in the case the largest eigenvalue is of single multiplicity or the largest eigenvalue if the multiplicity of the largest eigenvalue is bigger than one, and so on. The convergence rate is also derived. 相似文献
20.
Randall J. Leveque 《纯数学与应用数学通讯》1984,37(4):463-477
A natural generalization of Godunov's method for Courant numbers larger than 1 is obtained by handling interactions between neighboring Riemann problems linearly, i.e., by allowing waves to pass through one another with no change in strength or speed. This method is well defined for arbitrarily large Courant numbers and can be written in conservation form. It follows that if a sequence of approximations converges to a limit u(x,t) as the mesh is refined, then u is a weak solution to the system of conservation laws. For scalar problems the method is total variation diminishing and every sequence contains a convergent subsequence. It is conjectured that in fact every sequence converges to the (unique) entropy solution provided the correct entropy solution is used for each Riemann problem. If the true Riemann solutions are replaced by approximate Riemann solutions which are consistent with the conservation law, then the above convergence results for general systems continue to hold. 相似文献