Descripción del título
Foundations of Optimization...
Current1y there is a vast amount of literature on nonlinear programming in finite dimensions. The pub1ications deal with convex analysis and severa1 aspects of optimization. On the conditions of optima1ity they deal mainly with generali- tions of known results to more general problems and also with less restrictive assumptions. There are also more general results dealing with duality. There are yet other important publications dealing with algorithmic deve10pment and their applications. This book is intended for researchers in nonlinear programming, and deals mainly with convex analysis, optimality conditions and duality in nonlinear programming. It consolidates the classic results in this area and some of the recent results. The book has been divided into two parts. The first part gives a very comp- hensive background material. Assuming a background of matrix algebra and a senior level course in Analysis, the first part on convex analysis is self-contained, and develops some important results needed for subsequent chapters. The second part deals with optimality conditions and duality. The results are developed using extensively the properties of cones discussed in the first part. This has faci- tated derivations of optimality conditions for equality and inequality constrained problems. Further, minimum-principle type conditions are derived under less restrictive assumptions. We also discuss constraint qualifications and treat some of the more general duality theory in nonlinear programming
Monografía
monografia Rebiun38443624 https://catalogo.rebiun.org/rebiun/record/Rebiun38443624 m o d cr mnu---uuaaa 121227s1976 gw o 000 0 eng 934983681 1255221214 9783642482946 electronic bk.) 3642482945 electronic bk.) 9783540076803 3540076808 10.1007/978-3-642-48294-6 doi AU@ 000051695384 NZ1 14998236 NZ1 15331005 AU@ eng pn AU@ OCLCO OCLCQ GW5XE OCLCF UA@ COO OCLCQ EBLCP OCLCQ YDX UAB OCLCQ AU@ LEAUB OCLCQ OCLCO UKAHL OCLCO OCLCQ OCLCO OCLCQ K bicssc BUS000000 bisacsh 330 23 Bazaraa, M. S. Foundations of Optimization by M.S. Bazaraa, C.M. Shetty Berlin, Heidelberg Springer Berlin Heidelberg 1976 Berlin, Heidelberg Berlin, Heidelberg Springer Berlin Heidelberg 1 online resource (vi, 193 pages) 1 online resource (vi, 193 pages) Text txt rdacontent computer c rdamedia online resource cr rdacarrier Lecture Notes in Economics and Mathematical Systems, Mathematical Programming 0075-8442 122 I: Convex Analysis -- 1: Linear Subspaces and Affine Manifolds -- 2: Convex Sets -- 3: Convex Cones -- 4: Convex Functions -- II: Optimality Conditions and Duality -- 5: Stationary Point Optimality Conditions with Differentiability -- 6: Constraint Qualifications -- 7: Convex Programming without Differentiability -- 8: Lagrangian Duality -- 9: Conjugate Duality -- Selected References Current1y there is a vast amount of literature on nonlinear programming in finite dimensions. The pub1ications deal with convex analysis and severa1 aspects of optimization. On the conditions of optima1ity they deal mainly with generali- tions of known results to more general problems and also with less restrictive assumptions. There are also more general results dealing with duality. There are yet other important publications dealing with algorithmic deve10pment and their applications. This book is intended for researchers in nonlinear programming, and deals mainly with convex analysis, optimality conditions and duality in nonlinear programming. It consolidates the classic results in this area and some of the recent results. The book has been divided into two parts. The first part gives a very comp- hensive background material. Assuming a background of matrix algebra and a senior level course in Analysis, the first part on convex analysis is self-contained, and develops some important results needed for subsequent chapters. The second part deals with optimality conditions and duality. The results are developed using extensively the properties of cones discussed in the first part. This has faci- tated derivations of optimality conditions for equality and inequality constrained problems. Further, minimum-principle type conditions are derived under less restrictive assumptions. We also discuss constraint qualifications and treat some of the more general duality theory in nonlinear programming Economics Mathematics Économie politique Mathématiques economics. mathematics. applied mathematics. Economics. Mathematics. Shetty, C. M. Print version 9783540076803 Lecture Notes in Economics and Mathematical Systems, Mathematical Programming 122