Iterative Selection of Unknown Weights in Direct Weight Optimization Identification
نویسندگان
چکیده
منابع مشابه
Weights in block iterative methods
In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibil...
متن کاملDirect Weight Optimization in Statistical Estimation and System Identification
The Direct Weight Optimization (DWO) approach to statistical estimation and the application to nonlinear system identification has been proposed and developed during the last few years. Computationally, the approach is typically reduced to a convex (e.g., quadratic or conic) program, which can be solved efficiently. The optimality or sub-optimality of the obtained estimates, in a minimax sense ...
متن کاملA General Direct Weight Optimization Framework for Nonlinear System Identification
The direct weight optimization (DWO) approach is a method for finding optimal function estimates via convex optimization, applicable to nonlinear system identification. In this paper, an extended version of the DWO approach is introduced. A general function class description — which includes several important special cases — is presented, and different examples are given. A general theorem abou...
متن کاملComparision of Direct and Indirect Response to Selection for Breast Weight in Japanese Quail
This study was carried out to investigate the direct and indirect responses to selection for four-week body weight (4 week body (wk BW)) and four-week breast weight (4 week breast weight (wk BRW)) and to determine the genetic contribution of reminder founders to the last generation. A total number of 351 birds were equally allocated to three lines, including two selected lines (S1 and S2 for BW...
متن کاملStochastic Online Learning for Network Optimization under Random Unknown Weights
We consider network optimization problems under random weights with unknown distributions. We first consider the shortest path problem that aims to optimize the quality of communication between a source and a destination through adaptive path selection. Due to the randomness and uncertainties in the network dynamics, the state of each communication link varies over time according to a stochasti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2014
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2014/572092