Nondifferentiable Optimization and Polynomial Problems
Detalles de publicación: Norwel : KAP, 1998Edición: 1raDescripción: 394 páginasISBN:- fcnm359
- 519.3I/S47
Contenidos:
1.Elements of convex analysis linear algebra and graft theory. 2.Subgradient and subgradient methods. 3.Subgradient type methods with space dilation. 4.Elements of information and numerical complexity of polynomial extremal problems. 5.Decomposition methods based on nonsmooth optimization. 6.Algorithms for constructions optimal on volume ellipsoids and semidefinite programming. 7.The role of ellipsoid method for complexity analysis of combinatorial graph problems. 8.Semidefinite programming bounds for extremal graph problems. 9.Global minimization of polynomial functions and 17, TH Hilbert problem
| Tipo de ítem | Biblioteca actual | Signatura topográfica | Estado | Notas | Código de barras | |
|---|---|---|---|---|---|---|
| Libro | Biblioteca Especializada FCNM Tercer Piso | 519.3I/S47 (Navegar estantería(Abre debajo)) | Disponible | Interno | FCNM597 |
Navegando Biblioteca Especializada FCNM estanterías, Ubicación en estantería: Tercer Piso Cerrar el navegador de estanterías (Oculta el navegador de estanterías)
| 519.3I/M61 Mathematical Programming Theory and Algorithms | 519.3I/P51 Convex Functions, Monotone Operators and Differentiability | 519.3I/R72 Conjugate Duality and Optimization | 519.3I/S47 Nondifferentiable Optimization and Polynomial Problems | 519.3P/B99 Encontro de Algoritmos E Otimizacao Sistemas de Grande Porte: Análise e Controle | 519.3P/C78 (S.C) Rígidez de Superfícies Convexas | 519.3P/P59 Metodos de Optimiização em Computação Grafica |
1.Elements of convex analysis linear algebra and graft theory. 2.Subgradient and subgradient methods. 3.Subgradient type methods with space dilation. 4.Elements of information and numerical complexity of polynomial extremal problems. 5.Decomposition methods based on nonsmooth optimization. 6.Algorithms for constructions optimal on volume ellipsoids and semidefinite programming. 7.The role of ellipsoid method for complexity analysis of combinatorial graph problems. 8.Semidefinite programming bounds for extremal graph problems. 9.Global minimization of polynomial functions and 17, TH Hilbert problem
No hay comentarios en este titulo.
Iniciar sesión para colocar un comentario.