01130nam a2200181Ia 450000500170000000800410001702000120005808200150007010000180008524500590010325000080016226000250017030000180019550506090021394200080082299900170083095201010084720241211205615.0241211s1998    xx            000 0 und d  afcnm359  a519.3I/S47  aShor, Naum Z. 0aNondifferentiable Optimization and Polynomial Problems  a1ra  aNorwel :bKAP,c1998  a394 páginas  a1.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  yLIB  c49596d49596  00104070aBE-FCNMbBE-FCNMcTPd2017-07-11eDonacionfBuenoo519.3I/S47pFCNM597yLIBzInterno