Strong Convexity and Smoothness of Solutions to Geometric Optics Problems via Dynamic Programming.
Giorgio GneccoDaniela SelviPublished in: IEEE Control. Syst. Lett. (2018)
Keyphrases
- dynamic programming
- similar problems
- benchmark problems
- practical solutions
- optimization problems
- np complete
- search methods
- coarse to fine
- test problems
- specific problems
- efficient solutions
- combinatorial optimisation
- neural network
- optimization criteria
- partial solutions
- decision problems
- state space
- cost function
- multiscale