Nonlinear Programming
Detalles de publicación: United States of America : John Wiley & Sons, 1979Edición: 1raDescripción: 638 páginasISBN:- fcnm1345
- 519.76I/B29
Contenidos:
1.Introduction. 2.Convex sets 3.Convex functions and generalizations. 4.The fritz John and the Karush-Kuhn-tucker optimality conditions. 5.Constraint qualifications. 6.LaGrange duality and Saddle point optimality conditions. 7.The concept of an algorithm. 8.Unconstrained optimization. 9.Penalty and barrier functions. 10.Methods of feasible directions. 11.Linear complementary problem and quadratic, separable, fractional, and geometric programming.
| Tipo de ítem | Biblioteca actual | Signatura topográfica | Estado | Notas | Código de barras | |
|---|---|---|---|---|---|---|
| Libro | Biblioteca Especializada FCNM Tercer Piso | 519.76I/B29 (Navegar estantería(Abre debajo)) | Disponible | Interno | FCNM2291 |
1.Introduction. 2.Convex sets 3.Convex functions and generalizations. 4.The fritz John and the Karush-Kuhn-tucker optimality conditions. 5.Constraint qualifications. 6.LaGrange duality and Saddle point optimality conditions. 7.The concept of an algorithm. 8.Unconstrained optimization. 9.Penalty and barrier functions. 10.Methods of feasible directions. 11.Linear complementary problem and quadratic, separable, fractional, and geometric programming.
No hay comentarios en este titulo.
Iniciar sesión para colocar un comentario.