BARON: A general purpose global optimization software package

DOI10.1007/BF00138693zbMATH Open0856.90104MaRDI QIDQ1924072FDOQ1924072

Authors: Nikolaos V. Sahinidis 

Publication date: 23 February 1997

Published in: Journal of Global Optimization (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1795205
• Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
• Tuning BARON using derivative-free optimization algorithms
• scientific article; zbMATH DE number 3952512
• scientific article; zbMATH DE number 1057693
• A Barrier Method for Large-Scale Constrained Optimization
• A Barzilai-Borwein descent method for multiobjective optimization problems
• Barzilai and Borwein's method for multiobjective optimization problems
• An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
• scientific article; zbMATH DE number 1857684

zbMATH Keywords

nonconvex optimizationpolynomial programmingbranch-and-boundglobal optimalitymultiplicative programmingfixed-charge problembranch-and-reduce optimization navigator

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Mixed integer programming (90C11)

Cites Work

• A branch-and-reduce approach to global optimization
• A finite algorithm for global minimization of separable concave programs
• Title not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Mixed integer nonlinear programming tools: a practical overview
• A computational study of primal heuristics inside an MI(NL)P solver
• Relaxations of factorable functions with convex-transformable intermediates
• RLT: A unified approach for discrete and continuous nonconvex optimization
• Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints
• Conic approximation to nonconvex quadratic programming with convex quadratic constraints
• Title not available (Why is that?)
• Box-constrained quadratic programs with fixed charge variables
• Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations
• A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
• Global optimization of nonconvex problems with multilinear intermediates
• Constraint partitioning in penalty formulations for solving temporal planning problems
• Reformulations for utilizing separability when solving convex MINLP problems
• Global optimization of nonconvex problems with convex-transformable intermediates
• On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
• Active allocation of systematic risk and control of risk sensitivity in portfolio optimization
• An inverse reliability-based approach for designing under uncertainty with application to robust piston design
• Optimal-constrained multicast sub-graph over coded packet networks
• Linear transformation based solution methods for non-convex mixed integer quadratic programs
• Quality assurance and global optimization
• Improved convex and concave relaxations of composite bilinear forms
• Multiperiod optimization model for oilfield production planning: bicriterion optimization and two-stage stochastic programming model
• Disjunctive Cuts for Nonconvex MINLP
• A MIQCP formulation for B-spline constraints
• EAGO.jl: easy advanced global optimization in Julia
• Mixed integer programming for a special logic constrained optimal control problem
• Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes
• A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs
• On solving quadratically constrained quadratic programming problem with one non-convex constraint
• A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
• Certificates of infeasibility via nonsmooth optimization
• Tuning BARON using derivative-free optimization algorithms
• Reverse bridge theorem under constraint partition
• Numerical certification of Pareto optimality for biobjective nonlinear problems
• Valid inequalities for separable concave constraints with indicator variables
• Valid inequalities for separable concave constraints with indicator variables
• The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm
• A fully general, exact algorithm for nesting irregular shapes
• Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
• Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
• Low dimensional simplex evolution: a new heuristic for global optimization
• Title not available (Why is that?)
• A global optimization RLT-based approach for solving the fuzzy clustering problem
• Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
• An algorithmic framework for MINLP with separable non-convexity
• A global optimization method, QBB, for twice-differentiable nonconvex optimization problem
• Global optimization in Hilbert space
• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
• Differentiable McCormick relaxations
• Global optimization in stabilizing controller design
• \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems
• Convergent upper bounds in global minimization with nonlinear equality constraints
• Interactions between nonlinear programming and modeling systems
• Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
• Alternative branching rules for some nonconvex problems
• GlobSol user guide
• Solving convex MINLP optimization problems using a sequential cutting plane algorithm
• A global optimization RLT-based approach for solving the hard clustering problem
• Energy-optimal multi-goal motion planning for planar robot manipulators
• Global optimization of semi-infinite programs via restriction of the right-hand side
• Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
• Transformation-based preprocessing for mixed-integer quadratic programs
• A planar single facility location and border crossing problem
• Global optimization of bilinear programs with a multiparametric disaggregation technique
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs
• Theoretical and computational results about optimality-based domain reductions
• A branch-and-cut algorithm for mixed-integer bilinear programming
• A new local and global optimization method for mixed integer quadratic programming problems
• Challenges in Enterprise Wide Optimization for the Process Industries
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• Global minimization using an augmented Lagrangian method with variable lower-level constraints
• Convex envelopes generated from finitely many compact convex sets
• The travelling salesman problem with neighbourhoods: MINLP solution
• The supporting hyperplane optimization toolkit for convex MINLP
• A dynamic convexized method for nonconvex mixed integer nonlinear programming
• Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
• A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
• Convex envelopes of products of convex and component-wise concave functions
• Column enumeration based decomposition techniques for a class of non-convex MINLP problems
• DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
• Constraint aggregation for rigorous global optimization
• Solving planning and design problems in the process industry using mixed integer and global optimization
• Multiobjective optimization for aircraft conflict resolution. A metaheuristic approach
• Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
• Computational Study of Local Search Methods for a D.C. Optimization Problem with Inequality Constraints
• A recipe for finding good solutions to MINLPs
• Parametric mixed-integer 0-1 linear programming: The general case for a single parameter
• BARON
• A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
• Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control
• Interval analysis on directed acyclic graphs for global optimization
• Separation and relaxation for cones of quadratic forms
• Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method
• Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
• Global optimization problems and domain reduction strategies
• Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques

Uses Software

• MINOS
• OSL

This page was built for publication: BARON: A general purpose global optimization software package

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924072)