搜索结果: 1-15 共查到“信息科学与系统科学 convergence”相关记录19条 . 查询时间(0.125 秒)
A Distributed Algorithm with Linear Convergence for Maximum Lifetime Routing in Wireless Networks
Linear Convergence Lifetime Routing
2015/6/19
A wireless sensor network of nodes with limited energy is considered. The problem of computing a routing flow that maximizes the network lifetime is formulated as a linear program. We consider a conve...
Consensus and Products of Random Stochastic Matrices: Exact Rate for Convergence in Probability
Consensus consensus+innovations performance analysis random network convergence in probability exponential rate
2012/3/1
Distributed consensus and other linear systems with system stochastic matrices $W_k$ emerge in various settings, like opinion formation in social networks, rendezvous of robots, and distributed infere...
Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Trees
belief propagation max product min sum LDPC codes linear programming decoding
2011/9/9
Abstract: Applying the max-product (and belief-propagation) algorithms to loopy graphs is now quite popular for best assignment problems. This is largely due to their low computational complexity and ...
ON THE BEST UNIFORM CONVERGENCE RATE OF EB ESTIMATORS
Empirical Bayes estimators best uniform
2007/12/17
In this paper the authors prove that the best uniform convergence rate of EB estimators of the parameter θin uniform distribution family U(0,θ) cannot reach 1 under conditions weaker than Tao Bo's[5]....
ON CONVERGENCE AND RATE OF CONVERGENCE OF ALGORITHMS IN THE MOVER-STAYER MODEL
Mover-stayer model algorithms converge
2007/12/17
The convergence and rate of convergence of an iterative method of Wang and Scott[1] for obtaining maximum likelihood estimates for contingency tables derived from a mover-stayer model are discussed.
OPTIMAL GLOBAL RATES OF CONVERGENCE OF M-ESTIMATES FOR NONPARAMETRIC REGRESSION
Nonparametric regression optimal rate o
2007/12/17
Let (X, Y) be a pair of random variables such that X ranges over [0, 1] and Y is real-valued and let go(X) be the conditional expectation of Y given X. Based on a training sample, the piecewise polyno...
SECOND-ORDER CONVERGENCE PROPERTIES OF TRUST-REGION METHODS USINGINCOMPLETE CURVATURE INFORMATION, WITH AN APPLICATION TO MULTIGRID OPTIMIZATION
Nonlinear optimization Convergence to local minimizers Multilevel problems
2007/12/11
Convergence properties of trust-region methods for unconstrained nonconvex
optimization
is considered in the case where information on the objective function's local
curvature is incomplete, in the...
OPTIMAL RATE OF CONVERGENCE FOR ESTIMATORS IN THE NONPARAMETRIC MEDIAN MODEL
Optimal rate of convergence nonparametri
2007/12/10
摘要 Let (Y,X) be a random vector with its value in R~1×R~d,d\le 1. Let \Theta be the collection of real valued functions θ(x) on R~d which is p times differ-entiable at x=0 and p-1 times differentiable...
THE CONVERGENCE OF BROYDEN ALGORITHMS WITHOUT CONVEXITY ASSUMPTION
Broyden algorithms convergence convexi
2007/12/10
摘要 In this paper we discuss the convergence of the Broyden algorithms without convexity and exact line search assumptions. We proved that if the objective function is suitably smooth and the algorithm...
Convergence Properties of the Dependent PRP Conjugate Gradient Methods
Conjugate gradient convergence property
2007/8/7
In this paper, a new region of βk with respect to βkPRP is given. With two Armijo-type line searches, the authors investigate the global convergence properties of the dependent PRP conjugate gradient ...
For unconstrained optimization, a new hybrid projection algorithm is presented in the paper. This algorithm has some attractive convergence properties. onvergence theory can be obtained under the co...
A VARIATION OF GOLDFARB'S METHOD FOR LINEARLY CONSTRAINED OPTIMIZATION PROBLEMS AND ITS SUPERLINEAR CONVERGENCE RATE
Conjugate projection superlinear conver
2007/8/7
This paper presents a variant algorithm of Goldfarb's method for linearly constrained optimization problems. In the variant algorithm, we introduce a concept called conjugate projection, which differs...
A NEW SUFFICIENT CONDITION FOR THE CONVERGENCE OF THE DFP ALGORITHM WITH WOLFE LINE SEARCH
Global convergence DFP algorithm Wolfe
2007/8/7
The DFP algorithm is one of the mest famous numerical algorithms for unconstrained optimization.It is an open problem whether DFP algorithm with inexact line searches is globally convergent. In this p...
CONVERGENCE PROPERTIES OF CONJUGATE GRADIENT METHODS WITH STRONG WOLFE LINESEARCH
Conjugate gradient algorithms global co
2007/8/7
In this paper, we investigate the convergence property of the conjugate gradient algorithms which depend on the search directionsd_1=-g_1, d_{k+1}=-g_{k+1}+\beta_k d_k ,k\geq 1, by using different cho...
In order to construct more efficient methods for unconstrained optimization problems, several authors have considered more general functions than quadratic functionsas a basis for conjugate gradient m...