A Revised Duality Proof of Sampling Localization in Relaxation Spectrum Recovery
نویسندگان
چکیده
The duality proof of sampling localization given by Loy, Newbury, Anderssen and Davies in 2001 contains an oversight, as the classes of functions chosen do not assume the compact support. Here, it is shown how a minor change to the argument there yields a precise conclusion. 2000 Mathematics subject classification: 76A05, 46F12, 65R32.
منابع مشابه
MAT 585: Exact Recovery of the Semidefinite Relaxation for Stochastic Block Model
Today we consider a semidefinite programming relaxation algorithm for SBM and derive conditions for exact recovery. The main ingredient for the proof will be duality theory.
متن کاملSimple moving-average formulae for the direct recovery of the relaxation spectrum
Different software packages are available commercially which can be applied to oscillatory shear data to recover an estimate of the relaxation spectrum of the viscoelastic material tested. The underlying algorithms, based on some form of regularization, are indirect and technically involved. Davies and Anderssen @J. Non-Newtonian Fluid Mech. 73, 163–179 ~1997!# have derived exact sampling local...
متن کاملFuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma
The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.
متن کاملRobust Sparse Signal Recovery for Compressed Sensing with Sampling and Dictionary Uncertainties
Compressed sensing (CS) shows that a signal having a sparse or compressible representation can be recovered from a small set of linear measurements. In classical CS theory, the sampling matrix and dictionary are assumed be known exactly in advance. However, uncertainties exist due to sampling distortion, finite grids of the parameter space of dictionary, etc. In this paper, we take a generalize...
متن کاملApplying High Performance Computing to Multi-Area Stochastic Unit Commitment for Renewable Penetration
We present a parallel implementation of a Lagrangian relaxation algorithm for solving stochastic unit commitment subject to uncertainty in wind power supply and generator and transmission line failures. We present a scenario selection algorithm inspired by importance sampling in order to formulate the stochastic unit commitment problem and validate its performance by comparing it to a stochasti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009