國立虎尾科技大學 |

Linear and Nonlinear Programming

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Linear and Nonlinear Programming/ by David G. Luenberger, Yinyu Ye.
作者:	Luenberger, David G.
其他作者:	Ye, Yinyu.
面頁冊數:	XV, 609 p. 92 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Engineering Economics, Organization, Logistics, Marketing. -
電子資源:	https://doi.org/10.1007/978-3-030-85450-8
ISBN:	9783030854508

Linear and Nonlinear Programming
Luenberger, David G.

Linear and Nonlinear Programming[electronic resource] /by David G. Luenberger, Yinyu Ye. - 5th ed. 2021. - XV, 609 p. 92 illus.online resource. - International Series in Operations Research & Management Science,2282214-7934 ;. - International Series in Operations Research & Management Science,227.

1. 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.

The 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.

ISBN: 9783030854508

Standard No.: 10.1007/978-3-030-85450-8doiSubjects--Topical Terms:

669171
Engineering Economics, Organization, Logistics, Marketing.

LC Class. No.: HD30.23

Dewey Class. No.: 658.40301

Linear and Nonlinear Programming
LDR:03967nam a22004215i 4500 001 1056827
003 DE-He213
005 20211031092241.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030854508 $9 978-3-030-85450-8
024 7 $a 10.1007/978-3-030-85450-8 $2 doi
035 $a 978-3-030-85450-8
050 4 $a HD30.23
072 7 $a KJT $2 bicssc
072 7 $a BUS049000 $2 bisacsh
072 7 $a KJT $2 thema
072 7 $a KJMD $2 thema
082 0 4 $a 658.40301 $2 23
100 1 $a Luenberger, David G. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1101535
245 1 0 $a Linear and Nonlinear Programming $h [electronic resource] / $c by David G. Luenberger, Yinyu Ye.
250 $a 5th ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XV, 609 p. 92 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a International Series in Operations Research & Management Science, $x 2214-7934 ; $v 228
505 0 $a 1. 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.
520 $a The 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.
650 2 4 $a Engineering Economics, Organization, Logistics, Marketing. $3 669171
650 2 4 $a Mathematical Modeling and Industrial Mathematics. $3 669172
650 2 4 $a Operations Research, Management Science. $3 785065
650 1 4 $a Operations Research/Decision Theory. $3 669176
650 0 $a Engineering economy. $3 632434
650 0 $a Engineering economics. $3 1253802
650 0 $a Mathematical models. $3 527886
650 0 $a Management science. $3 719678
650 0 $a Decision making. $3 528319
650 0 $a Operations research. $3 573517
700 1 $a Ye, Yinyu. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 681215
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030854492
776 0 8 $i Printed edition: $z 9783030854515
776 0 8 $i Printed edition: $z 9783030854522
830 0 $a International Series in Operations Research & Management Science, $x 0884-8289 ; $v 227 $3 1254441
856 4 0 $u https://doi.org/10.1007/978-3-030-85450-8
912 $a ZDB-2-BUM
912 $a ZDB-2-SXBM
950 $a Business and Management (SpringerNature-41169)
950 $a Business and Management (R0) (SpringerNature-43719)