BARON: A general purpose global optimization software package
From MaRDI portal
Publication:1924072
DOI10.1007/BF00138693zbMath0856.90104MaRDI QIDQ1924072
Publication date: 23 February 1997
Published in: Journal of Global Optimization (Search for Journal in Brave)
branch-and-boundnonconvex optimizationglobal optimalitypolynomial programmingmultiplicative programmingfixed-charge problembranch-and-reduce optimization navigator
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20)
Related Items
Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches, Minotaur: a mixed-integer nonlinear optimization toolkit, Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems, A hybrid LP/NLP paradigm for global optimization relaxations, Transformation-based preprocessing for mixed-integer quadratic programs, Theoretical and computational results about optimality-based domain reductions, Bilinear modeling solution approach for fixed charge network flow problems, Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects, Multiobjective optimization for aircraft conflict resolution. A metaheuristic approach, Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations, Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization, Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems, Sequence of polyhedral relaxations for nonlinear univariate functions, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Numerical certification of Pareto optimality for biobjective nonlinear problems, Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method, A planar single facility location and border crossing problem, A MIQCP formulation for B-spline constraints, On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming, Interactions between nonlinear programming and modeling systems, Discrete dynamical system approaches for Boolean polynomial optimization, The supporting hyperplane optimization toolkit for convex MINLP, An inverse reliability-based approach for designing under uncertainty with application to robust piston design, Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds, A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables, A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs, Certificates of infeasibility via nonsmooth optimization, A new local and global optimization method for mixed integer quadratic programming problems, A recipe for finding good solutions to MINLPs, Some results on the strength of relaxations of multilinear functions, On convex relaxations for quadratically constrained quadratic programming, Global optimization of bilinear programs with a multiparametric disaggregation technique, The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm, Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints, Convex envelopes generated from finitely many compact convex sets, Separation and relaxation for cones of quadratic forms, Convex envelopes of products of convex and component-wise concave functions, A hierarchy of relaxations for nonlinear convex generalized disjunctive programming, Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation, Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations, Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems, Reverse bridge theorem under constraint partition, Global optimization problems and domain reduction strategies, Global minimization using an augmented Lagrangian method with variable lower-level constraints, Global optimization in Hilbert space, Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control, Energy-optimal multi-goal motion planning for planar robot manipulators, Low dimensional simplex evolution: a new heuristic for global optimization, Box-constrained quadratic programs with fixed charge variables, A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures, A risk-averse stochastic program for integrated system design and preventive maintenance planning, New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation, A computational study of primal heuristics inside an MI(NL)P solver, Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions, Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes, Differentiable McCormick relaxations, Parametric mixed-integer 0-1 linear programming: The general case for a single parameter, A note on solving DiDi's driver-order matching problem, On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation, Global optimization of nonconvex problems with convex-transformable intermediates, RLT: A unified approach for discrete and continuous nonconvex optimization, Rounding-based heuristics for nonconvex MINLPS, Globally solving nonconvex quadratic programming problems via completely positive programming, A dynamic convexized method for nonconvex mixed integer nonlinear programming, Optimizing a polyhedral-semidefinite relaxation of completely positive programs, A branch-and-cut algorithm for nonconvex quadratic programs with box constraints, Conic approximation to nonconvex quadratic programming with convex quadratic constraints, Convergent upper bounds in global minimization with nonlinear equality constraints, Outer space branch and bound algorithm for solving linear multiplicative programming problems, \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems, A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs, Mixed integer programming for a special logic constrained optimal control problem, Reformulations for utilizing separability when solving convex MINLP problems, On solving quadratically constrained quadratic programming problem with one non-convex constraint, A local exploration-based differential evolution algorithm for constrained global optimization, Valid inequalities for separable concave constraints with indicator variables, Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems, Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation, Convex hull representations for bounded products of variables, BARON, Column enumeration based decomposition techniques for a class of non-convex MINLP problems, Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming, Output feedback design for discrete-time constrained systems subject to persistent disturbances via bilinear programming, Mixed integer nonlinear programming tools: a practical overview, Identification of mechanical properties of arteries with certification of global optimality, Generalization of the twisting convergence conditions to non-affine systems, A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems, An elliptical cover problem in drone delivery network design and its solution algorithms, Data-driven stochastic optimization for distributional ambiguity with integrated confidence region, Solving certain complementarity problems in power markets via convex programming, Continuous cubic formulations for cluster detection problems in networks, Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations, Robust optimization in power systems: a tutorial overview, Optimization hierarchy for fair statistical decision problems, A global optimization method, QBB, for twice-differentiable nonconvex optimization problem, Hidden invariant convexity for global and conic-intersection optimality guarantees in discrete-time optimal control, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization, A global optimization RLT-based approach for solving the fuzzy clustering problem, Interval analysis on directed acyclic graphs for global optimization, Solving planning and design problems in the process industry using mixed integer and global optimization, COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS, Linear transformation based solution methods for non-convex mixed integer quadratic programs, Algorithmic differentiation techniques for global optimization in the COCONUT environment, EAGO.jl: easy advanced global optimization in Julia, Algebraic Perspectives on Signomial Optimization, Disjunctive Cuts for Nonconvex MINLP, Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming, An Algorithmic Framework for MINLP with Separable Non-Convexity, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization, Multi-fidelity algorithms for the horizontal alignment problem in road design, Computable representations for convex hulls of low-dimensional quadratic forms, Solving generalized polynomial problem by using new affine relaxed technique, Valid Inequalities for Separable Concave Constraints with Indicator Variables, Large-scale standard pooling problems with constrained pools and fixed demands, A multi-commodity flow formulation for the generalized pooling problem, Bound reduction using pairs of linear inequalities, Strong formulations for the pooling problem, Mixed integer nonlinear programming tools: an updated practical overview, Design of a public bicycle-sharing system with safety, A global optimization framework for distributed antenna location in CDMA cellular networks, Optimization under Rare Chance Constraints, Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design, Piecewise polyhedral formulations for a multilinear term, Global optimization algorithm for solving linear multiplicative programming problems, Alternative branching rules for some nonconvex problems, Mathematical programming formulations for piecewise polynomial functions, A computational study on QP problems with general linear constraints, Modeling design and control problems involving neural network surrogates, A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization, Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods, An efficient algorithm and complexity result for solving the sum of general affine ratios problem, A Lagrangean relaxation approach to lifetime maximization of directional sensor networks, On the complexity of detecting convexity over a box, An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming, Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming, A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints, Interval division and linearization algorithm for minimax linear fractional program, Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound, Subdomain separability in global optimization, Effective algorithms for optimal portfolio deleveraging problem with cross impact, A supply chain network design for blood and its products using genetic algorithm: a case study of Turkey, Improved convex and concave relaxations of composite bilinear forms, A solution method for heterogeneity involving present bias, DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization, Relaxations of factorable functions with convex-transformable intermediates, Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques, Globally maximizing the sum of squares of quadratic forms over the unit sphere, Constraint partitioning in penalty formulations for solving temporal planning problems, Whitney differentiability of optimal-value functions for bound-constrained convex programming problems, Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, Global optimization in stabilizing controller design, Mathematically Rigorous Global Optimization and Fuzzy Optimization, Solving data envelopment analysis models with sum-of-fractional objectives: a global optimal approach based on the multiparametric disaggregation technique, Global optimization, A fully general, exact algorithm for nesting irregular shapes, On rigorous upper bounds to a global optimum, Multivariate McCormick relaxations, A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations, A note on convex reformulation schemes for mixed integer quadratic programs, A mixed-integer nonlinear program for the optimal design and dispatch of distributed generation systems, Unnamed Item, The travelling salesman problem with neighbourhoods: MINLP solution, A revised Taha's algorithm for polynomial 0-1 programming, Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs, Tuning BARON using derivative-free optimization algorithms, An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs, A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs, Solving convex MINLP optimization problems using a sequential cutting plane algorithm, A branch-and-cut algorithm for mixed-integer bilinear programming, Constraint aggregation for rigorous global optimization, Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment, Optimal influenza vaccine distribution with equity, The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming, Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition, Feasibility and cost minimisation for a lithium extraction problem, Multiperiod optimization model for oilfield production planning: bicriterion optimization and two-stage stochastic programming model, Challenges in Enterprise Wide Optimization for the Process Industries, Mixed integer nonlinear programming using interior-point methods, Mean–variance portfolio optimization with parameter sensitivity control†, Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities, A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere, Computation of parameter stability margins using polynomial programming techniques, Global optimization of semi-infinite programs via restriction of the right-hand side, Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties, Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints, A global optimization RLT-based approach for solving the hard clustering problem, Optimal-constrained multicast sub-graph over coded packet networks, Some observations on exclusion regions in branch and bound algorithms, Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints, Active allocation of systematic risk and control of risk sensitivity in portfolio optimization, Global optimization of nonconvex problems with multilinear intermediates
Uses Software
Cites Work
