000			01016nam a2200169Ia 4500
005			20241211205615.0
008			241211s1998 xx 000 0 und d
020			_afcnm359
082			_a519.3I/S47
100			_aShor, Naum Z.
245		0	_aNondifferentiable Optimization and Polynomial Problems
250			_a1ra
260			_aNorwel : _bKAP, _c1998
300			_a394 páginas
505			_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
942			_yLIB
999			_c49596 _d49596