Nondifferentiable optimization and polynomial problems:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston [u.a.]
Kluwer
1998
|
| Schriftenreihe: | Nonconvex optimization and its applications
24 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XVII, 394 S. |
| ISBN: | 0792349970 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV012368024 | ||
| 003 | DE-604 | ||
| 005 | 19990125 | ||
| 007 | t | ||
| 008 | 990125s1998 |||| 00||| eng d | ||
| 020 | |a 0792349970 |9 0-7923-4997-0 | ||
| 035 | |a (OCoLC)38249806 | ||
| 035 | |a (DE-599)BVBBV012368024 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 |a DE-11 | ||
| 050 | 0 | |a QA402.5 | |
| 082 | 0 | |a 519.3 |2 21 | |
| 084 | |a SK 870 |0 (DE-625)143265: |2 rvk | ||
| 100 | 1 | |a Shor, Naum Z. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Nondifferentiable optimization and polynomial problems |c by Naum Z. Shor |
| 264 | 1 | |a Boston [u.a.] |b Kluwer |c 1998 | |
| 300 | |a XVII, 394 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 24 | |
| 650 | 7 | |a Mathematische programmering |2 gtt | |
| 650 | 7 | |a Optimaliseren |2 gtt | |
| 650 | 4 | |a Extremal problems (Mathematics) | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Nondifferentiable functions | |
| 650 | 4 | |a Nonlinear programming | |
| 650 | 4 | |a Polynomials | |
| 650 | 0 | 7 | |a Nichtdifferenzierbare Funktion |0 (DE-588)4326748-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Polynom |0 (DE-588)4046711-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 0 | 1 | |a Polynom |0 (DE-588)4046711-9 |D s |
| 689 | 0 | 2 | |a Nichtdifferenzierbare Funktion |0 (DE-588)4326748-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Nonconvex optimization and its applications |v 24 |w (DE-604)BV010085908 |9 24 | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008387634&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-008387634 | ||
Datensatz im Suchindex
| _version_ | 1804126997603942400 |
|---|---|
| adam_text | NONDIFFERENTIABLE OPTIMIZATION AND POLYNOMIAL PROBLEMS BY NAUM Z. SHOR
V.M. GLUSHKOV INSTITUTE OF CYBERNETICS, UKRAINIAN NATIONAL ACADEMY OF
SCIENCES, KIEV KLUWER ACADEMIC PUBLISHERS BOSTON / DORDRECHT / LONDON
CONTENTS PREFACE IX ELEMENTS OF CONVEX ANALYSIS, LINEAR ALGEBRA, AND
GRAPH THEORY L 1.1 CONVEX SETS AND CONVEX FUNCTIONS 1 1.2 PROPERTIES OF
SUBGRADIENT AND E-SUBGRADIENT SETS 8 1.3 KUHN-TUCKER THEOREM AND DUAL
BOUNDS 19 1.4 NONSMOOTH PENALTY FUNCTIONS 22 1.5 POLYHEDRAL SETS,
MATRICES AND QUADRATIC FUNCTIONS 25 1.6 ELEMENTS OF GRAPH THEORY 30
SUBGRADIENT AND E-SUBGRADIENT METHODS 35 2.1 THE SUBGRADIENT METHOD 37
2.2 FEJER-TYPE SUBGRADIENT METHODS 51 2.3 E-SUBGRADIENT AND BUNDLE
METHODS 57 2.4 THE STOCHASTIC SUBGRADIENT METHOD 68 SUBGRADIENT-TYPE
METHODS WITH SPACE DILATION 71 3.1 HEURISTICS OF METHODS WITH SPACE
DILATION 71 3.2 THE SUBGRADIENT METHOD WITH SPACE DILATION IN THE DIREC-
TION OF SUBGRADIENT 74 3.3 THE ELLIPSOID METHOD AND ITS GENERALIZATIONS
88 3.4 METHODS WITH SPACE DILATION IN DIRECTION OF THE DIFFERENCE OF TWO
SUCCESSIVE SUBGRADIENTS IN TRANSFORMED SPACE 100 VI NONDIFFERENTIABLE
OPTIMIZATION AND POLYNOMIAL PROBLEMS 4 ELEMENTS OF INFORMATION AND
NUMERICAL COMPLEXITY OF POLYNOMIAL EXTREMAL PROBLEMS 113 4.1
INTRODUCTION TO THE COMPLEXITY THEORY OF OPTIMIZATION PROB- LEMS 113 4.2
POLYNOMIAL-TIME ALGORITHMS FOR LINEAR PROGRAMMING 118 4.3 INTERIOR POINT
ALGORITHMS FOR LINEAR PROGRAMMING AND SPECIAL CONVEX PROGRAMMING
PROBLEMS 121 4.4 REVIEW OF MAIN RESULTS ON COMPLEXITY THEORY OF
POLYNOMIAL PROGRAMS 133 5 DECOMPOSITION METHODS BASED ON NONSMOOTH
OPTIMIZATION 141 5.1 COORDINATE PROBLEMS ARISING IN DECOMPOSITION ON
CONSTRAINTS 145 5.2 NONSMOOTH PROBLEMS LINKING WITH DECOMPOSITION ON
VARI- ABLES 147 5.3 EXAMPLES OF SOLVING LARGE-SCALE PROBLEMS BY USING
DECOM- POSITION SCHEMES IN COMBINATION WITH R- ALGORITHM ON HIGH- SPEED
PARALLEL COMPUTERS 152 6 ALGORITHMS FOR CONSTRUCTING OPTIMAL ON VOLUME
ELLIPSOIDS AND SEMIDEFINITE PROGRAMMING 169 6.1 INTRODUCTION 169 6.2
SIMPLE ALGORITHMS FOR CONSTRUCTING OPTIMAL ON VOLUME CIR- CUMSCRIBED
ELLIPSOIDS 178 6.3 ALGORITHMS FOR CONSTRUCTING INSCRIBED ELLIPSOIDS OF
MAXI- MUM VOLUME 187 6.4 INTERIOR POINT METHODS FOR DETERMINATION OF
OPTIMAL CIRCUM- SCRIBED AND INSCRIBED ELLIPSOIDS 193 6.5 METHOD OF
INSCRIBED ELLIPSOIDS FOR MINIMIZATION OF CONVEX FUNCTIONS ON POLYTOPES
196 6.6 SEMIDEFINITE PROGRAMMING PROBLEMS 200 6.7 SEMIDEFINITE
PROGRAMMING MODELS IN AUTOMATIC CONTROL 210 6.8 NONCONVEX QUADRATIC
PROGRAMS AND SEMIDEFINITE PROGRAM- MING V . 220 CONTENTS VII 7 THE ROLE
OF ELLIPSOID METHOD FOR COMPLEXITY ANALYSIS OF COMBINATORIAL PROBLEMS
227 7.1 POLYNOMIAL EQUIVALENCE OF THE OPTIMIZATION AND SEPARATION
PROBLEMS 227 7.2 JUSTIFICATION OF THE POLYNOMIAL-TIME SOLVABILITY OF
SOME COM- BINATORIAL PROBLEMS 232 7.3 DUAL BOUNDS FOR MAXIMUM WEIGHTED
STABLE SETS IN GRAPHS 239 7.4 POLYNOMIAL-TIME ALGORITHM FOR PERFECT
GRAPHS 254 7.5 USING R-ALGORITHM FOR OBTAINING UPPER BOUNDS FOR THE MAX-
IMUM WEIGHTED STABLE SET PROBLEMS 257 8 SEMIDEFINITE PROGRAMMING BOUNDS
FOR EXTREMAL GRAPH PROBLEMS 265 8.1 THE MAXIMUM CUT PROBLEM 265 8.2
GRAPH PARTITIONING PROBLEMS 279 8.3 UPPER BOUNDS FOR THE SIZE OF
FC-PARTITE INDUCED SUBGRAPHS OF GIVEN GRAPH AND THEIR APPLICATIONS TO
COLOURING PROBLEMS 293 9 GLOBAL MINIMIZATION OF POLYNOMIAL FUNCTIONS AND
17-TH HILBERT PROBLEM 299 9.1 THE PROBLEM OF REPRESENTATION OF
NONNEGATIVE POLYNOMIALS AS SUM OF SQUARES OF POLYNOMIALS 299 9.2
CONSTRUCTING OF QUADRATIC PROBLEM WITH SUPERFLUOUS CON- STRAINTS FOR
GLOBAL MINIMIZATION OF ONE-DIMENSIONAL POLYNO- MIALS 308 9.3 NECESSARY
AND SUFFICIENT CONDITIONS FOR DUAL QUADRATIC BOUND TO BE EXACT.
MULTIDIMENSIONAL CASE 320 9.4 INSTANCES OF FINDING GLOBAL MINIMUM OF
POLYNOMIAL FUNCTIONS USING R-ALGORITHM 330 REFERENCES 335
|
| any_adam_object | 1 |
| author | Shor, Naum Z. |
| author_facet | Shor, Naum Z. |
| author_role | aut |
| author_sort | Shor, Naum Z. |
| author_variant | n z s nz nzs |
| building | Verbundindex |
| bvnumber | BV012368024 |
| callnumber-first | Q - Science |
| callnumber-label | QA402 |
| callnumber-raw | QA402.5 |
| callnumber-search | QA402.5 |
| callnumber-sort | QA 3402.5 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 870 |
| ctrlnum | (OCoLC)38249806 (DE-599)BVBBV012368024 |
| 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>01881nam a2200493 cb4500</leader><controlfield tag="001">BV012368024</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19990125 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">990125s1998 |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0792349970</subfield><subfield code="9">0-7923-4997-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38249806</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012368024</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-703</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA402.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.3</subfield><subfield code="2">21</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="100" ind1="1" ind2=" "><subfield code="a">Shor, Naum Z.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Nondifferentiable optimization and polynomial problems</subfield><subfield code="c">by Naum Z. Shor</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston [u.a.]</subfield><subfield code="b">Kluwer</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVII, 394 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">24</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematische programmering</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="4"><subfield code="a">Extremal problems (Mathematics)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Nondifferentiable functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Nonlinear programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Polynomials</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Nichtdifferenzierbare Funktion</subfield><subfield code="0">(DE-588)4326748-8</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="650" ind1="0" ind2="7"><subfield code="a">Polynom</subfield><subfield code="0">(DE-588)4046711-9</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="1"><subfield code="a">Polynom</subfield><subfield code="0">(DE-588)4046711-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Nichtdifferenzierbare Funktion</subfield><subfield code="0">(DE-588)4326748-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Nonconvex optimization and its applications</subfield><subfield code="v">24</subfield><subfield code="w">(DE-604)BV010085908</subfield><subfield code="9">24</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV 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=008387634&sequence=000001&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-008387634</subfield></datafield></record></collection> |
| id | DE-604.BV012368024 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:26:21Z |
| institution | BVB |
| isbn | 0792349970 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008387634 |
| oclc_num | 38249806 |
| open_access_boolean | |
| owner | DE-703 DE-11 |
| owner_facet | DE-703 DE-11 |
| physical | XVII, 394 S. |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | Kluwer |
| record_format | marc |
| series | Nonconvex optimization and its applications |
| series2 | Nonconvex optimization and its applications |
| spelling | Shor, Naum Z. Verfasser aut Nondifferentiable optimization and polynomial problems by Naum Z. Shor Boston [u.a.] Kluwer 1998 XVII, 394 S. txt rdacontent n rdamedia nc rdacarrier Nonconvex optimization and its applications 24 Mathematische programmering gtt Optimaliseren gtt Extremal problems (Mathematics) Mathematical optimization Nondifferentiable functions Nonlinear programming Polynomials Nichtdifferenzierbare Funktion (DE-588)4326748-8 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Polynom (DE-588)4046711-9 gnd rswk-swf Optimierung (DE-588)4043664-0 s Polynom (DE-588)4046711-9 s Nichtdifferenzierbare Funktion (DE-588)4326748-8 s DE-604 Nonconvex optimization and its applications 24 (DE-604)BV010085908 24 GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008387634&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Shor, Naum Z. Nondifferentiable optimization and polynomial problems Nonconvex optimization and its applications Mathematische programmering gtt Optimaliseren gtt Extremal problems (Mathematics) Mathematical optimization Nondifferentiable functions Nonlinear programming Polynomials Nichtdifferenzierbare Funktion (DE-588)4326748-8 gnd Optimierung (DE-588)4043664-0 gnd Polynom (DE-588)4046711-9 gnd |
| subject_GND | (DE-588)4326748-8 (DE-588)4043664-0 (DE-588)4046711-9 |
| title | Nondifferentiable optimization and polynomial problems |
| title_auth | Nondifferentiable optimization and polynomial problems |
| title_exact_search | Nondifferentiable optimization and polynomial problems |
| title_full | Nondifferentiable optimization and polynomial problems by Naum Z. Shor |
| title_fullStr | Nondifferentiable optimization and polynomial problems by Naum Z. Shor |
| title_full_unstemmed | Nondifferentiable optimization and polynomial problems by Naum Z. Shor |
| title_short | Nondifferentiable optimization and polynomial problems |
| title_sort | nondifferentiable optimization and polynomial problems |
| topic | Mathematische programmering gtt Optimaliseren gtt Extremal problems (Mathematics) Mathematical optimization Nondifferentiable functions Nonlinear programming Polynomials Nichtdifferenzierbare Funktion (DE-588)4326748-8 gnd Optimierung (DE-588)4043664-0 gnd Polynom (DE-588)4046711-9 gnd |
| topic_facet | Mathematische programmering Optimaliseren Extremal problems (Mathematics) Mathematical optimization Nondifferentiable functions Nonlinear programming Polynomials Nichtdifferenzierbare Funktion Optimierung Polynom |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008387634&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV010085908 |
| work_keys_str_mv | AT shornaumz nondifferentiableoptimizationandpolynomialproblems |