搜索结果: 1-8 共查到“信息科学与系统科学 efficient”相关记录8条 . 查询时间(0.109 秒)
Efficient convex optimization for engineering design
Optimization numerical methods linear programming optimal control robust control convex programming interior-point methods FIR
2015/8/12
Many problems in engineering analysis and design can be cast as convex optimization problems, often nonlinear and nondifferentiable. We give a high-level description of recently developed interior-poi...
Efficient variational inference in large-scale Bayesian compressed sensing
large-scale Bayesian variational inference Computer Vision and Pattern Recognition
2011/10/9
Abstract: We study linear models under heavy-tailed priors from a probabilistic viewpoint. Instead of computing a single sparse most probable (MAP) solution as in standard deterministic approaches, th...
Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms
Non-adaptive probabilistic group noisy measurements Near-optimal bounds efficient algorithms
2011/9/19
Abstract: We consider the problem of detecting a small subset of defective items from a large set via non-adaptive "random pooling" group tests. We consider both the case when the measurements are noi...
NECESSARY CONDITIONS FOR MAJOR OPTIMAL SOLUTIONS AND MAJOR EFFICIENT SOLUTIONS OF MULTIOBJECTIVE PROGRAMMING
Multiobjective programming major optima
2007/12/10
摘要 In this papers the Fritz John conditions and Kuhn-Tucker conditions for majoroptimal solutions and major efficient solutions of multiobjective programming are givenand proved.
In this paper, we use the virtual system method to estimate the parametersin a system tree and obtain a series of asymptotically efficient estimates of the interesting parameters. Section 1 is an intr...
Major efficiency is an efficiency theory of multiobjective programming, whichis based on the law of majority. For the case that the feasible region is a finite set, paper [3] gave a comparison-number ...
THE COMPARISON-NUMBER METHOD FOR FINDING MAJOR OPTIMAL SOLUTIONS AND MAJOR EFFICIENT SOLUTIONS OF THE DISCRETE MULTIOBJECTIVE PROGRAMMING
Multiobjective programming Pareto effici
2007/8/7
In this paper, we introduce the comparison number for one feasible solutioncompared with another. With the help of it the comparison-number method for finding the major optimal solutions aud major eff...
ON THE SMALLEST POSSIBLE ASYMPTOTICALLY EFFICIENT VARIANCE IN SEMIPARAMETRIC MODELS
Semiparametric models the smallest poss
2007/8/7
In this paper, the author gives a sufficient and necessary condition under which is the smallest possible asymptotic variance for regular estimators of β given by Schick (1986), and gives an example t...