|
|
Sold Out
Book Categories |
| Basic Notation | ||
| 1 | Introduction | 1 |
| 2 | Background Material | 8 |
| 2.1 | Basic Functional Analysis | 8 |
| 2.2 | Directional Differentiability and Tangent Cones | 34 |
| 2.3 | Elements of Multifunctions Theory | 54 |
| 2.4 | Convex Functions | 74 |
| 2.5 | Duality Theory | 95 |
| 3 | Optimality Conditions | 146 |
| 3.1 | First Order Optimality Conditions | 147 |
| 3.2 | Second Order Necessary Conditions | 162 |
| 3.3 | Second Order Sufficient Conditions | 186 |
| 3.4 | Specific Structures | 217 |
| 3.5 | Nonisolated Minima | 245 |
| 4 | Stability and Sensitivity Analysis | 260 |
| 4.1 | Stability of the Optimal Value and Optimal Solutions | 261 |
| 4.2 | Directional Regularity | 266 |
| 4.3 | First Order Differentiability Analysis of the Optimal Value Function | 271 |
| 4.4 | Quantitative Stability of Optimal Solutions and Lagrange Multipliers | 286 |
| 4.5 | Directional Stability of Optimal Solutions | 303 |
| 4.6 | Quantitative Stability Analysis by a Reduction Approach | 314 |
| 4.7 | Second Order Analysis in Lipschitz Stable Cases | 323 |
| 4.8 | Second Order Analysis in Holder Stable Cases | 347 |
| 4.9 | Additional Results | 365 |
| 4.10 | Second Order Analysis in Functional Spaces | 386 |
| 5 | Additional Material and Applications | 401 |
| 5.1 | Variational Inequalities | 401 |
| 5.2 | Nonlinear Programming | 436 |
| 5.3 | Semi-definite Programming | 470 |
| 5.4 | Semi-infinite Programming | 496 |
| 6 | Optimal Control | 527 |
| 6.1 | Introduction | 527 |
| 6.2 | Linear and Semilinear Elliptic Equations | 528 |
| 6.3 | Optimal Control of a Semilinear Elliptic Equation | 539 |
| 6.4 | The Obstacle Problem | 558 |
| 7 | Bibliographical Notes | 570 |
| References | 583 | |
| Index | 595 |
| Price | Condition | Delivery | Seller | Action |
| $137.44 | Digital |
| WonderClub |
David Zeglis
reviewed Perturbation Analysis of Optimization Problems on March 24, 2011 Perturbation Analysis of Optimization Problems
If you read this book as first time in order to understand Computational Complexity, then you're probably not going to like it. You need to read Sipser's textbook before you read this book and make sure that you have a strong background in discrete mathematics (if not, then see Rosen's textbook in Discrete Mathematics). This book is recommended by best people in complexity and algorithms such as Scott Aaronson, Sipser, etc. You need to solve as many exercises as you go.
The book has five parts:
Part I: Algorithms
Part II: Logic
Part III: P and NP
Part IV: Inside P
Part V: Beyond NP
The most important parts are in Part I, III.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Perturbation Analysis of Optimization Problems
X
This Item is in Your Inventory
Perturbation Analysis of Optimization Problems
X
You must be logged in to review the productsX
X
X
Add Perturbation Analysis of Optimization Problems, A presentation of general results for discussing local optimality and computation of the expansion of value function and approximate solution of optimization problems, followed by their application to various fields, from physics to economics. The book is, Perturbation Analysis of Optimization Problems to the inventory that you are selling on WonderClubX
X
Add Perturbation Analysis of Optimization Problems, A presentation of general results for discussing local optimality and computation of the expansion of value function and approximate solution of optimization problems, followed by their application to various fields, from physics to economics. The book is, Perturbation Analysis of Optimization Problems to your collection on WonderClub |