ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
From MaRDI portal
Publication:2250093
DOI10.1007/s10898-014-0166-2zbMath1301.90063OpenAlexW2050339136WikidataQ62015635 ScholiaQ62015635MaRDI QIDQ2250093
Ruth Misener, Christodoulos A. Floudas
Publication date: 4 July 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0166-2
Related Items
Optimal multi-state partnerships for woody biomass co-firing incorporating a demand-response function for biomass procurement, ARGONAUT: algorithms for global optimization of constrained grey-box computational problems, Minotaur: a mixed-integer nonlinear optimization toolkit, Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems, A hybrid LP/NLP paradigm for global optimization relaxations, Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming, Linear and parabolic relaxations for quadratic constraints, Optimization and validation of pumping system design and operation for water supply in high-rise buildings, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects, Petroleum refinery optimization, Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems, 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, A global MINLP approach to symbolic regression, Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations, A bilevel optimization approach to decide the feasibility of bookings in the European gas market, On the product knapsack problem, On linear programming relaxations for solving polynomial programming problems, The supporting hyperplane optimization toolkit for convex MINLP, On decomposability of multilinear sets, On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study, Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness, Global optimization of MIQCPs with dynamic piecewise relaxations, An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems, Convergence-order analysis of branch-and-bound algorithms for constrained problems, Global optimization algorithm for capacitated multi-facility continuous location-allocation problems, A computational study of global optimization solvers on two trust region subproblems, The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming, How to solve a design centering problem, Guided dive for the spatial branch-and-bound, Solving binary-constrained mixed complementarity problems using continuous reformulations, SUSPECT: MINLP special structure detector for Pyomo, Deterministic global derivative-free optimization of black-box problems with bounded Hessian, Optimality-based domain reduction for inequality-constrained NLP and MINLP problems, Mathematical programming formulations for piecewise polynomial functions, Error bounds for monomial convexification in polynomial optimization, Virtuous smoothing for global optimization, SDP-based branch-and-bound for non-convex quadratic integer optimization, A generic interval branch and bound algorithm for parameter estimation, Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations, A framework for globally optimizing mixed-integer signomial programs, Explicit hybrid model-predictive control: the exact solution, On the impact of running intersection inequalities for globally solving polynomial optimization problems, A reformulation-linearization technique for optimization over simplices, Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization, Domain reduction techniques for global NLP and MINLP optimization, An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver, Global optimization in Hilbert space, A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement, Deterministic global optimization with artificial neural networks embedded, A new framework to relax composite functions in nonlinear programs, Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, Packing ellipsoids into volume-minimizing rectangular boxes, Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes, Differentiable McCormick relaxations, Three enhancements for optimization-based bound tightening, Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization, Multivariate McCormick relaxations, A note on solving DiDi's driver-order matching problem, On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation, Global optimization of nonconvex problems with convex-transformable intermediates, Decomposition-based inner- and outer-refinement algorithms for global optimization, A velocity-combined local best particle swarm optimization algorithm for nonlinear equations, Tighter McCormick relaxations through subgradient propagation, A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs, Experimental validation of volume-based comparison for double-McCormick relaxations, Convergent upper bounds in global minimization with nonlinear equality constraints, The exact solution of multiparametric quadratically constrained quadratic programming problems, \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems, On tightness and anchoring of McCormick and other relaxations, A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables, A scalable global optimization algorithm for stochastic nonlinear programs, \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers, QPLIB: a library of quadratic programming instances, A branch-and-cut algorithm for mixed-integer bilinear programming, Optimal influenza vaccine distribution with equity, Valid inequalities for separable concave constraints with indicator variables, Complementarity-based nonlinear programming techniques for optimal mixing in gas networks, Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation, Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks, On tackling reverse convex constraints for non-overlapping of unequal circles, Linearization of McCormick relaxations and hybridization with the auxiliary variable method, Branch-and-price for a class of nonconvex mixed-integer nonlinear programs, Deterministic global optimization with Gaussian processes embedded, Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization, Identification of mechanical properties of arteries with certification of global optimality, Global dynamic optimization with Hammerstein-Wiener models embedded, Working fluid selection for organic rankine cycles via deterministic global optimization of design and operation, A decomposition method for MINLPs with Lipschitz continuous nonlinearities, Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints, New SOCP relaxation and branching rule for bipartite bilinear programs, Global optimality bounds for the placement of control valves in water supply networks, Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations, Non-convex nested Benders decomposition, Hidden invariant convexity for global and conic-intersection optimality guarantees in discrete-time optimal control, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization, On generalized surrogate duality in mixed-integer nonlinear programming, 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, EAGO.jl: easy advanced global optimization in Julia, Algebraic Perspectives on Signomial Optimization, Valid Inequalities for Separable Concave Constraints with Indicator Variables, Tractable Relaxations of Composite Functions, Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern, Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization, Comparison of MINLP formulations for global superstructure optimization, General convex relaxations of implicit functions and inverse functions, Time-domain decomposition for mixed-integer optimal control problems, Improved convex and concave relaxations of composite bilinear forms, Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization, More Virtuous Smoothing, Whitney differentiability of optimal-value functions for bound-constrained convex programming problems, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment, The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming, Node selection strategies in interval branch and bound algorithms, Lower level duality and the global solution of generalized semi-infinite programs, On the Derivation of Continuous Piecewise Linear Approximating Functions, Conflict Analysis for MINLP
Uses Software
Cites Work
- A Modeling Language for Mathematical Programming
- A reformulation framework for global optimization
- GLOMIQO: global mixed-integer quadratic optimizer
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- A framework for globally optimizing mixed-integer signomial programs
- On the optimal design of water distribution networks: a practical MINLP approach
- Reduced RLT representations for nonconvex polynomial programming problems
- Convex envelopes of products of convex and component-wise concave functions
- Constraint propagation on quadratic constraints
- SCIP: solving constraint integer programs
- The design of the Boost interval arithmetic library
- A review of recent advances in global optimization
- A survey for the quadratic assignment problem
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Existence and sum decomposition of vertex polyhedral convex envelopes
- An algorithmic framework for convex mixed integer nonlinear programs
- A clique algorithm for standard quadratic programming
- Convexity of products of univariate functions and convexification transformations for geometric programming
- Some transformation techniques with applications in global optimization
- Cutting circles and polygons from area-minimizing rectangles
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- On a class of functions attaining their maximum at the vertices of a polyhedron
- A new reformulation-linearization technique for bilinear programming problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Handbook of test problems in local and global optimization
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Recent advances in the solution of quadratic assignment problems
- Convex envelopes of monomials of odd degree
- A polyhedral study of nonconvex quadratic programs with box constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A rigorous global filtering algorithm for quadratic constraints
- Convex envelopes for edge-concave functions
- A polyhedral branch-and-cut approach to global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Construction of convex relaxations using automated code generation techniques
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Branching rules revisited
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- A global optimization algorithm for linear fractional and bilinear programs
- Finding all solutions of nonlinearly constrained systems of equations
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A branch-and-reduce approach to global optimization
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- On convex relaxations for quadratically constrained quadratic programming
- Decomposition strategy for the stochastic pooling problem
- Analyzing the computational impact of MIQCP solver components
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- On convex relaxations of quadrilinear terms
- Deterministic global optimization. Theory, methods and applications
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Algorithms for an integer multicommodity network flow problem with node reliability considerations
- Cutting ellipses from area-minimizing rectangles
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Mixed integer nonlinear programming tools: an updated practical overview
- On convex envelopes for bivariate functions over polytopes
- Global optimization in stabilizing controller design
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Global Optimization of Mixed-Integer Signomial Programming Problems
- Extending a CIP Framework to Solve MIQCPs
- Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment
- On jet-convex functions and their tensor products
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Rigorous Enclosures of Ellipsoids and Directed Cholesky Factorizations
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Convex underestimation strategies for signomial functions
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- McCormick-Based Relaxations of Algorithms
- Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests
- Jointly Constrained Biconvex Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Mixed-integer nonlinear optimization
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Benchmarking optimization software with performance profiles.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
