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.


    • EPFL-REPORT-215352

    Record created on 2016-01-26, modified on 2017-05-12


  • There is no available fulltext. Please contact the lab or the authors.

Related material