Nondifferentiable Optimiz & Polyn Proble

N.Z. Shor

• 09 oktober 2011
• 9781441947925

Samenvatting:

Each polynomial in n variables can be written as sum of monomials with nonzero coefficients: P(:e) = L caR[a](:e), aEA{P) IX x Nondifferentiable optimization and polynomial problems where A(P) is the set of monomials contained in polynomial P.



The book is devoted to investigation of polynomial optimization problems, including Boolean problems which are the most important part of mathematical programming. It is shown that the methods of nondifferentiable optimization can be used for finding solutions of many classes of polynomial problems and for obtaining good dual estimates for optimal objective value in these problems.