Cited in
(only showing first 100 items - show all)- Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints
- Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
- \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems
- Convergent upper bounds in global minimization with nonlinear equality constraints
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- A hybrid LP/NLP paradigm for global optimization relaxations
- Experimental validation of volume-based comparison for double-McCormick relaxations
- Multivariate McCormick relaxations
- Sageopt
- Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
- On decomposability of multilinear sets
- Improved convex and concave relaxations of composite bilinear forms
- The exact solution of multiparametric quadratically constrained quadratic programming problems
- Packing ellipsoids into volume-minimizing rectangular boxes
- Error bounds for monomial convexification in polynomial optimization
- On linear programming relaxations for solving polynomial programming problems
- Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming
- Working fluid selection for organic rankine cycles via deterministic global optimization of design and operation
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- Deterministic global optimization with artificial neural networks embedded
- Node selection strategies in interval branch and bound algorithms
- Convergence-order analysis of branch-and-bound algorithms for constrained problems
- Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes
- USAC
- On the Derivation of Continuous Piecewise Linear Approximating Functions
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- A framework for globally optimizing mixed-integer signomial programs
- A global MINLP approach to symbolic regression
- The supporting hyperplane optimization toolkit for convex MINLP
- Explicit hybrid model-predictive control: the exact solution
- BBCPOP
- Decogo
- Muriqui
- SUSPECT
- POLIP
- StdPooling-PolyAlgos
- Linear and parabolic relaxations for quadratic constraints
- pyDOE
- DFVLR-SQP
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
- FrankWolfe.jl
- GAMS.jl
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- A branch-and-cut algorithm for mixed-integer bilinear programming
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- Weighted quadrature rules via Grüss type inequalities for weighted \(L^{p}\) spaces
- On the product knapsack problem
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- Delaunay.jl
- NCNBD.jl
- EAGO.jl
- PaPILO
- Global optimization algorithm for capacitated multi-facility continuous location-allocation problems
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Optimal multi-state partnerships for woody biomass co-firing incorporating a demand-response function for biomass procurement
- Differentiable McCormick relaxations
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
- Three enhancements for optimization-based bound tightening
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- A computational study of global optimization solvers on two trust region subproblems
- An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems
- Global optimization of MIQCPs with dynamic piecewise relaxations
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
- Petroleum refinery optimization
- EAGO.jl: easy advanced global optimization in Julia
- Alpine
- Exact and fast algorithms for mixed-integer nonlinear programming
- SUSPECT: MINLP special structure detector for Pyomo
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- BARON
- INTBIS
- SCIP
- LaGO
- McCormick
- CORO
- CONOPT
- MSNLP
- ICOS
- Couenne
- testenv
- LINDO
- GLOBALLib
- Bonmin
- COCONUT
- RROOT_748
- Ipopt
- MINLP
- FADBAD++
- AlphaECP
- QP
- DICOPT
- GAMS
- Pyomo
- DrAmpl
This page was built for software: ANTIGONE
