ANTIGONE

swMATH9241MaRDI QIDQ21228FDOQ21228

Author name not available (Why is that?)

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

• \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems
• Convergent upper bounds in global minimization with nonlinear equality constraints
• Convergence-order analysis of branch-and-bound algorithms for constrained problems
• SUSPECT: MINLP special structure detector for Pyomo
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
• QPLIB: a library of quadratic programming instances
• ARGONAUT: algorithms for global optimization of constrained grey-box computational problems
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
• Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
• Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming
• \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
• A branch-and-cut algorithm for mixed-integer bilinear programming
• Node selection strategies in interval branch and bound algorithms
• The exact solution of multiparametric quadratically constrained quadratic programming problems
• A global MINLP approach to symbolic regression
• Linear and parabolic relaxations for quadratic constraints
• Petroleum refinery optimization
• Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints
• Improved convex and concave relaxations of composite bilinear forms
• The supporting hyperplane optimization toolkit for convex MINLP
• 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
• Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
• On the Derivation of Continuous Piecewise Linear Approximating Functions
• Weighted quadrature rules via Grüss type inequalities for weighted \(L^{p}\) spaces
• EAGO.jl: easy advanced global optimization in Julia
• Packing ellipsoids into volume-minimizing rectangular boxes
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• Computing tight bounds via piecewise linear functions through the example of circle cutting problems
• On decomposability of multilinear sets
• Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes
• A framework for globally optimizing mixed-integer signomial programs
• Experimental validation of volume-based comparison for double-McCormick relaxations
• 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
• Guided dive for the spatial branch-and-bound
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Exact and fast algorithms for mixed-integer nonlinear programming
• A hybrid LP/NLP paradigm for global optimization relaxations
• Minotaur: a mixed-integer nonlinear optimization toolkit
• Working fluid selection for organic rankine cycles via deterministic global optimization of design and operation
• Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
• Virtuous smoothing for global optimization
• The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
• On linear programming relaxations for solving polynomial programming problems
• Error bounds for monomial convexification in polynomial optimization
• Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
• Optimal multi-state partnerships for woody biomass co-firing incorporating a demand-response function for biomass procurement
• The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
• 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
• Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
• Deterministic global optimization with artificial neural networks embedded
• Explicit hybrid model-predictive control: the exact solution
• Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
• Decomposition-based inner- and outer-refinement algorithms for global optimization
• On the product knapsack problem
• Global optimization algorithm for capacitated multi-facility continuous location-allocation problems
• Multivariate McCormick relaxations
• Time-domain decomposition for mixed-integer optimal control problems
• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
• Differentiable McCormick relaxations
• Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
• Three enhancements for optimization-based bound tightening
• Tractable Relaxations of Composite Functions
• Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
• Non-convex nested Benders decomposition
• A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement
• Linearization of McCormick relaxations and hybridization with the auxiliary variable method
• A note on solving DiDi's driver-order matching problem
• More Virtuous Smoothing
• Tighter McCormick relaxations through subgradient propagation
• Hidden invariant convexity for global and conic-intersection optimality guarantees in discrete-time optimal control
• On generalized surrogate duality in mixed-integer nonlinear programming
• A velocity-combined local best particle swarm optimization algorithm for nonlinear equations
• A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
• Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
• Conflict Analysis for MINLP
• Whitney differentiability of optimal-value functions for bound-constrained convex programming problems
• On tightness and anchoring of McCormick and other relaxations
• Global optimization of nonconvex problems with convex-transformable intermediates
• On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
• Deterministic global optimization with Gaussian processes embedded
• COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS
• Nonconvex equilibrium models for energy markets: exploiting price information to determine the existence of an equilibrium
• Optimization and validation of pumping system design and operation for water supply in high-rise buildings
• A decomposition method for MINLPs with Lipschitz continuous nonlinearities
• Algebraic Perspectives on Signomial Optimization
• Global optimality bounds for the placement of control valves in water supply networks
• Optimal influenza vaccine distribution with equity
• Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
• Solving binary-constrained mixed complementarity problems using continuous reformulations
• On tackling reverse convex constraints for non-overlapping of unequal circles
• Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks
• Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
• A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
• New SOCP relaxation and branching rule for bipartite bilinear programs
• On the impact of running intersection inequalities for globally solving polynomial optimization problems

This page was built for software: ANTIGONE