2 problems
- 0 votes0 replies1 view
The chaos and NP-hardness conjecture for nonlinear systems
Let be the discretized nonlinear algebraic problem associated with a nonlinear dynamical system, and let be the corresponding optimization problem with…
- 0 votes0 replies1 view
The NP-hard criterion for canonical dual optimization
Let be the primal nonconvex optimization problem and let be its canonical dual problem. The canonical dual problem is called solvable when it has a solu…