http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Ahipasaoglu, Selin Damla (검색결과 1 건)
-
Solving ellipsoidal inclusion and optimal experimental design problems: Theory and algorithms
Ahipasaoglu, Selin Damla Cornell University 2009 해외박사(DDOD)
This thesis is concerned with the development and analysis of Frank-Wolfe type algorithms for two problems, namely the ellipsoidal inclusion problem of optimization and the optimal experimental design problem of statistics. These two problems are closely related to each other and can be solved simultaneously as discussed in Chapter 1 of this thesis. Chapter 1 introduces the problems in parametric forms. The weak and strong duality relations between them are established and the optimality criteria are derived. Based on this discussion, we define epsilon-primal feasible and epsilon-approximate optimal solutions: these solutions do not necessarily satisfy the optimality criteria but the violation is controlled by the error parameter epsilon and can be arbitrarily small. Chapter 2 deals with the most well-known special case of the optimal experimental design problems: the D-optimal design problem and its dual, the Minimum-Volume Enclosing Ellipsoid (MVEE) problem. Chapter 3 focuses on another special case, the A-optimal design problem. In Chapter 4 we focus on a generalization of the optimal experimental design problem in which a subset but not all of parameters is being estimated. We focus on the following two problems: the Dk-optimal design problem and the A k-optimal design problem, generalizations of the D-optimal and the A-optimal design problems, respectively. In each chapter, we develop first-order algorithms for the respective problem and discuss their global and local convergence properties. We present various initializations and provide some computational results which confirm the attractive features of the first-order methods discussed. Chapter 5 investigates possible combinatorial extensions of the previous problems. Special attention is given to the problem of finding the Minimum-Volume Ellipsoid (MVE) estimator of a data set, in which a subset of a certain size is selected so that the minimum-volume ellipsoid enclosing these points has the smallest volume. We discuss how the algorithms in Chapter 2 can be adapted in order to attack this problem. Many efficient heuristics and a branch-and-bound algorithm are developed.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
