منابع مشابه
Low complexity secant quasi-Newton minimization algorithms for nonconvex functions
In this work some interesting relations between results on basic optimization and algorithms for nonconvex functions (such as BFGS and secant methods) are pointed out. In particular, some innovative tools for improving our recent secant BFGS-type and LQN algorithms are described in detail. © 2006 Elsevier B.V. All rights reserved. MSC: 51M04; 65H20; 65F30; 90C53
متن کاملDon't Care Minimization of BMDs: Complexity and Algorithms
We present for the first time methods to minimize *BMDs exploiting don’t care conditions. These minimization methods can be used during the verification of circuits by *BMDs. By changing function values for input vectors, which are in the don’t care set, smaller *BMDs can be computed to keep peak memory consumption during *BMD construction as low as possible. We determine the complexity of the ...
متن کاملLow Complexity Methods For Discretizing Manifolds Via Riesz Energy Minimization
Let A be a compact d-rectifiable set embedded in Euclidean space R, d ≤ p. For a given continuous distribution σ(x) with respect to d-dimensional Hausdorff measure on A, our earlier results provided a method for generating N -point configurations on A that have asymptotic distribution σ(x) as N →∞; moreover such configurations are “quasi-uniform” in the sense that the ratio of the covering radi...
متن کاملCrowdsourcing: Low complexity, Minimax Optimal Algorithms
We consider the problem of accurately estimating the reliability of workers based on noisy labels they provide, which is a fundamental question in crowdsourcing. We propose a novel lower bound on the minimax estimation error which applies to any estimation procedure. We further propose Triangular Estimation (TE), an algorithm for estimating the reliability of workers. TE has low complexity, may...
متن کاملLow-Complexity Reduced-Rank Beamforming Algorithms
A reduced-rank framework with set-membership filtering (SMF) techniques is presented for adaptive beamforming problems encountered in radar systems. We develop and analyze stochastic gradient (SG) and recursive least squares (RLS)-type adaptive algorithms, which achieve an enhanced convergence and tracking performance with low computational cost as compared to existing techniques. Simulations s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Linear Algebra with Applications
سال: 2005
ISSN: 1070-5325,1099-1506
DOI: 10.1002/nla.449