Cargando…

Practical methods of optimization /

Fully describes optimization methods that are currently most valuable in solving real-life problems. Since optimization has applications in almost every branch of science and technology, the text emphasizes their practical aspects in conjunction with the heuristics useful in making them perform more...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Fletcher, Roger
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Chichester : Wiley, 2000.
Edición:2nd ed.
Temas:
Acceso en línea:Texto completo

MARC

LEADER 00000cam a2200000 a 4500
001 EBOOKCENTRAL_ocn848895470
003 OCoLC
005 20240329122006.0
006 m o d
007 cr cnu---unuuu
008 130617r20001987enk o 000 0 eng d
040 |a N$T  |b eng  |e pn  |c N$T  |d OCLCF  |d EBLCP  |d DEBSZ  |d OCLCQ  |d ZCU  |d MERUC  |d OCLCQ  |d ICG  |d DKC  |d AU@  |d OCLCQ  |d HS0  |d OCLCQ  |d OCLCO  |d SGP  |d OCLCO  |d OCLCQ  |d OCLCO  |d OCLCL 
019 |a 851315982 
020 |a 9781118723210  |q (electronic bk.) 
020 |a 111872321X  |q (electronic bk.) 
020 |z 0471494631 
020 |z 9780471494638 
029 1 |a AU@  |b 000066753891 
029 1 |a DEBBG  |b BV044176075 
029 1 |a DEBSZ  |b 397560540 
029 1 |a DEBSZ  |b 431439753 
029 1 |a DEBSZ  |b 449363961 
035 |a (OCoLC)848895470  |z (OCoLC)851315982 
050 4 |a QA402.5  |b .F57 2000eb 
072 7 |a MAT  |x 005000  |2 bisacsh 
072 7 |a MAT  |x 034000  |2 bisacsh 
082 0 4 |a 515  |2 22 
049 |a UAMI 
100 1 |a Fletcher, Roger. 
245 1 0 |a Practical methods of optimization /  |c Roger Fletcher. 
250 |a 2nd ed. 
260 |a Chichester :  |b Wiley,  |c 2000. 
300 |a 1 online resource (450 pages) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
500 |a This ed. originally published: 1987. 
588 0 |a Print version record. 
505 0 |a Cover; Title Page; Contents; Preface; Table of Notation; PART 1 UNCONSTRAINED OPTIMIZATION; Chapter 1 Introduction; 1.1 History and Applications; 1.2 Mathematical Background; Questions for Chapter 1; Chapter 2 Structure of Methods; 2.1 Conditions for Local Minima; 2.2 Ad hoc Methods; 2.3 Useful Algorithmic Properties; 2.4 Quadratic Models; 2.5 Descent Methods and Stability; 2.6 Algorithms for the Line Search Subproblem; Questions for Chapter 2; Chapter 3 Newton-like Methods; 3.1 Newton's Method; 3.2 Quasi-Newton Methods; 3.3 Invariance; 3.4 The Broyden Family; 3.5 Numerical Experiments. 
505 8 |a 3.6 Other FormulaeQuestions for Chapter 3; Chapter 4 Conjugate Direction Methods; 4.1 Conjugate Gradient Methods; 4.2 Direction Set Methods; Questions for Chapter 4; Chapter 5 Restricted Step Methods; 5.1 A Prototype Algorithm; 5.2 Levenberg-Marquardt Methods; Questions for Chapter 5; Chapter 6 Sums of Squares and Nonlinear Equations; 6.1 Over-determined Systems; 6.2 Well-determined Systems; 6.3 No-derivative Methods; Questions for Chapter 6; PART 2 CONSTRAINED OPTIMIZATION; Chapter 7 Introduction; 7.1 Preview; 7.2 Elimination and Other Transformations; Questions for Chapter 7. 
505 8 |a Chapter 8 Linear Programming8.1 Structure; 8.2 The Simplex Method; 8.3 Other LP Techniques; 8.4 Feasible Points for Linear Constraints; 8.5 Stable and Large-scale Linear Programming; 8.6 Degeneracy; 8.7 Polynomial Time Algorithms; Questions for Chapter 8; Chapter 9 The Theory of Constrained Optimization; 9.1 Lagrange Multipliers; 9.2 First Order Conditions; 9.3 Second Order Conditions; 9.4 Convexity; 9.5 Duality; Questions for Chapter 9; Chapter 10 Quadratic Programming; 10.1 Equality Constraints; 10.2 Lagrangian Methods; 10.3 Active Set Methods; 10.4 Advanced Features. 
505 8 |a 10.5 Special QP Problems10.6 Complementary Pivoting and Other Methods; Questions for Chapter 10; Chapter 11 General Linearly Constrained Optimization; 11.1 Equality Constraints; 11.2 Inequality Constraints; 11.3 Zigzagging; Questions for Chapter 11; Chapter 12 Nonlinear Programming; 12.1 Penalty and Barrier Functions; 12.2 Multiplier Penalty Functions; 12.3 The L1 Exact Penalty Function; 12.4 The Lagrange-Newton Method (SQP); 12.5 Nonlinear Elimination and Feasible Direction Methods ... ; 12.6 Other Methods; Questions for Chapter 12; Chapter 13 Other Optimization Problems. 
505 8 |a 13.1 Integer Programming13.2 Geometric Programming; 13.3 Network Programming; Questions for Chapter 13; Chapter 14 Non-Smooth Optimization; 14.1 Introduction; 14.2 Optimally Conditions; 14.3 Exact Penalty Functions; 14.4 Algorithms; 14.5 A Globally Convergent Prototype Algorithm; 14.6 Constrained Non-Smooth Optimization; Questions for Chapter 14; References; Subject Index. 
520 |a Fully describes optimization methods that are currently most valuable in solving real-life problems. Since optimization has applications in almost every branch of science and technology, the text emphasizes their practical aspects in conjunction with the heuristics useful in making them perform more reliably and efficiently. To this end, it presents comparative numerical studies to give readers a feel for possibile applications and to illustrate the problems in assessing evidence. Also provides theoretical background which provides insights into how methods are derived. This edition offers rev. 
590 |a ProQuest Ebook Central  |b Ebook Central Academic Complete 
650 0 |a Mathematical optimization. 
650 6 |a Optimisation mathématique. 
650 7 |a MATHEMATICS  |x Calculus.  |2 bisacsh 
650 7 |a MATHEMATICS  |x Mathematical Analysis.  |2 bisacsh 
650 7 |a Mathematical optimization  |2 fast 
758 |i has work:  |a Practical methods of optimization (Text)  |1 https://id.oclc.org/worldcat/entity/E39PCGXyXffvYYp8xXTQhp9GVC  |4 https://id.oclc.org/worldcat/ontology/hasWork 
776 0 8 |i Print version:  |a Fletcher, Roger.  |t Practical methods of optimization.  |b 2nd ed.  |d Chichester : Wiley, 2000  |z 0471494631  |w (OCoLC)44101933 
856 4 0 |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=1212544  |z Texto completo 
938 |a ProQuest Ebook Central  |b EBLB  |n EBL1212544 
938 |a EBSCOhost  |b EBSC  |n 595320 
994 |a 92  |b IZTAP