Drexel dragonThe Math ForumDonate to the Math Forum


Math Forum
 Ask Dr. Math
 Discussions
 Internet Newsletter
 MathTools
 Problems of the Week
 Teacher2Teacher
 Teacher Exchange
 Workshops

Search All of the Math Forum:
Browse our Internet Mathematics Library

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: 3SAT can be translated into continuous global optimization of polynomial
Replies: 4   Last Post: Aug 23, 2010 11:12 AM

Advanced Search
Reply to this Topic Reply to this Topic

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Jarek Duda

Posts: 23
Registered: 12/1/08
Re: 3SAT can be translated into continuous global optimization of polynomial
Posted: Aug 23, 2010 9:22 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

In local minimals of polynomial, gradient vector has all coordinates
(also polynomials) zero - there is polynomially large number of such
points.
Shouldn't gradient method for polynomials have polynomial convergence
time?

Where exponential complexity while searching global minimum of
polynomial could come from?

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2013. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.