BARON: A general purpose global optimization software package
From MaRDI portal
Publication:1924072
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
nonconvex optimizationpolynomial programmingbranch-and-boundglobal optimalitymultiplicative programmingfixed-charge problembranch-and-reduce optimization navigator
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Mixed integer programming (90C11)
Cites Work
Cited In (only showing first 100 items - show all)
- 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
- A note on convex reformulation schemes for mixed integer quadratic programs
- A hybrid LP/NLP paradigm for global optimization relaxations
- A risk-averse stochastic program for integrated system design and preventive maintenance planning
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Global optimization and constraint satisfaction: the branch-and-reduce approach
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- Mixed integer nonlinear programming using interior-point methods
- Solving certain complementarity problems in power markets via convex programming
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A local exploration-based differential evolution algorithm for constrained global optimization
- On convex relaxations for quadratically constrained quadratic programming
- Rounding-based heuristics for nonconvex MINLPS
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Obtaining tighter relaxations of mathematical programs with complementarity constraints
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
- A multi-commodity flow formulation for the generalized pooling problem
- Strong formulations for the pooling problem
- Some results on the strength of relaxations of multilinear functions
- Bilinear modeling solution approach for fixed charge network flow problems
- On rigorous upper bounds to a global optimum
- A mixed-integer nonlinear program for the optimal design and dispatch of distributed generation systems
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
- Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- Multivariate McCormick relaxations
- Solving chance-constrained optimization problems with stochastic quadratic inequalities
- Using interior-point methods within an outer approximation framework for mixed integer nonlinear programming
- Algorithmic differentiation techniques for global optimization in the COCONUT environment
- Computable representations for convex hulls of low-dimensional quadratic forms
- Bound reduction using pairs of linear inequalities
- Large-scale standard pooling problems with constrained pools and fixed demands
- Mixed integer nonlinear programming tools: an updated practical overview
- 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
Uses Software
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)
