Advertisement

A scalable global optimization algorithm for stochastic nonlinear programs

  • Yankai Cao
  • Victor M. ZavalaEmail author
Article
  • 18 Downloads

Abstract

We present a global optimization algorithm for two-stage stochastic nonlinear programs (NLPs). The algorithm uses a tailored reduced-space spatial branch and bound (BB) strategy to exploit the nearly decomposable structure of the problem. At each node in the BB scheme, a lower bound is constructed by relaxing the so-called non-anticipativity constraints and an upper bound is constructed by fixing the first-stage variables to the current candidate solution. A key advantage of this approach is that both lower and upper bounds can be computed by solving individual scenario subproblems. Another key property of this approach is that it only needs to perform branching on the first-stage variables to guarantee convergence (branching on the second-stage variables is performed implicitly during the computation of lower and upper bounds). Notably, convergence results for this scheme also hold for two-stage stochastic MINLPs with mixed-integer first-stage variables and continuous recourse variables. We present a serial implementation of the algorithm in Julia, that we call SNGO. The implementation is interfaced to the structured modeling language Plasmo.jl, which facilitates benchmarking and model processing. Our implementation incorporates typical features that help accelerate the BB search such as LP-based lower bounding techniques, local search-based upper bounding techniques, and relaxation-based bounds tightening techniques. These strategies require the solution of extensive forms of the stochastic program but can potentially be solved using structured interior-point solvers (when the problem is an NLP). Numerical experiments are performed for a controller tuning formulation, a parameter estimation formulation for microbial growth models, and a stochastic test set from GLOBALlib. We compare the computational results against SCIP and demonstrate that the proposed approach achieves significant speedups.

Keywords

Stochastic NLP Global optimization Scalable 

Notes

Acknowledgements

We acknowledge financial support by the U.S. Department of Energy under Grant DE-SC0014114. We thank Ophelia Venturelli for providing the model and experimental data for the microbial growth estimation problem. We also thank Felipe Serrano and Ambros Gleixner for providing assistance with the use of SCIP.

References

  1. 1.
    Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Oper. Res. Lett. 33(1), 42–54 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Androulakis, I.P., Maranas, C.D., Floudas, C.A.: \(\alpha \)bb: a global optimization method for general constrained nonconvex problems. J. Glob. Optim. 7(4), 337–363 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming, 2nd edn. Springer, New York (2011)CrossRefzbMATHGoogle Scholar
  4. 4.
    Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer, New York (2013)zbMATHGoogle Scholar
  5. 5.
    CarøE, C.C., Schultz, R.: Dual decomposition in stochastic integer programming. Oper. Res. Lett. 24(1), 37–45 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Dür, M., Horst, R.: Lagrange duality and partitioning techniques in nonconvex global optimization. J. Optim. Theory Appl. 95(2), 347–369 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Epperly, T.G., Pistikopoulos, E.N.: A reduced space branch and bound algorithm for global optimization. J. Glob. Optim. 11(3), 287–311 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Fisher, M.L.: The lagrangian relaxation method for solving integer programming problems. Manag. Sci. 27(1), 1–18 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Floudas, C.A., Visweswaran, V.: Primal-relaxed dual global optimization approach. J. Optim. Theory Appl. 78(2), 187–225 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Geoffrion, A.M.: Generalized benders decomposition. J. Optim. Theory Appl. 10(4), 237–260 (1972)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Guignard, M., Kim, S.: Lagrangean decomposition: a model yielding stronger lagrangean bounds. Math. Program. 39(2), 215–228 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer, New York (2013)zbMATHGoogle Scholar
  13. 13.
    Jalving, J., Abhyankar, S., Kim, K., Hereld, M., Zavala, V.M.: A graph-based computational framework for simulation and optimization of coupled infrastructure networks. Under Review (2016)Google Scholar
  14. 14.
    Karuppiah, R., Grossmann, I.E.: A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures. J. Glob. Optim. 41(2), 163–186 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Khajavirad, A., Michalek, J.J.: A deterministic lagrangian-based global optimization approach for quasiseparable nonconvex mixed-integer nonlinear programs. J. Mech. Des. 131(5), 051,009 (2009)CrossRefGoogle Scholar
  16. 16.
    Li, X., Tomasgard, A., Barton, P.I.: Nonconvex generalized benders decomposition for stochastic separable mixed-integer nonlinear programs. J. Optim. Theory Appl. 151(3), 425 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Maher, S.J., Fischer, T., Gally, T., Gamrath, G., Gleixner, A., Gottwald, R.L., Hendel, G., Koch, T., Lübbecke, M.E., Miltenberger, M., et al.: The scip optimization suite 4.0 (2017)Google Scholar
  18. 18.
    Misener, R., Floudas, C.A.: Antigone: algorithms for continuous/integer global optimization of nonlinear equations. J. Glob. Optim. 59(2–3), 503–526 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Sherali, H.D., Adams, W.P.: A Reformulation-linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31. Springer, New York (2013)zbMATHGoogle Scholar
  20. 20.
    Smith, E.M., Pantelides, C.C.: A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex minlps. Comput. Chem. Eng. 23(4–5), 457–478 (1999)CrossRefGoogle Scholar
  21. 21.
    Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225–249 (2005)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of Chemical and Biological EngineeringUniversity of Wisconsin-MadisonMadisonUSA

Personalised recommendations