|
|
|
|
| LEADER |
00000cam a2200000Mi 4500 |
| 001 |
EBOOKCENTRAL_ocn898768956 |
| 003 |
OCoLC |
| 005 |
20240329122006.0 |
| 006 |
m o d |
| 007 |
cr cnu---unuuu |
| 008 |
141227s2014 vtu o 100 0 eng d |
| 040 |
|
|
|a EBLCP
|b eng
|e pn
|c EBLCP
|d N$T
|d OCLCQ
|d N$T
|d OCLCF
|d DEBSZ
|d OCL
|d YDXCP
|d OCLCQ
|d MERUC
|d OCLCQ
|d OCLCO
|d K6U
|d OCLCQ
|d OCLCO
|d OCLCL
|
| 066 |
|
|
|c (S
|
| 019 |
|
|
|a 948660355
|
| 020 |
|
|
|a 9781483260174
|q (electronic bk.)
|
| 020 |
|
|
|a 1483260178
|q (electronic bk.)
|
| 029 |
1 |
|
|a DEBBG
|b BV043616883
|
| 029 |
1 |
|
|a DEBSZ
|b 431886075
|
| 029 |
1 |
|
|a DEBSZ
|b 449479323
|
| 035 |
|
|
|a (OCoLC)898768956
|z (OCoLC)948660355
|
| 050 |
|
4 |
|a T57.8
|
| 072 |
|
7 |
|a MAT
|x 003000
|2 bisacsh
|
| 072 |
|
7 |
|a MAT
|x 029000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 519.7/6
|2 23
|
| 049 |
|
|
|a UAMI
|
| 111 |
2 |
|
|a Nonlinear Programming Symposium
|n (4th :
|d 1980 :
|c University of Wisconsin--Madison)
|
| 245 |
1 |
0 |
|a Nonlinear programming 4 :
|b proceedings of the Nonlinear Programming Symposium 4 /
|c conducted by the Computer Sciences Department at the University of Wisconsin--Madison, July 14-16, 1980 ; edited by Olvi L. Mangasarian, Robert R. Meyer, Stephen M. Robinson.
|
| 260 |
|
|
|a Burlington :
|b Academic Press/Elsevier Science,
|c [2014], ©1981.
|
| 300 |
|
|
|a 1 online resource (560 pages)
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 588 |
0 |
|
|a Print version record.
|
| 505 |
8 |
|
|6 880-01
|a Chapter 3. qp-basedmethods for large-scale nonlinearly constrained optimizationabstract; 1. introduction; 2. large-scale linearly constrained optimization; 3. qp-based methods for dense problems; 4. the use of a linearly constrained subproblem; 5. extension of qp-based methods to the large-scale case; 6. representing the basis inverse; 7. the search direction for the superbasic variables; 8. an inequality qpapproach; 9. conclusions; references; chapter 4. numerical experiments with an exact l1penalty function method; abstract; 1. introduction; 2. a globally convergent algorithm.
|
| 505 |
8 |
|
|a 3. an active set method4. numerical experiments and discussion; acknowledgments; references; chapter 5. an iterative linear programming algorithmbased on an augmented lagrangian; abstract; references; chapter 6. iterative algorithmsfor singular minimization problems; abstract; 1. introduction; 2. the quadratic case; 3. nonquadratic case; 4. minimization in the presence of errors; conclusions; acknowledgments; references; chapter 7. a new derivation of symmetricpositive definite secant updates; abstract; 1. introduction and background; 2. the bfgs and dfp from the good and bad broyden methods.
|
| 505 |
8 |
|
|a 3. hereditary positive definiteness and iren sizing forsymmetric rank-two updates4. a projected bfgs from the projected broyden update; 5. updating cholesky factors; references; appendix: the scaled bfgs derivation; chapter8. on preconditioned conjugate gradient methods; abstract; i. introduction; ii. using moderate additional storage; iii. utilizing sparse second order information; references; chapter 9. finding the global minimum of a function of one variable using the method of constantsigned higher order derivatives; abstract; 1. introduction; 2. preliminary theorems and lemmas.
|
| 505 |
8 |
|
|a 3. algorithmic considerations4. application to polynomial minimization; 5. effects of calculation errors; 6. comment; references; chapter 10. on a bundle algorithmfor nonsmooth optimization; abstract; 1. introduction; 2. the algorithm without constraints; 3. linearly constrained problems; appendix; references; chapter 11. convergence results in a class ofvariable metric subgradient methods1; abstract; 1. introduction; 2. examples; 3. a class of variable metric subgradient optimizationmethods; 4. various methods; 5. behaviour on systems of linear equalities and onquadratics; 6. experiments.
|
| 500 |
|
|
|a 7. conclusion.
|
| 500 |
|
|
|a Nonlinear Programming 4.
|
| 590 |
|
|
|a ProQuest Ebook Central
|b Ebook Central Academic Complete
|
| 650 |
|
0 |
|a Nonlinear programming
|v Congresses.
|
| 650 |
|
6 |
|a Programmation non linéaire
|v Congrès.
|
| 650 |
|
7 |
|a MATHEMATICS
|x Applied.
|2 bisacsh
|
| 650 |
|
7 |
|a MATHEMATICS
|x Probability & Statistics
|x General.
|2 bisacsh
|
| 650 |
|
7 |
|a Nonlinear programming
|2 fast
|
| 655 |
|
7 |
|a Conference papers and proceedings
|2 fast
|
| 700 |
1 |
|
|a Mangasarian, Olvi L.,
|d 1934-
|1 https://id.oclc.org/worldcat/entity/E39PBJdcwKFyy4gPRK9ptftBT3
|
| 700 |
1 |
|
|a Meyer, Robert R.
|
| 700 |
1 |
|
|a Robinson, Stephen M.
|
| 710 |
2 |
|
|a University of Wisconsin--Madison.
|b Computer Sciences Department.
|
| 758 |
|
|
|i has work:
|a Nonlinear programming 4 (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCH9b6BHMb4bcwc8PtcdKMP
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
| 776 |
0 |
8 |
|i Print version:
|a Mangasarian, Olvi L.
|t Nonlinear Programming 4 : Proceedings of the Nonlinear Programming Symposium 4 Conducted by the Computer Sciences Department at the University of Wisconsin-Madison, July 14-16, 1980.
|d Burlington : Elsevier Science, ©2014
|z 9780124686625
|
| 856 |
4 |
0 |
|u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=1901726
|z Texto completo
|
| 880 |
0 |
|
|6 505-01/(S
|a Front Cover; Nonlinear Programming 4; Copyright Page; Table of Contents; CONTRIBUTORS; PREFACE; CHAPTER 1. AN UPPER TRIANGULAR MATRIX METHOD FORQUADRATIC PROGRAMMING; ABSTRACT; 1. INTRODUCTION; 2. A COMPARISON OF THREE ACTIVE SET METHODS; 3. THE CALCULATION OF d ANDλ; 4. THE REVISION OF U AND L; 5. DISCUSSION; ACKNOWLEDGMENTS; REFERENCES; CHAPTER 2. SOLVING QUADRATIC PROGRAMSBY AN EXACT PENALTY FUNCTION; ABSTRACT; 1. INTRODUCTION; 2. THE METHOD; 3. BASIC PROPERTIES; 4. FINITE CONVERGENCE; 5. COMPUTATIONAL RESULTS; ACKNOWLEDGMENT; REFERENCES.
|
| 938 |
|
|
|a EBL - Ebook Library
|b EBLB
|n EBL1901726
|
| 938 |
|
|
|a EBSCOhost
|b EBSC
|n 931576
|
| 938 |
|
|
|a YBP Library Services
|b YANK
|n 12304645
|
| 994 |
|
|
|a 92
|b IZTAP
|
