Unsolvability of some optimization problems (Q2489339): Difference between revisions

Using Hilbert's 10th problem the author shows that over an unbounded domain the integer programming, nonlinear equations, and continuous global minimization problems are undecidable, i.e., that it is impossible to construct an algorithm to find a solution for these problems or decide that the problem has no solution. Moreover, although the continuous global minimization problem can only be solved under the assumption that the solution space is bounded, the author proves that it may also be unsolvable if there are no assumptions on the objective function. In particular, if there are no assumptions on the objective function of the box-constrained global minimization problem then the problem is undecidable.