Learning and propagating lagrangian variable bounds for mixed-integer nonlinear programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7874 LNCS, Issue , 2013, Pages 355-361

  Gleixner, Ambros M ^a   Weltge, Stefan ^b  

^a ZUSE INSTITUTE BERLIN   (Germany)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; BRANCH-AND-BOUND NODES; COMPUTATIONAL COSTS; LINEAR INEQUALITIES; LINEAR RELAXATIONS; MIXED-INTEGER NONLINEAR PROGRAMMING; NONCONVEX MIXED-INTEGER NONLINEAR PROGRAMMING; REDUCTION TECHNIQUES;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; CONSTRAINT THEORY; NONLINEAR PROGRAMMING; OPERATIONS RESEARCH;

LAGRANGE MULTIPLIERS;

EID: 84892918076     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38171-3_26     Document Type: Conference Paper

References (26)

1. Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications. Kluwer Academic Publishers, Dordrecht Boston London (2002)
2. Quesada, I., Grossmann, I.E.: Global optimization algorithm for heat exchanger networks. Industrial & Engineering Chemistry Research 32(3), 487-499 (1993), doi:10.1021/ie00015a012
3. Quesada, I., Grossmann, I.E.: A global optimization algorithm for linear fractional and bilinear programs. Journal of Global Optimization 6, 39-76 (1995), doi:10.1007/BF01106605
4. Maranas, C.D., Floudas, C.A.: Global optimization in generalized geometric programming. Computers & Chemical Engineering 21(4), 351-369 (1997), doi:10.1016/S0098-1354(96)00282-7
5. Smith, E.M., Pantelides, C.C.: A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Computers & Chemical Engineering 23, 457-478 (1999), doi:10.1016/S0098- 1354(98)00286-5
6. Zamora, J.M., Grossmann, I.E.: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms. Journal of Global Optimization 14, 217-249 (1999), doi:10.1023/A:1008312714792
7. Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: A global optimization method, αBB, for general twice-differentiable constrained NLPs - II. Implementation and computational results. Computers & Chemical Engineering 22(9), 1159-1179 (1998), doi:10.1016/S0098-1354(98)00218-X
8. Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: Global optimization of mixed-integer nonlinear problems. AIChE Journal 46(9), 1769-1797 (2000), doi:10.1002/aic.690460908
9. Belotti, P., Lee, J., Liberti, L., Margot, F., Wächter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optimization Methods & Software 24, 597-634 (2009), doi:10.1080/10556780903087124
10. COIN-OR: Couenne. Convex Over and Under ENvelopes for Nonlinear Estimation, http://www.coin-or.org/Couenne
11. Misener, R., Floudas, C.A.: GloMIQO: Global mixed-integer quadratic optimizer. Journal of Global Optimization, 1-48 (2012), doi:10.1007/s10898-012- 9874-7
12. Computer-Aided Systems Laboratory, Princeton University: GloMIQO. Global Mixed-Integer Quadratic Optimizer, http://helios.princeton.edu/GloMIQO
13. Nowak, I., Vigerske, S.: LaGO: a (heuristic) branch and cut algorithm for nonconvex MINLPs. Central European Journal of Operations Research 16(2), 127-138 (2008), doi:10.1007/s10100-007-0051-x
14. COIN-OR: LaGO Lagrangian Global Optimizer, http://www.coin-or.org/LaGO
15. Achterberg, T.: Constraint Integer Programming. PhD thesis, TU Berlin (2007), http://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/1018
16. Vigerske, S.: Decomposition in Multistage Stochastic Programming and a Constraint Integer Programming Approach to MINLP. PhD thesis, HU Berlin (2012)
17. Zuse Institute Berlin, Department of Optimization: SCIP. Solving Constraint Integer Programs, http://scip.zib.de
18. Caprara, A., Locatelli, M.: Global optimization problems and domain reduction strategies. Mathematical Programming 125, 123-137 (2010), doi:10.1007/s10107-008-0263-4
19. Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: A theoretical and computational study. Mathematical Programming 99, 563-591 (2004), doi:10.1007/s10107-003-0467-6
20. Berthold, T., Heinz, S., Vigerske, S.: Extending a CIP framework to solve MIQCPs. In: Lee, J., Leyffer, S. (eds.) Mixed41-Integer Nonlinear Optimization. The IMA volumes in Mathematics and its Applications, vol. 154, pp. 427-444. Springer (2012), doi:10.1007/978-1-4614-1927-3-15
21. Bussieck, M., Drud, A., Meeraus, A.: MINLPLib - a collection of test models for mixed-integer nonlinear programming. INFORMS J. on Comput. 15(1), 114-119 (2003)
22. IBM: ILOG CPLEX Optimizer, http://www-01.ibm.com/software/integration/ optimization/cplex-optimizer/
23. COIN-OR: CppAD. A Package for Differentiation of C++ Algorithms. http://www.coin-or.org/CppAD
24. Wächter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Prog. 106(1), 25-57 (2006)
25. COIN-OR: Ipopt. Interior point optimizer, http://www.coin-or.org/Ipopt
26. Gleixner, A.M., Weltge, S.: Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming. ZIB-Report 13-04, Zuse Institute Berlin (2013), http://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/1763