Global Optimization on an Interval

This paper provides expressions for the largest and smallest solution of a global optimization problem using an adjoint variable which represents the available one-sided improvements up to the interval “horizon”. Interpreting the problem in terms of optimal stopping or optimal starting, the resulting optimality conditions yield two-point boundary problems as in dynamic optimization problems.


Year:
2016
Laboratories:




 Record created 2016-01-26, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)