BARON
BARON is a computational system for solving nonconvex optimization problems to global optimality. Purely continuous, purely integer, and mixed-integer nonlinear problems can be solved with the software. The Branch And Reduce Optimization Navigator derives its name from its combining constraint propagation, interval analysis, and duality in its reduce arsenal with enhanced branch and bound concepts as it winds its way through the hills and valleys of complex optimization problems in search of global solutions
Keywords for this software
References in zbMATH (referenced in 189 articles , 1 standard article )
Showing results 1 to 20 of 189.
Sorted by year (- Birgin, E.G.; Lobato, R.D.; Martínez, J.M.: Packing ellipsoids by nonlinear optimization (2016)
- Brás, Carmo; Eichfelder, Gabriele; Júdice, Joaquim: Copositivity tests based on the linear complementarity problem (2016)
- Bugarin, Florian; Henrion, Didier; Lasserre, Jean Bernard: Minimizing the sum of many rational functions (2016)
- Caprara, Alberto; Locatelli, Marco; Monaci, Michele: Theoretical and computational results about optimality-based domain reductions (2016)
- Castro, Pedro M.: Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (2016)
- Dalkiran, Evrim; Sherali, Hanif D.: RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (2016)
- de Klerk, Etienne: Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization (2016)
- Domes, Ferenc; Neumaier, Arnold: Constraint aggregation for rigorous global optimization (2016)
- Haugh, Martin; Iyengar, Garud; Wang, Chun: Tax-aware dynamic asset allocation (2016)
- Hellemo, Lars; Tomasgard, Asgeir: A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints (2016)
- Kronqvist, Jan; Lundell, Andreas; Westerlund, Tapio: The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming (2016)
- Lejeune, Miguel A.; Margot, François: Solving chance-constrained optimization problems with stochastic quadratic inequalities (2016)
- Newby, Eric; Ali, M.Montaz: Transformation-based preprocessing for mixed-integer quadratic programs (2016)
- Zhang, Yan; Sahinidis, Nikolaos V.: Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment (2016)
- Zheng, Yue; Zhu, Zhihui; Yuan, Liuyang: Partially-shared pessimistic bilevel multi-follower programming: concept, algorithm, and application (2016)
- Bao, Xiaowei; Khajavirad, Aida; Sahinidis, Nikolaos V.; Tawarmalani, Mohit: Global optimization of nonconvex problems with multilinear intermediates (2015)
- Deng, Zhibin; Fang, Shu-Cherng; Jin, Qingwei; Lu, Cheng: Conic approximation to nonconvex quadratic programming with convex quadratic constraints (2015)
- Domes, Ferenc; Neumaier, Arnold: Rigorous verification of feasibility (2015)
- Gleixner, Ambros M.: Exact and fast algorithms for mixed-integer nonlinear programming (2015)
- Kearfott, Ralph Baker: Some observations on exclusion regions in branch and bound algorithms (2015)
Further publications can be found at: http://scholar.google.gr/citations?hl=en&user=PTXe50QAAAAJ