MARC 닫기
00443nam ac200169 k 4500
000003559569
20220101120000
ta
010731s1969 US 000 eng
▼a 211070
▼c 211070
▼l WM0003013535
▼l WM0003015662
▼c 2
▼a T57.8
▼a T57.8
▼b Z3
▼a NONLINEAR PROGRAMMING/
▼d ZANGWILL,WILLARD I
▼a ENGLEWOOD CLIFFS:
▼b PRENTICE HALL,
▼c 1969.
▼a 356p.
▼a ZANGWILL,WILLARD I
▼a 단행본
| 자료유형 : | 단행본 |
|---|---|
| 분류기호 : | T57.8 |
| 서명/저자사항 : | NONLINEAR PROGRAMMING/ ZANGWILL,WILLARD I |
| 발행사항 : | ENGLEWOOD CLIFFS: PRENTICE HALL, 1969. |
| 형태사항 : | 356p. |
| 개인저자 : | ZANGWILL,WILLARD I |
| 언어 | 영어 |
WMO199915297
권 호 : 356
발행년 : 1969
서 명 : NONLINEAR PROGRAMMING
발행처 : ZANGWILL,WILLARD I
목차
1. THE NONLINEAR PROGRAMMING PROBLEM
2. IDENTIFYING AN OPTIMAL POINT
3. APPLICATIONS OF THE KUHN-TUCKER CONDITIONS AND DUALITY THEORY
4. THE FIRST CONVERGENCE THEOREM
5. UNCONSTRAINED PROBLEMS
6. MIXED ALGORITHMS AND QUADRATIC ACCELERATION TECHNIQUES VIA CONJUGATE
7. CONTINUITY,COMPACTNESSN, AND CLOSEDNESS
8. SOME PROCEDURES FOR LINEAR CONSTRAINTS
9. ACCELERATION TECHNIQUES AND THE QUADRATIC-PROGRAMMING PROBLEM
10. SOME PROCEDURES FOR THE NONLINEAR PROGRAMMING PROBLEM WITH AN
11. NECESSARY AND SUFFICIENT FOR COVERGENCE
12. PENALTY AND BARRIER METHODS
13. FEASIBLE-DIRECTION METHODS AND THE HAMMING PHENOMENON
14. CITTING PLANE ALGORITHM
서평쓰기