Complexity in numerical optimization:
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Singapore u.a.
World Scientific
1993
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XIII, 511 S. graph. Darst. |
| ISBN: | 9810214154 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV010394029 | ||
| 003 | DE-604 | ||
| 005 | 19980917 | ||
| 007 | t | ||
| 008 | 950925s1993 d||| |||| 00||| engod | ||
| 020 | |a 9810214154 |9 981-02-1415-4 | ||
| 035 | |a (OCoLC)28212656 | ||
| 035 | |a (DE-599)BVBBV010394029 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-634 |a DE-11 | ||
| 050 | 0 | |a QA267.7 | |
| 082 | 0 | |a 519.3 |2 20 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a MAT 910f |2 stub | ||
| 245 | 1 | 0 | |a Complexity in numerical optimization |c ed.: Panos M. Pardalos |
| 264 | 1 | |a Singapore u.a. |b World Scientific |c 1993 | |
| 300 | |a XIII, 511 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Complexité calcul | |
| 650 | 7 | |a Complexité de calcul (informatique) |2 ram | |
| 650 | 7 | |a Optimisation mathématique |2 ram | |
| 650 | 4 | |a Optimisation numérique | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Numerical analysis | |
| 650 | 0 | 7 | |a Numerische Mathematik |0 (DE-588)4042805-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4143413-4 |a Aufsatzsammlung |2 gnd-content | |
| 689 | 0 | 0 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 0 | 1 | |a Numerische Mathematik |0 (DE-588)4042805-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Pardalos, Panos M. |d 1954- |e Sonstige |0 (DE-588)115385827 |4 oth | |
| 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=006921498&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006921498 | ||
Datensatz im Suchindex
| _version_ | 1804124820840906752 |
|---|---|
| adam_text | Contents
Preface v
Average Performance of a Self Dual Interior Point Algorithm
for Linear Programming 1
K. M. Anstreicher, J. Ji, F. A. Potra, and Y. Ye
1. Introduction 2
2. The HLP problem and the self dual algorithm 3
3. A new projection scheme for finite termination 6
4. Random model and probabilistic analysis 10
References 13
The Complexity of Approximating a Nonlinear Program 16
M. Bellare and P. Rogaway
1. Introduction 17
2. Preliminaries 20
3. The complexity of polynomial programming 25
4. The complexity of quadratic programming 26
References 30
Algorithms for the Least Distance Problem 33
P. Berman, N. Kovoor, and P. M. Pardalos
1. Introduction 33
2. The parametric characterization and its properties 35
3. An algorithm based on construction of arrangements 41
4. Queries and a witness based search scheme 43
5. A linear time recursive algorithm 48
6. Conclusions 53
References 53
Appendix 56
Translational Cuts for Convex Minimization 57
J. V. Burke, A.A. Goldstein, P. Tseng, and Y. Ye
1. Introduction 58
2. Iteration count for the translational cuts algorithm 60
2. Work per iteration for the translational cuts algorithm 63
vii
viii Contents
References 72
Maximizing Concave Functions in Fixed Dimension 74
E. Cohen and N. Megiddo
1. Introduction 75
2. Preliminaries 75
3. Hyperplane queries 80
4. Employing multi dimensional search 81
5. The algorithm 82
6. Correctness 83
7. Complexity 84
8. Parametric extensions of problems ¦ 85
References 87
Approximating the Steiner Minimum Tree 88
D. Z. Du
1. Introduction 88
2. Minimum spanning trees 89
3. MST based heuristics 94
4. Sub SMT based heuristics 99
References 102
The Complexity of Allocating Resources in Parallel: Upper
and Lower Bounds 107
E. J Friedman
1. Introduction 107
2. General convex optimization 108
3. Resource allocation 114
4. Primal algorithms 116
5. Primal dual (price based) algorithms 118
6. Conclusions 121
Appendix 122
References 125
Some Bounds on the Complexity of Gradients, Jacobians,
and Hessians 128
A. Griewank
1. Introduction 129
Contents ix
2. Generalizations of partial separability 136
3. The evaluation program and its complexity 147
4. Results and discussion 154
5. Summary and conclusion 160
References 161
Complexity Issues in Nonconvex Network Flow Problems 163
G. M, Guisewite and P. M. Pardalos
1. Introduction 163
2. The uncapacitated case 165
3. The capacitated case 172
4. Summary 177
References 177
Complexity of Smooth Convex Programming and its Applications ... 180
O. Giiler
1. Introduction 180
2. The algorithm for constrained minimization 183
3. Another algorithm for constrained minimization 188
4. Applications to convex quadratic programs 191
References 194
A Classification of Static Scheduling Problems 203
J. W. Herrmann, C. Y. Lee, and J. L. Snowdon
1. Introduction 203
2. Problem description 204
3. Table organization 207
References 231
An O(nL) Iteration Algorithm for Computing Bounds in Quadratic
Optimization Problems 254
A. P. Kamath and N. K. Karmarkar
1. Outline 254
2. Introduction 255
3. Interior point approach to the problem 256
4. Complexity analysis 261
5. Generalizing the algorithm 263
6. Conclusions 267
x Contents
References 267
Complexity of Single Machine Hierarchical Scheduling: A Survey — 269
C. Y. Lee and G. Vairaktarakis
1. Introduction 269
2. Notation and basic results 270
3 A g {£ Ci, £,• Wid, LmM, /„,«, fUi}
BefEi^EitiAULL} 274
4. A 6 {Ei £, , E* mTi, Ei Tj, Ei mU, E, Ut}
5€{EiCi,E iCi,£max,/max,i;max} 276
«¦ A € {Et C/f, Et lt i* J5 imaxi /man ^maxj
5€{E,JBi,E,«,r»E,ri,E.«.^,E,^} 280
6. A € {£, £, , Ei rmTi, E, Ti, Ei mOi, £; Ut}
B £ {EiEuEiWiTuEiTiiEiWiUuEiUi} 287
7. Complexity tables 294
8. Conclusion 294
References 295
Performance Driven Graph Enhancement Problems 299
D. Paik and S. Sahni
1. Introduction 299
2. DVUP 302
3. LinkDelay(x, S) 309
4. ShortestPath(a;, 6) 310
5. Satellite^) 311
6. LongestPath(i, S) 312
7. DVSP 314
8. DVDP 318
References 320
Efficient Algorithms for 6 Near Planar Graph and
Algebraic Problem 323
V. Radhakrishnan, H. B. Hunt III, and R. E. Steams
1. Introduction 324
2. Preliminaries 326
3. Comparisons with other classes of graphs 328
4. Path problems and systems of linear equations 330
5. Structure trees, weighted depth, generalized satisfiability 336
6. Summary and open problems 348
Contents xi
References 349
Parametric Flows, Weighted Means of Cuts, and Fractional
Combinatorial Optimization 351
T. Radzik
1. Introduction 351
2. The maximum mean weight cut problem and related network flow problems. .356
3. Linear fractional combinatorial optimization problems 362
4. Analysis of Newton s method for the PF problem 372
5. Analysis of Newton s method for the uniform PF problem 377
6. Concluding remarks 383
References 383
Analysis of a Random Cut Test Instance Generator for the TSP 387
R. L. Rardin, C. A. Tovey, and M. G. Pitcher
1. Introduction 388
2. Versions of the general TSP and class Dp 389
3. Polyhedral relaxations and random cut generators 391
4. Exposed instances 395
5. Intermediate TSP s 398
6. Well formed instances and promises 400
References 403
Some Complexity Issues Involved in the Construction of Test
Cases for NP hard Problems 406
L. A. Sanchis
1. Introduction 406
2. Definitions 408
3. Generability 409
4. Generation of hard instances 417
References 426
Maximizing Non Linear Concave Functions in Fixed Dimension 429
5. Toledo
1. Introduction 429
2. Maximizing one dimensional concave functions 432
3. A two dimensional algorithm 435
4. The general algorithm 438
xii Contents
5. Applications 445
References 446
A Note on the Complexity of Fixed Point Computation for
Noncontractive Maps 448
C. W. Tsay and K. Sikorski
1. Introduction 448
2. Main results 450
3. Complexity for the class F ,h 452
4. Complexity for the class i^.i 454
5. Conclusion 459
References 459
A Technique for Bounding the Number of Iterations in Path
Following Algorithms 462
P. M. Vaidya and D. S. Atkinson
1. Introduction 462
2. Generic path following 464
3. A mathematical framework 467
4. Two old barrier functions 475
5. The hybrid barrier function 484
6. Conclusions 488
References 488
Polynomial Time Weak Approximation Algorithms for Quadratic
Programming 490
5. A. Vavasis
1. Nonconvex quadratic programming 490
2. A weak approximation in polynomial time 492
3. Picking a random point 495
4. Conclusions 498
References 499
Complexity Results for a Class of Min Max Problems with Robust
Optimization Applications 501
G. Yu and P. Kouvelis
1. Introduction 501
2. The min max assignment problem 503
Contents xiii
3. The min max shortest path problem 504
4. The min max resource allocation problem 505
5. The min max knapsack problem 507
6. The min max flow shop scheduling problem 508
7. Remarks 509
References 509
|
| any_adam_object | 1 |
| author_GND | (DE-588)115385827 |
| building | Verbundindex |
| bvnumber | BV010394029 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267.7 |
| callnumber-search | QA267.7 |
| callnumber-sort | QA 3267.7 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 890 |
| classification_tum | MAT 910f |
| ctrlnum | (OCoLC)28212656 (DE-599)BVBBV010394029 |
| dewey-full | 519.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.3 |
| dewey-search | 519.3 |
| dewey-sort | 3519.3 |
| 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>01769nam a2200469 c 4500</leader><controlfield tag="001">BV010394029</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19980917 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950925s1993 d||| |||| 00||| engod</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9810214154</subfield><subfield code="9">981-02-1415-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28212656</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010394029</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="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267.7</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 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 910f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complexity in numerical optimization</subfield><subfield code="c">ed.: Panos M. Pardalos</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Singapore u.a.</subfield><subfield code="b">World Scientific</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 511 S.</subfield><subfield code="b">graph. Darst.</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="650" ind1=" " ind2="4"><subfield code="a">Complexité calcul</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexité de calcul (informatique)</subfield><subfield code="2">ram</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="4"><subfield code="a">Optimisation numérique</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Numerical analysis</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Numerische Mathematik</subfield><subfield code="0">(DE-588)4042805-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4143413-4</subfield><subfield code="a">Aufsatzsammlung</subfield><subfield code="2">gnd-content</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="1"><subfield code="a">Numerische Mathematik</subfield><subfield code="0">(DE-588)4042805-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pardalos, Panos M.</subfield><subfield code="d">1954-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)115385827</subfield><subfield code="4">oth</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=006921498&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-006921498</subfield></datafield></record></collection> |
| genre | (DE-588)4143413-4 Aufsatzsammlung gnd-content |
| genre_facet | Aufsatzsammlung |
| id | DE-604.BV010394029 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:51:45Z |
| institution | BVB |
| isbn | 9810214154 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006921498 |
| oclc_num | 28212656 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-634 DE-11 |
| owner_facet | DE-91G DE-BY-TUM DE-634 DE-11 |
| physical | XIII, 511 S. graph. Darst. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| publisher | World Scientific |
| record_format | marc |
| spelling | Complexity in numerical optimization ed.: Panos M. Pardalos Singapore u.a. World Scientific 1993 XIII, 511 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Complexité calcul Complexité de calcul (informatique) ram Optimisation mathématique ram Optimisation numérique Computational complexity Mathematical optimization Numerical analysis Numerische Mathematik (DE-588)4042805-9 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf (DE-588)4143413-4 Aufsatzsammlung gnd-content Optimierung (DE-588)4043664-0 s Numerische Mathematik (DE-588)4042805-9 s DE-604 Pardalos, Panos M. 1954- Sonstige (DE-588)115385827 oth HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006921498&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Complexity in numerical optimization Complexité calcul Complexité de calcul (informatique) ram Optimisation mathématique ram Optimisation numérique Computational complexity Mathematical optimization Numerical analysis Numerische Mathematik (DE-588)4042805-9 gnd Optimierung (DE-588)4043664-0 gnd |
| subject_GND | (DE-588)4042805-9 (DE-588)4043664-0 (DE-588)4143413-4 |
| title | Complexity in numerical optimization |
| title_auth | Complexity in numerical optimization |
| title_exact_search | Complexity in numerical optimization |
| title_full | Complexity in numerical optimization ed.: Panos M. Pardalos |
| title_fullStr | Complexity in numerical optimization ed.: Panos M. Pardalos |
| title_full_unstemmed | Complexity in numerical optimization ed.: Panos M. Pardalos |
| title_short | Complexity in numerical optimization |
| title_sort | complexity in numerical optimization |
| topic | Complexité calcul Complexité de calcul (informatique) ram Optimisation mathématique ram Optimisation numérique Computational complexity Mathematical optimization Numerical analysis Numerische Mathematik (DE-588)4042805-9 gnd Optimierung (DE-588)4043664-0 gnd |
| topic_facet | Complexité calcul Complexité de calcul (informatique) Optimisation mathématique Optimisation numérique Computational complexity Mathematical optimization Numerical analysis Numerische Mathematik Optimierung Aufsatzsammlung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006921498&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT pardalospanosm complexityinnumericaloptimization |