Advances in optimization and approximation:
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Dordrecht u.a.
Kluwer
1994
|
| Schriftenreihe: | Nonconvex optimization and its applications
1 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XIII, 389 S. |
| ISBN: | 0792327853 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010096125 | ||
| 003 | DE-604 | ||
| 005 | 20111004 | ||
| 007 | t | ||
| 008 | 950315s1994 ne |||| 00||| eng d | ||
| 020 | |a 0792327853 |9 0-7923-2785-3 | ||
| 035 | |a (OCoLC)30070199 | ||
| 035 | |a (DE-599)BVBBV010096125 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a ne |c XA-NL | ||
| 049 | |a DE-12 |a DE-824 |a DE-703 |a DE-521 |a DE-83 |a DE-11 |a DE-188 | ||
| 050 | 0 | |a QA402.5.A374 1994 | |
| 082 | 0 | |a 519.3 20 | |
| 082 | 0 | |a 519.3 |2 20 | |
| 084 | |a SK 870 |0 (DE-625)143265: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a 65K05 |2 msc | ||
| 084 | |a 90Cxx |2 msc | ||
| 245 | 1 | 0 | |a Advances in optimization and approximation |c ed. by Ding-Zhu Du ... |
| 264 | 1 | |a Dordrecht u.a. |b Kluwer |c 1994 | |
| 300 | |a XIII, 389 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Nonconvex optimization and its applications |v 1 | |
| 650 | 7 | |a Approximation, Théorie de l' |2 ram | |
| 650 | 4 | |a Economía matemática | |
| 650 | 4 | |a Juegos, Teoría de los | |
| 650 | 7 | |a Operations research |2 gtt | |
| 650 | 7 | |a Optimaliseren |2 gtt | |
| 650 | 7 | |a Optimisation mathématique |2 ram | |
| 650 | 7 | |a optimisation mathématique |2 inriac | |
| 650 | 7 | |a problème optimisation |2 inriac | |
| 650 | 7 | |a théorie approximation |2 inriac | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Approximation theory | |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Näherungsverfahren |0 (DE-588)4206467-3 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Näherungsverfahren |0 (DE-588)4206467-3 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Du, Dingzhu |d 1948- |e Sonstige |0 (DE-588)1013682580 |4 oth | |
| 830 | 0 | |a Nonconvex optimization and its applications |v 1 |w (DE-604)BV010085908 |9 1 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006701336&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006701336 | ||
Datensatz im Suchindex
| _version_ | 1804124485238915072 |
|---|---|
| adam_text | Contents
Preface xiii
Scheduling Multiprocessor Flow Shops 1
Bo Chen
1. Introduction 1
2. A Brief Survey 2
3. A New Heuristic 3
4. Concluding Remarks 7
References 7
The /fc Walk Polyhedron 9
Collette R. Coullard, A. Bruce Gamble, and Jin Liu
1. Introduction 9
2. Polynomial Algorithm and Extended Formulations 11
3. Projection Method 13
4. Projection Cone M 14
5. More on Projection Cone M 16
6. Facet Constraints 18
References 29
Two Geometric Optimization Problems 30
Bhaskar Dasgupta and Vwani Roychowdhury
1. Introduction 30
2. The Rectilinear Polygon Cover Problems 31
3. Segmented Channel Routing 44
4. Conclusion and Open Problems 55
References 56
A Scaled Gradient Projection Algorithm for
Linear Complementarity Problems 58
Jin Ding
viii
1. Introduction 58
2. The Algorithm 59
3. Convergence Analysis 60
4. Complexity Analysis 63
5. Conclusions 67
References 67
A Simple Proof for a Result of Ollerenshaw on Steiner Trees 68
Xiufeng Du, Ding Zhu Du, Biao Gao, and Lixue Qu
1. Introduction 68
2. In the Euclidean Plane 69
3. In the Rectilinear Plane 70
4. Discussion 71
References 71
Optimization Algorithms for the Satisfiability (SAT) Problem 72
Jun Gu
1. Introduction 72
2. A Classification of SAT Algorithms 73
3. Preliminaries 79
4. Complete Algorithms and Incomplete Algorithms 81
5. Optimization: An Iterative Refinement Process 86
6. Local Search Algorithms for SAT 89
7. Global Optimization Algorithms for SAT Problem 106
8. Applications 137
9. Future Work 140
10. Conclusions 141
References 143
Ergodic Convergence in Proximal Point Algorithms
with Bregman Functions 155
Osman Giiler
1. Introduction .... 155
2. Convergence for Function Minimization 158
3. Convergence for Arbitrary Maximal Monotone Operators 161
References 163
Adding and Deleting Constraints
in the Logarithmic Barrier Method for LP 166
D. den Hertog, C. Roos, and T. Terlaky
1. Introduction 166
2. The Logarithmic Barrier Method 168
CONTENTS ix
3. The Effects of Shifting, Adding and Deleting Constraints 171
4. The Build Up and Down Algorithm 177
5. Complexity Analysis 180
References 184
A Projection Method for Solving Infinite Systems of
Linear Inequalities 186
Hui Hu
1. Introduction 186
2. The Projection Method 186
3. Convergence Rate 189
4. Infinite Systems of Convex Inequalities 191
5. Application 193
References 194
Optimization Problems in Molecular Biology 195
Tao Jiang and Ming Li
1. Introduction and Preliminaries 195
2. Multiple Sequence Alignment 197
3. Longest Common Subsequence and Shortest Common Supersequence 202
4. Shortest Common Superstring 209
5. Some Unsolved Questions in Computational Biology 213
References 214
A Dual Affine Scaling Based Algorithm for Solving
Linear Semi infinite Programming Problems 217
Chih Jen Lin, Shu Cherng Fang, and Soon Yi Wu
1. Introduction 217
2. A New Algorithm for (LSIP) 219
3. Convergence Proof 227
4. Numerical Examples 230
5. Concluding Remarks 233
References 233
A Genuine Quadratically Convergent Polynomial
Interior Point Algorithm for Linear Programming 235
Zhi Quan Luo and Yinyu Ye
1. Introduction 235
2. The Predictor Corrector Method 237
3. A Variant of the Primal Dual Interior Point Algorithm 239
4. Convergence Analysis • 239
5. Concluding Remarks 245
X
References 245
A Modified Barrier Function Method
for Linear Programming 247
M.R. Osborne
1. Introduction 247
2. An Identity Associated with Newton s Method 249
3. A Small Step Complexity Estimate 251
4. A Form of Algorithm 252
5. Some Numerical Results 254
References 255
A New Facet Class and a Polyhedral Method for
the Three Index Assignment Problem 256
Liqun Qi, Egon Balas, and Geena Gwan
1. Introduction 256
2. Facet Class V 257
3. Facets in V(2) 264
4. A Linear Time Separation Algorithm for V(2) 268
5. Facet Classes with Linear Time Separation Algorithms 270
6. An Algorithm Using a Polyhedral Tightening Procedure 270
7. Computational Results 271
References 274
A Finite Simplex Active Set Method
for Monotropic Piecewise Quadratic Programming 275
R. T. Rockafellar and Jit Sun
7. Computational Results 271
1. Introduction 275
2. Framework of a Finitely Convergent Algorithm 277
3. Implementation 278
4. Degeneracy Processing 287
5. Computational Experiment 289
6. Conclusions 292
References 292
A New Approach in the Optimization of Exponential Queues 293
Susan H. Xu
1. Introduction 293
2. Model I: Admission Control of an Ordered Entry Queue 295
3. Model II: Scheduling Control of an M/M/2 Queue 299
4. Model III: Admission and Scheduling Control of an M/M/2 Queue 303
CONTENTS Xi
5. Approximate Solution 306
References 311
The Euclidean Facilities Location Problem 313
Guoliang Xue and Changyu Wang
1. Introduction 313
2. The Euclidean Single Facility Location Problem 315
3. The Euclidean Multifacility Location Problem 317
4. The Facilities Location Allocation Problem 321
5. Spherical Facility Location 325
6. Conclusions 329
References 330
Optimal Design of Large Scale Opencut Coal Mine System 332
Dezhuang Yang
1. Introduction 332
2. System Analysis 333
3. Mathematical Models 336
4. Flexible OR 344
References 346
On the Strictly Complementary Slackness Relation
in Linear Programming 347
Shuzhong Zhang
1. Introduction 347
2. Strictly Complementary Slackness and Balinski and Tucker s Tableau 349
3. Megiddo s Algorithm 353
4. The New Algorithms 354
5. Conclusions 360
References 360
Analytical Properties of the Central Trajectory
in Interior Point Methods 362
Gongyun Zhao and Jishan Zhu
1. Introduction 362
2. Bounds for Derivatives of ^ Trajectory 364
3. Relative Lipschitz Continuity of the Weighted Derivatives 368
4. On the Taylor Expansion of the Weighted Derivatives 369
5. The Integration of a Curvature over the Trajectory 370
6. Conclusions 374
References 374
xii
The Approximation of Fixed Points of Robust Mappings 376
Quart Zheng and Deming Zhuang
1. Introduction 376
2. Robust Sets and Robust Minimizers 376
3. Robust Mappings, Upper Robust Functional and Their Properties 379
4. Existence and Computation of Fixed Points of Robust Mappings 384
References 388
|
| any_adam_object | 1 |
| author_GND | (DE-588)1013682580 |
| building | Verbundindex |
| bvnumber | BV010096125 |
| callnumber-first | Q - Science |
| callnumber-label | QA402 |
| callnumber-raw | QA402.5.A374 1994 |
| callnumber-search | QA402.5.A374 1994 |
| callnumber-sort | QA 3402.5 A374 41994 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 870 SK 890 |
| ctrlnum | (OCoLC)30070199 (DE-599)BVBBV010096125 |
| dewey-full | 519.320 519.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.3 20 519.3 |
| dewey-search | 519.3 20 519.3 |
| dewey-sort | 3519.3 220 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02185nam a2200589 cb4500</leader><controlfield tag="001">BV010096125</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20111004 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950315s1994 ne |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0792327853</subfield><subfield code="9">0-7923-2785-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)30070199</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010096125</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">ne</subfield><subfield code="c">XA-NL</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA402.5.A374 1994</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.3 20</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.3</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 870</subfield><subfield code="0">(DE-625)143265:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">65K05</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90Cxx</subfield><subfield code="2">msc</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Advances in optimization and approximation</subfield><subfield code="c">ed. by Ding-Zhu Du ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Dordrecht u.a.</subfield><subfield code="b">Kluwer</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 389 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Nonconvex optimization and its applications</subfield><subfield code="v">1</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Approximation, Théorie de l'</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Economía matemática</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Juegos, Teoría de los</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Operations research</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Optimaliseren</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Optimisation mathématique</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">optimisation mathématique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">problème optimisation</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie approximation</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximation theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Näherungsverfahren</subfield><subfield code="0">(DE-588)4206467-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Näherungsverfahren</subfield><subfield code="0">(DE-588)4206467-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Du, Dingzhu</subfield><subfield code="d">1948-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1013682580</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Nonconvex optimization and its applications</subfield><subfield code="v">1</subfield><subfield code="w">(DE-604)BV010085908</subfield><subfield code="9">1</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006701336&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006701336</subfield></datafield></record></collection> |
| id | DE-604.BV010096125 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:46:25Z |
| institution | BVB |
| isbn | 0792327853 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006701336 |
| oclc_num | 30070199 |
| open_access_boolean | |
| owner | DE-12 DE-824 DE-703 DE-521 DE-83 DE-11 DE-188 |
| owner_facet | DE-12 DE-824 DE-703 DE-521 DE-83 DE-11 DE-188 |
| physical | XIII, 389 S. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | Kluwer |
| record_format | marc |
| series | Nonconvex optimization and its applications |
| series2 | Nonconvex optimization and its applications |
| spelling | Advances in optimization and approximation ed. by Ding-Zhu Du ... Dordrecht u.a. Kluwer 1994 XIII, 389 S. txt rdacontent n rdamedia nc rdacarrier Nonconvex optimization and its applications 1 Approximation, Théorie de l' ram Economía matemática Juegos, Teoría de los Operations research gtt Optimaliseren gtt Optimisation mathématique ram optimisation mathématique inriac problème optimisation inriac théorie approximation inriac Mathematical optimization Approximation theory Optimierung (DE-588)4043664-0 gnd rswk-swf Näherungsverfahren (DE-588)4206467-3 gnd rswk-swf Optimierung (DE-588)4043664-0 s DE-604 Näherungsverfahren (DE-588)4206467-3 s Du, Dingzhu 1948- Sonstige (DE-588)1013682580 oth Nonconvex optimization and its applications 1 (DE-604)BV010085908 1 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006701336&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Advances in optimization and approximation Nonconvex optimization and its applications Approximation, Théorie de l' ram Economía matemática Juegos, Teoría de los Operations research gtt Optimaliseren gtt Optimisation mathématique ram optimisation mathématique inriac problème optimisation inriac théorie approximation inriac Mathematical optimization Approximation theory Optimierung (DE-588)4043664-0 gnd Näherungsverfahren (DE-588)4206467-3 gnd |
| subject_GND | (DE-588)4043664-0 (DE-588)4206467-3 |
| title | Advances in optimization and approximation |
| title_auth | Advances in optimization and approximation |
| title_exact_search | Advances in optimization and approximation |
| title_full | Advances in optimization and approximation ed. by Ding-Zhu Du ... |
| title_fullStr | Advances in optimization and approximation ed. by Ding-Zhu Du ... |
| title_full_unstemmed | Advances in optimization and approximation ed. by Ding-Zhu Du ... |
| title_short | Advances in optimization and approximation |
| title_sort | advances in optimization and approximation |
| topic | Approximation, Théorie de l' ram Economía matemática Juegos, Teoría de los Operations research gtt Optimaliseren gtt Optimisation mathématique ram optimisation mathématique inriac problème optimisation inriac théorie approximation inriac Mathematical optimization Approximation theory Optimierung (DE-588)4043664-0 gnd Näherungsverfahren (DE-588)4206467-3 gnd |
| topic_facet | Approximation, Théorie de l' Economía matemática Juegos, Teoría de los Operations research Optimaliseren Optimisation mathématique optimisation mathématique problème optimisation théorie approximation Mathematical optimization Approximation theory Optimierung Näherungsverfahren |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006701336&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV010085908 |
| work_keys_str_mv | AT dudingzhu advancesinoptimizationandapproximation |