國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Linear and nonlinear programming

Luenberger, David G.

Linear and nonlinear programming

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Linear and nonlinear programmingby David G. Luenberger, Yinyu Ye.
作者:	Luenberger, David G.
其他作者:	Ye, Yinyu.
出版者:	Cham :Springer International Publishing :2021.
面頁冊數:	xv, 609 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Linear programming.
電子資源:	https://doi.org/10.1007/978-3-030-85450-8
ISBN:	9783030854508$q(electronic bk.)

Linear and nonlinear programming
Luenberger, David G.

Linear and nonlinear programming[electronic resource] /by David G. Luenberger, Yinyu Ye. - Fifth edition. - Cham :Springer International Publishing :2021. - xv, 609 p. :ill., digital ;24 cm. - International series in operations research & management science,v. 2282214-7934 ;. - International series in operations research & management science ;v. 140..

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$q(electronic bk.)

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

185299
Linear programming.

LC Class. No.: T57.74 / .L84 2021

Dewey Class. No.: 519.72

Linear and nonlinear programming
LDR:03638nmm a2200361 a 4500 001 610411
003 DE-He213
005 20211031092241.0
006 m d
007 cr nn 008maaau
008 220330s2021 sz s 0 eng d
020 $a 9783030854508$q(electronic bk.)
020 $a 9783030854492$q(paper)
024 7 $a 10.1007/978-3-030-85450-8 $2 doi
035 $a 978-3-030-85450-8
040 $a GP $c GP
041 0 $a eng
050 4 $a T57.74 $b .L84 2021
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 519.72 $2 23
090 $a T57.74 $b .L948 2021
100 1 $a Luenberger, David G. $3 507574
245 1 0 $a Linear and nonlinear programming $h [electronic resource] / $c by David G. Luenberger, Yinyu Ye.
250 $a Fifth edition.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xv, 609 p. : $b ill., digital ; $c 24 cm.
490 1 $a International series in operations research & management science, $x 2214-7934 ; $v 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 0 $a Linear programming. $3 185299
650 0 $a Nonlinear programming. $3 185871
650 1 4 $a Operations Research/Decision Theory. $3 273963
650 2 4 $a Operations Research, Management Science. $3 511451
650 2 4 $a Mathematical Modeling and Industrial Mathematics. $3 274070
650 2 4 $a Engineering Economics, Organization, Logistics, Marketing. $3 274009
700 1 $a Ye, Yinyu. $3 284139
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a International series in operations research & management science ; $v v. 140. $3 490892
856 4 0 $u https://doi.org/10.1007/978-3-030-85450-8
950 $a Business and Management (SpringerNature-41169)