<電子ブック>
Quasiconvex Optimization and Location Theory / by J.A. dos Santos Gromicho
(Applied Optimization ; 9)
版 | 1st ed. 1998. |
---|---|
出版者 | (New York, NY : Springer US : Imprint: Springer) |
出版年 | 1998 |
本文言語 | 英語 |
大きさ | XXII, 219 p : online resource |
著者標目 | *dos Santos Gromicho, J.A author SpringerLink (Online service) |
件 名 | LCSH:Mathematical optimization LCSH:Algorithms LCSH:Mathematics -- Data processing 全ての件名で検索 LCSH:Computer science LCSH:Econometrics FREE:Optimization FREE:Algorithms FREE:Computational Mathematics and Numerical Analysis FREE:Theory of Computation FREE:Econometrics |
一般注記 | 1 Introduction -- 2 Elements of Convexity -- 2.1 Generalities -- 2.2 Convex sets -- 2.3 Convex functions -- 2.4 Quasiconvex functions -- 2.5 Other directional derivatives -- 3 Convex Programming -- 3.1 Introduction -- 3.2 The ellipsoid method -- 3.3 Stopping criteria -- 3.4 Computational experience -- 4 Convexity in Location -- 4.1 Introduction -- 4.2 Measuring convex distances -- 4.3 A general model -- 4.4 A convex location model -- 4.5 Characterizing optimality -- 4.6 Checking optimality in the planar case -- 4.7 Computational results -- 5 Quasiconvex Programming -- 5.1 Introduction -- 5.2 A separation oracle for quasiconvex functions -- 5.3 Easy cases -- 5.4 When we meet a “bad” point -- 5.5 Convergence proof -- 5.6 An ellipsoid algorithm for quasiconvex programming -- 5.7 Improving the stopping criteria -- 6 Quasiconvexity in Location -- 6.1 Introduction -- 6.2 A quasiconvex location model -- 6.3 Computational results -- 7 Conclusions grams of which the objective is given by the ratio of a convex by a positive (over a convex domain) concave function. As observed by Sniedovich (Ref. [102, 103]) most of the properties of fractional pro grams could be found in other programs, given that the objective function could be written as a particular composition of functions. He called this new field C programming, standing for composite concave programming. In his seminal book on dynamic programming (Ref. [104]), Sniedovich shows how the study of such com positions can help tackling non-separable dynamic programs that otherwise would defeat solution. Barros and Frenk (Ref. [9]) developed a cutting plane algorithm capable of optimizing C-programs. More recently, this algorithm has been used by Carrizosa and Plastria to solve a global optimization problem in facility location (Ref. [16]). The distinction between global optimization problems (Ref. [54]) and generalized convex problems can sometimes be hard to establish. That is exactly the reason why so much effort has been placed into finding an exhaustive classification of the different weak forms of convexity, establishing a new definition just to satisfy some desirable property in the most general way possible. This book does not aim at all the subtleties of the different generalizations of convexity, but concentrates on the most general of them all, quasiconvex programming. Chapter 5 shows clearly where the real difficulties appear HTTP:URL=https://doi.org/10.1007/978-1-4613-3326-5 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9781461333265 |
|
電子リソース |
|
EB00230179 |
書誌詳細を非表示
データ種別 | 電子ブック |
---|---|
分 類 | LCC:QA402.5-402.6 DC23:519.6 |
書誌ID | 4000106100 |
ISBN | 9781461333265 |
類似資料
この資料の利用統計
このページへのアクセス回数:4回
※2017年9月4日以降