001440779 000__ 04648cam\a2200601\i\4500
001440779 001__ 1440779
001440779 003__ OCoLC
001440779 005__ 20230309004701.0
001440779 006__ m\\\\\o\\d\\\\\\\\
001440779 007__ cr\un\nnnunnun
001440779 008__ 211104s2021\\\\sz\a\\\\ob\\\\001\0\eng\d
001440779 019__ $$a1283140130$$a1283822097$$a1287771733$$a1293455879
001440779 020__ $$a9783030854508$$q(electronic bk.)
001440779 020__ $$a3030854507$$q(electronic bk.)
001440779 020__ $$z9783030854492
001440779 020__ $$z3030854493
001440779 0247_ $$a10.1007/978-3-030-85450-8$$2doi
001440779 035__ $$aSP(OCoLC)1282600450
001440779 040__ $$aYDX$$beng$$erda$$epn$$cYDX$$dGW5XE$$dEBLCP$$dDCT$$dOCLCF$$dOCLCO$$dN$T$$dOCLCQ$$dCOM$$dOCLCO$$dAMH$$dUKAHL$$dOCLCQ
001440779 049__ $$aISEA
001440779 050_4 $$aT57.7$$b.L8 2021eb
001440779 050_4 $$aT57.74$$b.L84 2021eb
001440779 08204 $$a519.7/2$$223
001440779 1001_ $$aLuenberger, David G.,$$d1937-$$eauthor.
001440779 24510 $$aLinear and nonlinear programming /$$cDavid G. Luenberger, Yinyu Ye.
001440779 250__ $$aFifth edition.
001440779 264_1 $$aCham :$$bSpringer,$$c[2021]
001440779 264_4 $$c©2021
001440779 300__ $$a1 online resource :$$billustrations
001440779 336__ $$atext$$btxt$$2rdacontent
001440779 337__ $$acomputer$$bc$$2rdamedia
001440779 338__ $$aonline resource$$bcr$$2rdacarrier
001440779 347__ $$atext file
001440779 347__ $$bPDF
001440779 4901_ $$aInternational series in operations research & management science,$$x2214-7934 ;$$vvolume 228
001440779 504__ $$aIncludes bibliographical references and index.
001440779 5050_ $$a1. Introduction -- Part I: Linear Programming -- 2. Basic Properties of Linear Programs -- 3. Duality and Complementarity -- 4. The Simplex Method -- 5. Interior-Point Methods -- 6. Conic Linear Programming -- Part II: Unconstrained Problems -- 7. Basic Properties of Solutions and Algorithms -- 8. Basic Descent Methods -- 9. Conjugate Direction Methods -- 10. Quasi-Newton Methods -- Part III: Constrained Optimization -- 11. Constrained Optimization Conditions -- 12. Primal Methods -- 13. Penalty and Barrier Methods -- 14. Local Duality and Dual Methods -- 15. Primal-Dual Methods.
001440779 506__ $$aAccess limited to authorized users.
001440779 520__ $$aThe 5th edition of this classic textbook covers the central concepts of practical optimization techniques, with an emphasis on methods that are both state-of-the-art and popular. One major insight is the connection between the purely analytical character of an optimization problem and the behavior of algorithms used to solve that problem. End-of-chapter exercises are provided for all chapters. The material is organized into three separate parts. Part I offers a self-contained introduction to linear programming. The presentation in this part is fairly conventional, covering the main elements of the underlying theory of linear programming, many of the most effective numerical algorithms, and many of its important special applications. Part II, which is independent of Part I, covers the theory of unconstrained optimization, including both derivations of the appropriate optimality conditions and an introduction to basic algorithms. This part of the book explores the general properties of algorithms and defines various notions of convergence. In turn, Part III extends the concepts developed in the second part to constrained optimization problems. Except for a few isolated sections, this part is also independent of Part I. As such, Parts II and III can easily be used without reading Part I and, in fact, the book has been used in this way at many universities. New to this edition are popular topics in data science and machine learning, such as the Markov Decision Process, Farkas' lemma, convergence speed analysis, duality theories and applications, various first-order methods, stochastic gradient method, mirror-descent method, Frank-Wolf method, ALM/ADMM method, interior trust-region method for non-convex optimization, distributionally robust optimization, online linear programming, semidefinite programming for sensor-network localization, and infeasibility detection for nonlinear optimization.
001440779 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed November 5, 2021).
001440779 650_0 $$aLinear programming.
001440779 650_0 $$aNonlinear programming.
001440779 650_6 $$aProgrammation linéaire.
001440779 650_6 $$aProgrammation non linéaire.
001440779 655_0 $$aElectronic books.
001440779 7001_ $$aYe, Yinyu,$$eauthor.
001440779 830_0 $$aInternational series in operations research & management science ;$$v228.$$x2214-7934
001440779 852__ $$bebk
001440779 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-85450-8$$zOnline Access$$91397441.1
001440779 909CO $$ooai:library.usi.edu:1440779$$pGLOBAL_SET
001440779 980__ $$aBIB
001440779 980__ $$aEBOOK
001440779 982__ $$aEbook
001440779 983__ $$aOnline
001440779 994__ $$a92$$bISE