Solving continuous and discrete nonlinear programs with BARON
From MaRDI portal
Cites work
- A branch-and-reduce approach to global optimization
- A combinatorial optimization approach to scenario filtering in portfolio selection
- A finite algorithm for global minimization of separable concave programs
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A hybrid LP/NLP paradigm for global optimization relaxations
- A Modeling Language for Mathematical Programming
- A polyhedral branch-and-cut approach to global optimization
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
- Advanced preprocessing techniques for linear and quadratic programming
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- BARON: A general purpose global optimization software package
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Branch-and-Model: a derivative-free global optimization algorithm
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Conflict graphs in solving integer programming problems
- Constraint propagation with interval labels
- Convex functions and their applications. A contemporary approach
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs
- Domain reduction techniques for global NLP and MINLP optimization
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Global optimization and constraint satisfaction: the branch-and-reduce approach
- Global optimization of general non-convex problems with intermediate bilinear substructures
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization of multiplicative programs
- Global optimization of nonconvex factorable programming problems
- Global solution approach for a nonconvex MINLP problem in product portfolio optimization
- GLOMIQO: global mixed-integer quadratic optimizer
- Heuristics for convex mixed integer nonlinear programs
- scientific article; zbMATH DE number 1795205 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Mathematical optimization in classification and regression trees
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Mixed integer programming: analyzing 12 years of progress
- Modeling languages in mathematical optimization.
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools
- Nonlinear optimization with engineering applications
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Optimization methods for large-scale machine learning
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Preprocessing for quadratic programming
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Presolve Reductions in Mixed Integer Programming
- Presolving in linear programming
- Principles of Optimal Design
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Pyomo -- optimization modeling in Python
- Relaxations of factorable functions with convex-transformable intermediates
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- The global solver in the LINDO API
- The supporting hyperplane optimization toolkit for convex MINLP
- Using dual presolving reductions to reformulate cumulative constraints
Cited in
(5)- Preface: global optimization algorithms and applications
- A relax-fix-and-exclude algorithm for an MINLP problem with multilinear interpolations
- Extreme strong branching for QCQPs
- A novel linear optimization presolve technique based on Fourier-Motzkin elimination
- A spatial global optimization algorithm for generalized fractional programming problems using second-order cone relaxation
This page was built for publication: Solving continuous and discrete nonlinear programs with BARON
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6878834)
