Convex analysis and minimization algorithms: 2 Advanced theory and bundle methods
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin u.a.
Springer
1993
|
| Schriftenreihe: | Grundlehren der mathematischen Wissenschaften
306 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Hier auch später erschienene, unveränderte Nachdrucke |
| Beschreibung: | XVII, 346 S. Diagramme |
| ISBN: | 0387568522 3540568522 9783642081620 |
Internformat
MARC
| LEADER | 00000nam a2200000 cc4500 | ||
|---|---|---|---|
| 001 | BV008552202 | ||
| 003 | DE-604 | ||
| 005 | 20231219 | ||
| 007 | t | ||
| 008 | 931230s1993 gw |||| |||| 00||| eng d | ||
| 020 | |a 0387568522 |9 0-387-56852-2 | ||
| 020 | |a 3540568522 |9 3-540-56852-2 | ||
| 020 | |a 9783642081620 |9 978-3-642-08162-0 | ||
| 035 | |a (OCoLC)165173814 | ||
| 035 | |a (DE-599)BVBBV008552202 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-12 |a DE-20 |a DE-384 |a DE-91G |a DE-824 |a DE-29T |a DE-739 |a DE-703 |a DE-19 |a DE-706 |a DE-634 |a DE-83 |a DE-11 |a DE-188 | ||
| 084 | |a SK 750 |0 (DE-625)143254: |2 rvk | ||
| 084 | |a MAT 520f |2 stub | ||
| 084 | |a 65K10 |2 msc | ||
| 084 | |a MAT 916f |2 stub | ||
| 084 | |a 90C25 |2 msc | ||
| 084 | |a 52A41 |2 msc | ||
| 084 | |a MAT 469f |2 stub | ||
| 100 | 1 | |a Hiriart-Urruty, Jean-Baptiste |d 1949- |e Verfasser |0 (DE-588)128857102 |4 aut | |
| 245 | 1 | 0 | |a Convex analysis and minimization algorithms |n 2 |p Advanced theory and bundle methods |c Jean-Baptiste Hiriart-Urruty ; Claude Lemaréchal |
| 264 | 1 | |a Berlin u.a. |b Springer |c 1993 | |
| 300 | |a XVII, 346 S. |b Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Grundlehren der mathematischen Wissenschaften |v 306 | |
| 490 | 0 | |a Grundlehren der mathematischen Wissenschaften |v ... | |
| 500 | |a Hier auch später erschienene, unveränderte Nachdrucke | ||
| 650 | 0 | 7 | |a Konvexe Analysis |0 (DE-588)4138566-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Konvexe Analysis |0 (DE-588)4138566-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Lemaréchal, Claude |d 1944- |e Verfasser |0 (DE-588)128857137 |4 aut | |
| 773 | 0 | 8 | |w (DE-604)BV008398102 |g 2 |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-662-06409-2 |
| 830 | 0 | |a Grundlehren der mathematischen Wissenschaften |v 306 |w (DE-604)BV000000395 |9 306 | |
| 856 | 4 | 2 | |m Digitalisierung UB Passau - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005621410&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005621410 | ||
Datensatz im Suchindex
| _version_ | 1804122887492206592 |
|---|---|
| adam_text | Table of Contents Part II Introduction.......................................... XV IX. Inner Construction of the Subdifferential................................................. 1 1 The Elementary Mechanism.................................................................... 2 2 Convergence Properties........................................................................... 2.1 Convergence..................................................................................... 2.2 Speed of Convergence .......................... 3 Putting the Mechanism in Perspective.................................................... 3.1 Bundling as a Substitute for Steepest Descent................................. 3.2 Bundling as an Emergency Device for Descent Methods ..... 3.3 Bundling as a Separation Algorithm .............................................. 9 9 15 24 24 27 29 X. Conjugacy in Convex Analysis ................................................................. 35 1 The Convex Conjugate of a Function.................................................... 1.1 Definition and First Examples................ .......................................... 1.2 Interpretations................................................................. 1.3 First Properties.................................................................................. 1.4 Subdifferentials of Extended-Valued Functions............. ................ 1.5 Convexification and Subdifferentiability ....................................... 37 37 40 42 47 49 2 Calculus Rules on the Conjugacy
Operation........................................... 2.1 Image of a Function Under a Linear Mapping................................. 2.2 Pre-Composition with an Affine Mapping....................................... 54 54 56 2.3 Sum of Two Functions ........................................................................ 61 2.4 Infima and Suprema........................................................................... 2.5 Post-Composition with an Increasing Convex Function................ 2.6 A Glimpse of Biconjugate Calculus................................................. 3 Various Examples..................................................................................... 3.1 The Cramer Transformation.............................................................. 3.2 Some Results on the Euclidean Distance to a Closed Set............. 3.3 The Conjugate of Convex Partially Quadratic Functions............. 3.4 Polyhedral Functions........................................................................ 4 Differentiability of a Conjugate Function.............................................. 4.1 First-Order Differentiability.............................................................. 4.2 Towards Second-Order Differentiability........................................... 65 69 71 72 72 73 75 76 79 79 82
VI Table of Contents Part II XI. Approximate Subdifferentials of Convex Functions................................. 91 1 The Approximate Subdifferential........................................................... 1.1 Definition, First Properties and Examples........................................ 1.2 Characterization via the Conjugate Function................................. 1.3 Some Useful Properties..................................................................... 92 92 95 98 2 The Approximate Directional Derivative................................................. 102 2.1 The Support Function of the Approximate Subdifferential .... 102 2.2 Properties of the Approximate Difference Quotient.......................... 106 2.3 Behaviour of // and Te as Functions of e........................................... 110 3 Calculus Rules on the Approximate Subdifferential................................. 113 3.1 Sum of Functions.................................................................................. 113 3.2 Pre-Composition with an Affine Mapping........................................... 116 3.3 Image and Marginal Functions........................................................... 118 3.4 A Study of the Intimai Convolution.....................................................119 3.5 Maximum of Functions........................................................................ 123 3.6 Post-Composition with an Increasing Convex Function.................125 4 The Approximate Subdifferential as a Multifunction.............................. 127 4.1 Continuity Properties of the
Approximate Subdifferential............. 127 4.2 Transportation of Approximate Subgradients.................................... 129 XII. Abstract Duality for Practitioners................................................................. 137 1 The Problem and the General Approach.....................................................137 1.1 The Rules of the Game........................................................................ 137 1.2 Examples............................................................................................... 141 2 The Necessary Theory ............................................................................... 147 2.1 Preliminary Results: The Dual Problem.............................................. 147 2.2 First Properties of the Dual Problem................................................. 150 2.3 Primal-Dual Optimality Characterizations ........................................ 154 2.4 Existence of Dual Solutions................................................................. 157 3 Illustrations.................................................................................................161 3.1 The Minimax Point of View..................................................................161 3.2 Inequality Constraints........................................................................... 162 3.3 Dualization of Linear Programs........................................................... 165 3.4 Dualization of Quadratic Programs.....................................................166 3.5 Steepest-Descent Directions
.............................................................. 168 4 Classical Dual Algorithms.......................................................................... 170 4.1 Subgradient Optimization..................................................................... 171 4.2 The Cutting-Plane Algorithm.............................................................. 174 5 Putting the Method in Perspective............................... 178 5.1 The Primal Function........................................................................... 178 5.2 Augmented Lagrangians..................................................................... 181 5.3 The Dualization Scheme in Various Situations................................. 185 5.4 Fenchel’s Duality.................................................................................. 190
Table of Contents Part П VII XIII. Methods of e-Descent..................................................................................... 195 1 Introduction. Identifying the Approximate Subdifferential .................... 195 1.1 The Problem and Its Solution.............................................................. 195 1.2 The Line-Search Function.................................................................... 199 1.3 The Schematic Algorithm.................................................................... 203 2 A Direct Implementation: Algorithm of e-Descent................................ 206 2.1 Iterating the Line-Search.................................................................... 206 2.2 Stopping the Line-Search . . ....................................................... . 209 2.3 The e-Descent Algorithm and Its Convergence................................ 212 3 Putting the Algorithm in Perspective....................................................... 216 3.1 A Pure Separation Form....................................................................... 216 3.2 A Totally Static Minimization Algorithm.......................................... 219 XIV. Dynamic Construction of Approximate Subdifferentials: Dual Form of Bundle Methods ...........................................................223 1 Introduction: The Bundle of Information................................................. 223 1.1 Motivation........................................................................................... 223 1.2 Constructing the Bundle of
Information............................................. 227 2 Computing the Direction.......................................................................... 233 2.1 The Quadratic Program....................................................................... 233 2.2 Minimality Conditions....................................................................... 236 2.3 Directional Derivatives Estimates....................................................... 241 2.4 The Role of the Cutting-Plane Function............................................. 244 3 The Implementable Algorithm ................................................................. 248 3.1 Derivation of the Line-Search..............................................................248 3.2 The Implementable Line-Search and Its Convergence . ...... 250 3.3 Derivation of the Descent Algorithm.................................................254 3.4 The Implementable Algorithm and Its Convergence .......................257 4 Numerical Illustrations.............................................................................. 263 4.1 Typical Behaviour................................................................................. 263 4.2 The Role of £........................................................................................266 4.3 A Variant with Infinite £ : Conjugate Subgradients.......................... 268 4.4 The Role of the Stopping Criterion.................................................... 269 4.5 The Role of Other Parameters..............................................................271 4.6
General Conclusions...........................................................................273 XV. Acceleration of the Cutting-Plane Algorithm: Primal Forms of Bundle Methods........................................................ 275 1 Accelerating the Cutting-Plane Algorithm................................................. 275 1.1 Instability of Cutting Planes................................................................. 276 1.2 Stabilizing Devices: Leading Principles............................................. 279 1.3 A Digression: Step-Control Strategies ............................................. 283 2 A Variety of Stabilized Algorithms.......................................................... 285 2.1 The Trust-Region Point of View ....................................................... 286
vin Table of Contents Part II 2.2 The Penalization Point of View...........................................................289 2.3 The Relaxation Point of View.............................................................. 292 2.4 A Possible Dual Point of View...........................................................295 2.5 Conclusion........................................................................................... 299 3 A Class of Primal Bundle Algorithms....................................................... 301 3.1 The General Method........................................................................... 301 3.2 Convergence........................................................................................ 307 3.3 Appropriate Stepsize Values .............................................................. 314 4 Bundle Methods as Regularizations...........................................................317 4.1 Basic Properties of the Moreau-Yosida Regularization................. 317 4.2 Minimizing the Moreau-Yosida Regularization................................. 322 4.3 Computing the Moreau-Yosida Regularization................................. 326 Bibliographical Comments References Index ..................................................................................... 331 ............................................................................................................... 337 .........................................................................................................................345
Table of Contents Part I Introduction...............................................................................................................XV I. Convex Functions of One Real Variable.................................................... 1 1 Basic Definitions and Examples.............................................................. 1.1 First Definitions of a Convex Function........................................... 1.2 Inequalities with More Than Two Points....................................... 1.3 Modern Definition of Convexity.................................................... 2 First Properties.......................... 2.1 Stability Under Functional Operations........................................... 2.2 Limits of Convex Functions.............................................................. 2.3 Behaviour at Infinity........................................................................ 1 2 6 8 9 9 11 14 3 Continuity Properties.............................................................................. 3.1 Continuity on the Interior of the Domain....................................... 3.2 Lower Semi-Continuity: Closed Convex Functions....................... 3.3 Properties of Closed Convex Functions........................................... 4 First-Order Differentiation .................................................................... 4.1 One-Sided Differentiability of Convex Functions.......................... 4.2 Basic Properties of Subderivatives................................................. 4.3 Calculus
Rules.................................................................................. 5 Second-Order Differentiation................................................................. 5.1 The Second Derivative of a Convex Function................................. 5.2 One-Sided Second Derivatives........................................................ 5.3 How to Recognize a Convex Function.............................................. 6 First Steps into the Theory of Conjugate Functions.............................. 6.1 Basic Properties of the Conjugate.................................................... 6.2 Differentiation of the Conjugate........................................................ 6.3 Calculus Rules with Conjugacy........................................................ 16 16 17 19 20 21 24 27 29 30 32 33 36 38 40 43 II. Introduction to Optimization Algorithms ................................................. 47 1 Generalities............................................................................................. 1.1 The Problem..................................................................................... 1.2 General Structure of Optimization Schemes ................................. 1.3 General Structure of Optimization Algorithms.............................. 2 Defining the Direction.............................................................................. 47 47 50 52 54
X Table of Contents Part I 2.1 Descent and Steepest-Descent Directions....................................... 2.2 First-Order Methods ....................................................................... 2.3 Newtonian Methods.......................................................................... 2.4 Conjugate-Gradient Methods.......................................................... 3 Line-Searches........................................................................................... 3.1 General Structure of a Line-Search................................................. 3.2 Designing the Test (0), (R), (L)....................................................... 3.3 The Wolfe Line-Search.................................................................... 3.4 Updating the Trial Stepsize............................................................. III. Convex Sets................................................................................................. 1 Generalities.............................................................................................. 1.1 Definition and First Examples.......................................................... 1.2 Convexity-Preserving Operations on Sets....................................... 1.3 Convex Combinations and Convex Hulls....................................... 1.4 Closed Convex Sets and Hulls ....................................................... 2 Convex Sets Attached to a Convex Set................................................. 2.1 The Relative
Interior....................................................................... 2.2 The Asymptotic Cone....................................................................... 2.3 Extreme Points................................................................................. 2.4 Exposed Faces ................................................................................. 3 Projection onto Closed Convex Sets....................................................... 3.1 The Projection Operator.................................................................... 3.2 Projection onto a Closed Convex Cone.......................................... 4 Separation and Applications.................................................................... 4.1 Separation Between Convex Sets.................................................... 4.2 First Consequences of the Separation Properties.......................... 4.3 The Lemma of Minkowski-Farkas ................................................. 5 Conical Approximations of Convex Sets .............................................. 5.1 Convenient Definitions of Tangent Cones....................................... 5.2 The Tangent and Normal Cones to a Convex Set.......................... 5.3 Some Properties of Tangent and Normal Cones............................. IV. Convex Functions of Several Variables .................................................... 1 Basic Definitions and Examples.............................................................. 1.1 The Definitions of a Convex Function.............................................. 1.2
Special Convex Functions: Affinity and Closedness....................... 1.3 First Examples.................................................................................. 2 Functional Operations Preserving Convexity....................................... 2.1 Operations Preserving Closedness ................................................. 2.2 Dilations and Perspectives of a Function....................................... 2.3 Infimal Convolution........................................................................... 2.4 Image of a Function Under a Linear Mapping................................. 2.5 Convex Hull and Closed Convex Hull of a Function....................
Table of Contents Part I XI 3 Local and Global Behaviour of a Convex Function................................. 173 3.1 Continuity Properties........................................................................... 173 3.2 Behaviour at Infinity........................................................................... 178 4 First-and Second-Order Differentiation.................................................... 183 4.1 Differentiable Convex Functions........................................................183 4.2 Nondifferentiable Convex Functions................................................. 188 4.3 Second-Order Differentiation.............................................................. 190 V. Sublinearity and Support Functions.................................................... ... . 195 1 Sublinear Functions.................................................................................... 197 1.1 Definitions and First Properties...........................................................197 1.2 Some Examples.................................................................................... 201 1.3 The Convex Cone of All Closed Sublinear Functions....................... 206 2 The Support Function of a Nonempty Set.................................................208 2.1 Definitions, Interpretations................................................................. 208 2.2 Basic Properties.............................................................................. . 211 2.3
Examples.............................................................................................. 215 3 The Isomorphism Between Closed Convex Sets and Closed Sublinear Functions............................................................. 218 3.1 The Fundamental Correspondence.................................................... 218 3.2 Example: Norms and Their Duals, Polarity....................................... 220 3.3 Calculus with Support Functions....................................................... 225 3.4 Example: Support Functions of Closed Convex Polyhedra .... 234 VI. Subdifferentials of Finite Convex Functions.................................................237 1 The Subdifferential: Definitions and Interpretations................................ 238 1.1 First Definition: Directional Derivatives............................................. 238 1.2 Second Definition: Minorization by Affine Functions.......................241 1.3 Geometric Constructions and Interpretations....................................243 1.4 A Constructive Approach to the Existence of a Subgradient . . . 247 2 Local Properties of the Subdifferential.................................................... 249 2.1 First-Order Developments.................................................................... 249 2.2 Minimality Conditions....................................................................... 253 2.3 Mean-Value Theorems....................................................................... 256 3 First Examples
........................................................................................... 258 4 Calculus Rules with Subdifferentials....................................................... 261 4.1 Positive Combinations of Functions.................................................... 261 4.2 Pre-Composition with an Affine Mapping.......................................... 263 4.3 Post-Composition with an Increasing Convex Function of Several Variables....................................................................... 264 4.4 Supremum of Convex Functions....................................................... 266 4.5 Image of a Function Under a Linear Mapping....................................272 5 Further Examples........................................................................................275 5.1 Largest Eigenvalue of a Symmetric Matrix....................................... 275
хп Table of Contents Part I 5.2 Nested Optimization........................................................................... 277 5.3 Best Approximation of a Continuous Function on a Compact Interval.................................................................... 278 6 The Subdifferential as a Multifunction.................................................... 279 6.1 Monotonicity Properties of the Subdififerential................................. 280 6.2 Continuity Properties of the Subdifferential....................................... 282 6.3 Subdifferentials and Limits of Gradients...........................................284 VII. Constrained Convex Minimization Problems: Minimality Conditions, Elements of Duality Theory ....................... 291 1 Abstract Minimality Conditions................................................................. 292 1.1 A Geometric Characterization.............................................................. 293 1.2 Conceptual Exact Penalty.................................................................... 298 2 Minimality Conditions Involving Constraints Explicitly.......................... 301 2.1 Expressing the Normal and Tangent Cones in Terms of the Constraint-Functions.......................................................... 303 2.2 Constraint Qualification Conditions.................................................... 307 2.3 The Strong Slater Assumption...........................................................311 2.4 Tackling the Minimization Problem with Its Data Directly .... 314 3 Properties and Interpretations of the
Multipliers....................................... 317 3.1 Multipliers as a Means to Eliminate Constraints: the Lagrange Function................................................................. 317 3.2 Multipliers and Exact Penalty.............................................................. 320 3.3 Multipliers as Sensitivity Parameters with Respect to Perturbations.............................................................................. 323 4 Minimality Conditions and Saddle-Points................................................. 327 4.1 Saddle-Points: Definitions and First Properties................................. 327 4.2 Mini-Maximization Problems.............................................................. 330 4.3 An Existence Result.............................................................................. 333 4.4 Saddle-Points of Lagrange Functions................................................. 336 4.5 A First Step into Duality Theory....................................................... 338 VIII. Descent Theory for Convex Minimization: The Case of Complete Information....................................................343 1 Descent Directions and Steepest-Descent Schemes................................. 343 1.1 Basic Definitions................................................................................. 343 1.2 Solving the Direction-Finding Problem.............................................. 347 1.3 Some Particular Cases ........................................................................ 351 1.4
Conclusion........................................................................................... 355 2 Illustration. The Finite Minimax Problem................................................. 356 2.1 The Steepest-Descent Method for Finite Minimax Problems . . . 357 2.2 Non-Convergence of the Steepest-Descent Method.......................... 363 2.3 Connection with Nonlinear Programming........................................... 366
Table of Contents Part I XIII 3 The Practical Value of Descent Schemes................................................. 371 3.1 Large Minimax Problems.................................................................... 371 3.2 Infinite Minimax Problems................................................................. 373 3.3 Smooth but Stiff Functions................................................................. 374 3.4 The Steepest-Descent Trajectory....................................................... 377 3.5 Conclusion........................................................................................... 383 Appendix: Notations 1 2 3 4 5 6 .............................................................................................. 385 Some Facts About Optimization................................................................. 385 The Set of Extended Real Numbers.......................................................... 388 Linear and Bilinear Algebra....................................................................... 390 Differentiation in a Euclidean Space ....................................................... 393 Set-Valued Analysis.................................................................................... 396 A Bird’s Eye View of Measure Theory and Integration.......................... 399 Bibliographical Comments References Index .................................................................................... 401 .............................................................................................................. 407
........................................................................................................................ 415
|
| any_adam_object | 1 |
| author | Hiriart-Urruty, Jean-Baptiste 1949- Lemaréchal, Claude 1944- |
| author_GND | (DE-588)128857102 (DE-588)128857137 |
| author_facet | Hiriart-Urruty, Jean-Baptiste 1949- Lemaréchal, Claude 1944- |
| author_role | aut aut |
| author_sort | Hiriart-Urruty, Jean-Baptiste 1949- |
| author_variant | j b h u jbhu c l cl |
| building | Verbundindex |
| bvnumber | BV008552202 |
| classification_rvk | SK 750 |
| classification_tum | MAT 520f MAT 916f MAT 469f |
| ctrlnum | (OCoLC)165173814 (DE-599)BVBBV008552202 |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02173nam a2200505 cc4500</leader><controlfield tag="001">BV008552202</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20231219 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">931230s1993 gw |||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387568522</subfield><subfield code="9">0-387-56852-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540568522</subfield><subfield code="9">3-540-56852-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642081620</subfield><subfield code="9">978-3-642-08162-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)165173814</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008552202</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">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 750</subfield><subfield code="0">(DE-625)143254:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 520f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">65K10</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 916f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90C25</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">52A41</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 469f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hiriart-Urruty, Jean-Baptiste</subfield><subfield code="d">1949-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)128857102</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Convex analysis and minimization algorithms</subfield><subfield code="n">2</subfield><subfield code="p">Advanced theory and bundle methods</subfield><subfield code="c">Jean-Baptiste Hiriart-Urruty ; Claude Lemaréchal</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin u.a.</subfield><subfield code="b">Springer</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVII, 346 S.</subfield><subfield code="b">Diagramme</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">Grundlehren der mathematischen Wissenschaften</subfield><subfield code="v">306</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Grundlehren der mathematischen Wissenschaften</subfield><subfield code="v">...</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Hier auch später erschienene, unveränderte Nachdrucke</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Konvexe Analysis</subfield><subfield code="0">(DE-588)4138566-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Konvexe Analysis</subfield><subfield code="0">(DE-588)4138566-4</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">Lemaréchal, Claude</subfield><subfield code="d">1944-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)128857137</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="w">(DE-604)BV008398102</subfield><subfield code="g">2</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-662-06409-2</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Grundlehren der mathematischen Wissenschaften</subfield><subfield code="v">306</subfield><subfield code="w">(DE-604)BV000000395</subfield><subfield code="9">306</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - ADAM Catalogue Enrichment</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=005621410&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-005621410</subfield></datafield></record></collection> |
| id | DE-604.BV008552202 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:21:01Z |
| institution | BVB |
| isbn | 0387568522 3540568522 9783642081620 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005621410 |
| oclc_num | 165173814 |
| open_access_boolean | |
| owner | DE-12 DE-20 DE-384 DE-91G DE-BY-TUM DE-824 DE-29T DE-739 DE-703 DE-19 DE-BY-UBM DE-706 DE-634 DE-83 DE-11 DE-188 |
| owner_facet | DE-12 DE-20 DE-384 DE-91G DE-BY-TUM DE-824 DE-29T DE-739 DE-703 DE-19 DE-BY-UBM DE-706 DE-634 DE-83 DE-11 DE-188 |
| physical | XVII, 346 S. Diagramme |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| publisher | Springer |
| record_format | marc |
| series | Grundlehren der mathematischen Wissenschaften |
| series2 | Grundlehren der mathematischen Wissenschaften |
| spelling | Hiriart-Urruty, Jean-Baptiste 1949- Verfasser (DE-588)128857102 aut Convex analysis and minimization algorithms 2 Advanced theory and bundle methods Jean-Baptiste Hiriart-Urruty ; Claude Lemaréchal Berlin u.a. Springer 1993 XVII, 346 S. Diagramme txt rdacontent n rdamedia nc rdacarrier Grundlehren der mathematischen Wissenschaften 306 Grundlehren der mathematischen Wissenschaften ... Hier auch später erschienene, unveränderte Nachdrucke Konvexe Analysis (DE-588)4138566-4 gnd rswk-swf Konvexe Analysis (DE-588)4138566-4 s DE-604 Lemaréchal, Claude 1944- Verfasser (DE-588)128857137 aut (DE-604)BV008398102 2 Erscheint auch als Online-Ausgabe 978-3-662-06409-2 Grundlehren der mathematischen Wissenschaften 306 (DE-604)BV000000395 306 Digitalisierung UB Passau - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005621410&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Hiriart-Urruty, Jean-Baptiste 1949- Lemaréchal, Claude 1944- Convex analysis and minimization algorithms Grundlehren der mathematischen Wissenschaften Konvexe Analysis (DE-588)4138566-4 gnd |
| subject_GND | (DE-588)4138566-4 |
| title | Convex analysis and minimization algorithms |
| title_auth | Convex analysis and minimization algorithms |
| title_exact_search | Convex analysis and minimization algorithms |
| title_full | Convex analysis and minimization algorithms 2 Advanced theory and bundle methods Jean-Baptiste Hiriart-Urruty ; Claude Lemaréchal |
| title_fullStr | Convex analysis and minimization algorithms 2 Advanced theory and bundle methods Jean-Baptiste Hiriart-Urruty ; Claude Lemaréchal |
| title_full_unstemmed | Convex analysis and minimization algorithms 2 Advanced theory and bundle methods Jean-Baptiste Hiriart-Urruty ; Claude Lemaréchal |
| title_short | Convex analysis and minimization algorithms |
| title_sort | convex analysis and minimization algorithms advanced theory and bundle methods |
| topic | Konvexe Analysis (DE-588)4138566-4 gnd |
| topic_facet | Konvexe Analysis |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005621410&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV008398102 (DE-604)BV000000395 |
| work_keys_str_mv | AT hiriarturrutyjeanbaptiste convexanalysisandminimizationalgorithms2 AT lemarechalclaude convexanalysisandminimizationalgorithms2 |