LINDOGlobal

LINDO Global employs branch-and-cut methods to break an nonlinearly constrained optimization problem model down into a list of subproblems. Each subproblem is analyzed and either a) is shown to not have a feasible or optimal solution, or b) an optimal solution to the subproblem is found, e.g., because the subproblem is shown to be convex, or c) the subproblem is further split into two or more subproblems which are then placed on the list. Given appropriate tolerances, after a finite, though possibly large number of steps a solution provably global optimal to tolerances is returned.


References in zbMATH (referenced in 37 articles , 1 standard article )

Showing results 1 to 20 of 37.
Sorted by year (citations)

1 2 next

  1. Cozad, Alison; Sahinidis, Nikolaos V.: A global MINLP approach to symbolic regression (2018)
  2. Kılınç, Mustafa R.; Sahinidis, Nikolaos V.: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (2018)
  3. Montanher, Tiago; Neumaier, Arnold; Domes, Ferenc: A computational study of global optimization solvers on two trust region subproblems (2018)
  4. Zhou, Kai; Kılınç, Mustafa R.; Chen, Xi; Sahinidis, Nikolaos V.: An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (2018)
  5. Andrea Callia D’Iddio, Michael Huth: Manyopt: An Extensible Tool for Mixed, Non-Linear Optimization Through SMT Solving (2017) arXiv
  6. Cafieri, Sonia; Omheni, Riadh: Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes (2017)
  7. Gerard, D.; Köppe, M.; Louveaux, Q.: Guided dive for the spatial branch-and-bound (2017)
  8. Khan, Kamil A.; Watson, Harry A. J.; Barton, Paul I.: Differentiable McCormick relaxations (2017)
  9. Newby, Eric; Ali, M. M.: Linear transformation based solution methods for non-convex mixed integer quadratic programs (2017)
  10. Puranik, Yash; Sahinidis, Nikolaos V.: Domain reduction techniques for global NLP and MINLP optimization (2017)
  11. Puranik, Yash; Sahinidis, Nikolaos V.: Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (2017)
  12. Birgin, E. G.; Lobato, R. D.; Martínez, J. M.: Packing ellipsoids by nonlinear optimization (2016)
  13. Boukouvala, Fani; Misener, Ruth; Floudas, Christodoulos A.: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (2016)
  14. Grimstad, Bjarne; Sandnes, Anders: Global optimization with spline constraints: a new branch-and-bound method based on B-splines (2016)
  15. Zhang, Yan; Sahinidis, Nikolaos V.: Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment (2016)
  16. Bao, Xiaowei; Khajavirad, Aida; Sahinidis, Nikolaos V.; Tawarmalani, Mohit: Global optimization of nonconvex problems with multilinear intermediates (2015)
  17. Frank, Stephen M.; Rebennack, Steffen: Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach (2015)
  18. Berthold, Timo: RENS. The optimal rounding (2014)
  19. Berthold, Timo; Gleixner, Ambros M.: Undercover: a primal MINLP heuristic exploring a largest sub-MIP (2014)
  20. Khazaei, Javad; Downward, Anthony; Zakeri, Golbon: Modelling counter-intuitive effects on cost and air pollution from intermittent generation (2014)

1 2 next