Global Optimal Trajectory in Chaos and NP-Hardness
DOI10.1142/S021812741650142XzbMath1345.34024arXiv1512.08343OpenAlexW2285595599MaRDI QIDQ2819436
David Yang Gao, Vittorio Latorre
Publication date: 29 September 2016
Published in: International Journal of Bifurcation and Chaos (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.08343
Nonconvex programming, global optimization (90C26) Initial value problems, existence, uniqueness, continuous dependence and continuation of solutions to ordinary differential equations (34A12) Theoretical approximation of solutions to ordinary differential equations (34A45) Complex behavior and chaotic systems of ordinary differential equations (34C28)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Canonical dual approach to solving the maximum cut problem
- Canonical dual least square method for solving general nonlinear systems of quadratic equations
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Canonical duality-triality theory: bridge between nonconvex analysis/mechanics and global optimization in complex system
- A novel canonical dual computational approach for prion AGAAAAGA amyloid fibril molecular modeling
- The Lorenz equations: bifurcations, chaos, and strange attractors
- Duality principles in nonconvex systems. Theory, methods and applications
- Geometric nonlinearity: potential energy, complementary energy, and the gap function
- MEMRISTOR HAMILTONIAN CIRCUITS
- Multiple solutions to non-convex variational problems with implications for phase transitions and numerical computation
This page was built for publication: Global Optimal Trajectory in Chaos and NP-Hardness