Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
From MaRDI portal
Publication:322958
DOI10.1016/j.ejor.2015.12.018zbMath1346.90677OpenAlexW2219010958WikidataQ62015624 ScholiaQ62015624MaRDI QIDQ322958
Ruth Misener, Fani Boukouvala, Christodoulos A. Floudas
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.12.018
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
ARGONAUT: algorithms for global optimization of constrained grey-box computational problems, Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, A disjunctive cut strengthening technique for convex MINLP, Pyomo.GDP: an ecosystem for logic based modeling and optimization development, Derivative-free methods for mixed-integer nonsmooth constrained optimization, A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm, Pseudo expected improvement criterion for parallel EGO algorithm, Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness, Optimization of black-box problems using Smolyak grids and polynomial approximations, Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded, SUSPECT: MINLP special structure detector for Pyomo, Deterministic global derivative-free optimization of black-box problems with bounded Hessian, On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition, Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization, Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs, Mitigating anomalies in parallel branch-and-bound based algorithms for mixed-integer nonlinear optimization, Piecewise linear bounding of univariate nonlinear functions and resulting mixed integer linear programming-based solution methods, A multilevel analysis of the Lasserre hierarchy, A risk-averse stochastic program for integrated system design and preventive maintenance planning, Black-Box Optimization: Methods and Applications, Global solution of non-convex quadratically constrained quadratic programs, Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm, Outer approximation for integer nonlinear programs via decision diagrams, An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs, Bunkering policies for a fuel bunker management problem for liner shipping networks, Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns, Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks, Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems, Quantile-based optimal portfolio selection, Branch-and-price for a class of nonconvex mixed-integer nonlinear programs, Deterministic global optimization with Gaussian processes embedded, Matroid optimization problems with monotone monomials in the objective, Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization, Alternative regularizations for outer-approximation algorithms for convex MINLP, A robust approach to warped Gaussian process-constrained optimization, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
Uses Software
Cites Work
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- A reformulation framework for global optimization
- GLOMIQO: global mixed-integer quadratic optimizer
- An efficient class of direct search surrogate methods for solving expensive optimization problems with CPU-time-related functions
- Constrained multifidelity optimization using model calibration
- A recipe for finding good solutions to MINLPs
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
- 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
- Adapting derivative free optimization methods to engineering models with discrete variables
- A trust-region framework for constrained optimization using reduced order modeling
- Copositivity and constrained fractional quadratic problems
- Copositive optimization -- recent developments and applications
- Reduced RLT representations for nonconvex polynomial programming problems
- Convex envelopes of products of convex and component-wise concave functions
- Analysis of direct searches for discontinuous functions
- A variance-based method to rank input variables of the mesh adaptive direct search algorithm
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Influence of ensemble surrogate models and sampling strategy on the solution quality of algorithms for~computationally expensive black-box global optimization problems
- Extended formulations for convex envelopes
- Inexact restoration method for nonlinear optimization without derivatives
- SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems
- Computational optimization, methods and algorithms.
- Constrained global optimization of expensive black box functions using radial basis functions
- Enhancing RLT relaxations via a new class of semidefinite cuts
- A literature review on circle and sphere packing problems: models and methodologies
- Constraint propagation on quadratic constraints
- On interval-subgradient and no-good cuts
- Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions
- A method for simulation based optimization using radial basis functions
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
- The small hexagon and heptagon with maximum sum of distances between vertices
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Convergence rate of McCormick relaxations
- Generalized McCormick relaxations
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- An approach to constrained global optimization based on exact penalty functions
- A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- An evolutionary method for complex-process optimization
- SCIP: solving constraint integer programs
- New methods for calculating \(\alpha\)BB-type underestimators
- The cluster problem revisited
- A black-box scatter search for optimization problems with integer variables
- RENS. The optimal rounding
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- The design of the Boost interval arithmetic library
- Global optimization. From theory to implementation.
- Spent potliner treatment process optimization using a MADS algorithm
- An informational approach to the global optimization of expensive-to-evaluate functions
- Implicitly and densely discrete black-box optimization problems
- A review of recent advances in global optimization
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- A survey for the quadratic assignment problem
- The small octagon with longest perimeter
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Improved strategies for radial basis function methods for global optimization
- Scatter search for chemical and bio-process optimization
- Parallel radial basis function methods for the global optimization of expensive functions
- Global convergence of trust-region algorithms for convex constrained minimization without derivatives
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- Existence and sum decomposition of vertex polyhedral convex envelopes
- The GLOBAL optimization method revisited
- An algorithmic framework for convex mixed integer nonlinear programs
- A clique algorithm for standard quadratic programming
- A method for stochastic constrained optimization using derivative-free surrogate pattern search and collocation
- Globalization strategies for mesh adaptive direct search
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
- A computational framework for derivative-free optimization of cardiovascular geometries
- Mesh adaptive direct search algorithms for mixed variable optimization
- Convexity of products of univariate functions and convexification transformations for geometric programming
- Simple polygons of maximum perimeter contained in a unit disk
- An adaptive radial basis algorithm (ARBF) for expensive black-box mixed-integer constrained global optimization
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- Reformulation in mathematical programming: An application to quantum chemistry
- A kriging based method for the solution of mixed-integer nonlinear programs containing black-box functions
- Some transformation techniques with applications in global optimization
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- Cutting circles and polygons from area-minimizing rectangles
- Global optimization of expensive-to-evaluate functions: An empirical comparison of two sampling criteria
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Constrained optimization in expensive simulation: novel approach
- More test examples for nonlinear programming codes
- 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
- Efficient global optimization of expensive black-box functions
- Different transformations for solving non-convex trim-loss problems by MINLP
- Handbook of test problems in local and global optimization
- Global optimization by multilevel coordinate search
- A remark on the GOP algorithm for global optimization
- Primal-relaxed dual global optimization approach
- Lipschitzian optimization without the Lipschitz constant
- Global minimization by reducing the duality gap
- The cluster problem in multivariate global optimization
- A Stochastic Radial Basis Function Method for the Global Optimization of Expensive Functions
- Global Optimization of Mixed-Integer Signomial Programming Problems
- The MILP Road to MIQCP
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
- Extending a CIP Framework to Solve MIQCPs
- Combination of Nonlinear and Linear Optimization of Transient Gas Networks
- On jet-convex functions and their tensor products
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
- Validation of nominations in gas network optimization: models, methods, and solutions
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Alternative branching rules for some nonconvex problems
- Computational Comparison of Convex Underestimators for Use in a Branch-and-Bound Global Optimization Framework
- Algorithm 909
- Rigorous Enclosures of Ellipsoids and Directed Cholesky Factorizations
- Valid Inequalities for the Pooling Problem with Binary Variables
- Feasibility-Based Bounds Tightening via Fixed Points
- Sequential Penalty Derivative-Free Methods for Nonlinear Constrained Optimization
- An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
- Pooling Problem: Alternate Formulations and Solution Methods
- Asynchronous parallel hybrid optimization combining DIRECT and GSS
- On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming
- Implicit Filtering
- Quantitative Object Reconstruction Using Abel Transform X-Ray Tomography and Mixed Variable Optimization
- Reducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
- Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
- The Convex Envelope of (n–1)-Convex Functions
- 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
- PSwarm: a hybrid solver for linearly constrained global derivative-free optimization
- G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
- GloptiPoly 3: moments, optimization and semidefinite programming
- Trailing-edge noise reduction using derivative-free optimization and large-eddy simulation
- Convergence of Mesh Adaptive Direct Search to Second‐Order Stationary Points
- Using simplex gradients of nonsmooth functions in direct search methods
- Implementing Generating Set Search Methods for Linearly Constrained Minimization
- Algorithm 852
- McCormick-Based Relaxations of Algorithms
- An Ellipsoidal Branch and Bound Algorithm for Global Optimization
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Nonlinear Integer Programming
- Global Optimization of the Scenario Generation and Portfolio Selection Problems
- Introduction to Derivative-Free Optimization
- Jointly Constrained Biconvex Programming
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- `` Direct Search Solution of Numerical and Statistical Problems
- A Decomposition Strategy for Global Optimum Search in the Pooling Problem
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Analysis of Generalized Pattern Searches
- Pattern Search Methods for Linearly Constrained Minimization
- A Pattern Search Filter Method for Nonlinear Programming without Derivatives
- Pattern Search Algorithms for Bound Constrained Minimization
- An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima
- A New Approach to the Feasibility Pump in Mixed Integer Programming
- Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming
- Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
- The travelling salesman problem with neighbourhoods: MINLP solution
- Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals
- A Derivative-Free Algorithm for Inequality Constrained Nonlinear Programming via Smoothing of an $\ell_\infty$ Penalty Function
- Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points
- A Progressive Barrier for Derivative-Free Nonlinear Programming
- On the Composition of Convex Envelopes for Quadrilinear Terms
- A Merit Function Approach for Direct Search
- A New Algorithm for MINLP Applied to Gas Transport Energy Cost Minimization
- An Algorithm Model for Mixed Variable Programming
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Mixed-integer nonlinear optimization
- Global Optimization in Geometry — Circle Packing into the Square
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization
- GloptiPoly
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- A New Method of Constrained Optimization and a Comparison With Other Methods
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- A Simplex Method for Function Minimization
- Global optimization of explicit strong-stability-preserving Runge-Kutta methods
- Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
- A surrogate-based optimization method with RBF neural network enhanced by linear interpolation and hybrid infill strategy
- Global optimization of general non-convex problems with intermediate bilinear substructures
- The Reformulation-Optimization Software Engine
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Analysis of bounds for multilinear functions
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Benchmarking optimization software with performance profiles.
- Mixed variable optimization of the number and composition of heat intercepts in a thermal insulation system
- A locally-biased form of the DIRECT algorithm.
- A derivative-free algorithm for bound constrained optimization
- Using DIRECT to solve an aircraft routing problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposition based and branch and bound global optimization approaches for the phase equilibrium problem
- A convex envelope formula for multilinear functions
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Semidefinite programming relaxations for the quadratic assignment problem
- Solving long-term financial planning problems via global optimization
- Convex extensions and envelopes of lower semi-continuous functions
- Recent advances in the solution of quadratic assignment problems
- Convex envelopes of monomials of odd degree
- Stochastic adaptive search for global optimization.
- Frontiers in global optimization
- Semidefinite programming relaxations for semialgebraic problems
- On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- Interval mathematics, algebraic equations and optimization
- The largest small octagon
- Rounding-based heuristics for nonconvex MINLPS
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- 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
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A taxonomy of global optimization methods based on response surfaces
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of costly nonconvex functions using radial basis functions
- Product disaggregation in global optimization and relaxations of rational programs
- Construction of convex relaxations using automated code generation techniques
- Global optimization approaches to an aircraft routing problem
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Branching rules revisited
- Constrained optimization involving expensive function evaluations: A sequential approach
- 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
- BARON: A general purpose global optimization software package
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Some results on the strength of relaxations of multilinear functions
- A storm of feasibility pumps for nonconvex MINLP
- Decomposition strategy for the stochastic pooling problem
- Derivative-free methods for bound constrained mixed-integer optimization
- Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization
- A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms
- Towards globally optimal operation of water supply networks
- 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
- Experimental algorithms. 12th international symposium, SEA 2013, Rome, Italy, June 5--7, 2013. Proceedings
- Portfolio optimization for wealth-dependent risk preferences
- On convex relaxations of quadrilinear terms
- A genetic algorithm for a global optimization problem arising in the detection of gravitational waves
- Global optimization problems and domain reduction strategies
- 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
- A technique to derive the analytical form of convex envelopes for some bivariate functions
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Multivariate McCormick relaxations
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- Aircraft deconfliction with speed regulation: new models from mixed-integer optimization
- Derivative-free methods for mixed-integer constrained optimization problems
- GLODS: global and local optimization using direct search
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Large-scale standard pooling problems with constrained pools and fixed demands
- A multi-commodity flow formulation for the generalized pooling problem
- Constrained derivative-free optimization on thin domains
- Bound reduction using pairs of linear inequalities
- Maximal perimeter, diameter and area of equilateral unit-width convex polygons
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Efficient global optimization algorithm assisted by multiple surrogate techniques
- A quasi-multistart framework for global optimization of expensive functions using response surface models
- Mixed integer nonlinear programming tools: an updated practical overview
- Global optimization of bounded factorable functions with discontinuities
- Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program
- On convex envelopes for bivariate functions over polytopes
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- A particle swarm pattern search method for bound constrained global optimization
- Global optimization in stabilizing controller design
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Global solution approach for a nonconvex MINLP problem in product portfolio optimization
- A combined global \& local search (CGLS) approach to global optimization
- A trust-region-based derivative free algorithm for mixed integer programming
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Optimal aeroacoustic shape design using the surrogate management framework
- Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
- Computable representations for convex hulls of low-dimensional quadratic forms
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Pattern Search Algorithms for Mixed Variable Programming
- Global Approaches for Facility Layout and VLSI Floorplanning
- Solving Mixed Integer Bilinear Problems Using MILP Formulations
- On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Optimizing an Empirical Scoring Function for Transmembrane Protein Structure Determination
