Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958)

scientific article; zbMATH DE number 6636254

Language	Label	Description	Also known as
default for all languages	No label defined
English	Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO	scientific article; zbMATH DE number 6636254

Statements

instance of

scholarly article

0 references

title

Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (English)

0 references

author

Fani Boukouvala

0 references

Ruth Misener

0 references

Christodoulos A. Floudas

0 references

published in

European Journal of Operational Research

0 references

publication date

7 October 2016

0 references

zbMATH Keywords

MINLP

0 references

deterministic global optimization

0 references

derivative-free

0 references

grey-/black-box

0 references

constraints

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Boost Interval Arithmetic

0 references

MCS

0 references

SCIP

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2015.12.018

0 references

cites work

Quantitative Object Reconstruction Using Abel Transform X-Ray Tomography and Mixed Variable Optimization

0 references

An efficient class of direct search surrogate methods for solving expensive optimization problems with CPU-time-related functions

0 references

Convergence of Mesh Adaptive Direct Search to Second‐Order Stationary Points

0 references

Mesh adaptive direct search algorithms for mixed variable optimization

0 references

Pattern search algorithms for mixed variable programming

0 references

OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions

0 references

SCIP: solving constraint integer programs

0 references

Constraint Integer Programming: A New Approach to Integrate CP and MIP

0 references

Branching rules revisited

0 references

A variance-based method to rank input variables of the mesh adaptive direct search algorithm

0 references

A trust-region framework for constrained optimization using reduced order modeling

0 references

Computational experience with a new class of convex underestimators: Box-constrained NLP problems

0 references

A new class of improved convex underestimators for twice continuously differentiable constrained NLPs

0 references

Jointly Constrained Biconvex Programming

0 references

A multi-commodity flow formulation for the generalized pooling problem

0 references

Copositivity and constrained fractional quadratic problems

0 references

\(\alpha BB\): A global optimization method for general constrained nonconvex problems

0 references

Global approaches for facility layout and VLSI floorplanning

0 references

Recent advances in the solution of quadratic assignment problems

0 references

Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming

0 references

Computable representations for convex hulls of low-dimensional quadratic forms

0 references

Inexact restoration method for nonlinear optimization without derivatives

0 references

Spent potliner treatment process optimization using a MADS algorithm

0 references

Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search

0 references

Pooling problem: alternate formulations and solution methods

0 references

Analysis of Generalized Pattern Searches

0 references

A Pattern Search Filter Method for Nonlinear Programming without Derivatives

0 references

Mesh Adaptive Direct Search Algorithms for Constrained Optimization

0 references

A progressive barrier for derivative-free nonlinear programming

0 references

Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm

0 references

Globalization strategies for mesh adaptive direct search

0 references

The small hexagon and heptagon with maximum sum of distances between vertices

0 references

A branch and cut algorithm for nonconvex quadratically constrained quadratic programming

0 references

The small octagon with longest perimeter

0 references

Simple polygons of maximum perimeter contained in a unit disk

0 references

The largest small octagon

0 references

Reducing the number of function evaluations in mesh adaptive direct search algorithms

0 references

Maximal perimeter, diameter and area of equilateral unit-width convex polygons

0 references

Extended formulations for convex envelopes

0 references

Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs

0 references

Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons

0 references

Using DIRECT to solve an aircraft routing problem

0 references

Global optimization approaches to an aircraft routing problem

0 references

Bound reduction using pairs of linear inequalities

0 references

Feasibility-based bounds tightening via fixed points

0 references

On the Composition of Convex Envelopes for Quadrilinear Terms

0 references

Mixed-integer nonlinear optimization

0 references

Branching and bounds tighteningtechniques for non-convex MINLP

0 references

Valid inequalities and convex hulls for multilinear functions

0 references

Global minimization by reducing the duality gap

0 references

On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals

0 references

RENS. The optimal rounding

0 references

Undercover: a primal MINLP heuristic exploring a largest sub-MIP

0 references

Experimental algorithms. 12th international symposium, SEA 2013, Rome, Italy, June 5--7, 2013. Proceedings

0 references

Analyzing the computational impact of MIQCP solver components

0 references

Extending a CIP framework to solve MIQCPs

0 references

Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets

0 references

Global optimization of costly nonconvex functions using radial basis functions

0 references

A New Approach to the Feasibility Pump in Mixed Integer Programming

0 references

Convergence rate of McCormick relaxations

0 references

Copositive optimization -- recent developments and applications

0 references

Q3145799

0 references

An algorithmic framework for convex mixed integer nonlinear programs

0 references

A New Method of Constrained Optimization and a Comparison With Other Methods

0 references

On the optimal design of water distribution networks: a practical MINLP approach

0 references

Constrained optimization involving expensive function evaluations: A sequential approach

0 references

The design of the Boost interval arithmetic library

0 references

The MILP road to MIQCP

0 references

A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations

0 references

MINLPLib -- a collection of test models for mixed-integer nonlinear programming

0 references

Aircraft deconfliction with speed regulation: new models from mixed-integer optimization

0 references

On convex relaxations of quadrilinear terms

0 references

Decomposition methods for solving nonconvex quadratic programs via branch and bound

0 references

Global optimization problems and domain reduction strategies

0 references

Global optimization in stabilizing controller design

0 references

Global convergence of trust-region algorithms for convex constrained minimization without derivatives

0 references

Use of quadratic models with mesh-adaptive direct search for constrained black box optimization

0 references

Global convergence of general derivative-free trust-region algorithms to first- and second-order critical points

0 references

Introduction to Derivative-Free Optimization

0 references

The GLOBAL optimization method revisited

0 references

GLODS: global and local optimization using direct search

0 references

Using simplex gradients of nonsmooth functions in direct search methods

0 references

Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality

0 references

On interval-subgradient and no-good cuts

0 references

A storm of feasibility pumps for nonconvex MINLP

0 references

Valid Inequalities for the Pooling Problem with Binary Variables

0 references

Mixed integer nonlinear programming tools: an updated practical overview

0 references

A kriging based method for the solution of mixed-integer nonlinear programs containing black-box functions

0 references

Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals

0 references

An approach to constrained global optimization based on exact penalty functions

0 references

On equivalence of semidefinite relaxations for quadratic matrix programming

0 references

G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems

0 references

Constraint propagation on quadratic constraints

0 references

Rigorous enclosures of ellipsoids and directed Cholesky factorizations

0 references

Combination of nonlinear and linear optimization of transient gas networks

0 references

The cluster problem in multivariate global optimization

0 references

An outer-approximation algorithm for a class of mixed-integer nonlinear programs

0 references

An evolutionary method for complex-process optimization

0 references

Scatter search for chemical and bio-process optimization

0 references

A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization

0 references

Q4331736

0 references

Deterministic global optimization. Theory, methods and applications

0 references

A Decomposition Strategy for Global Optimum Search in the Pooling Problem

0 references

A review of recent advances in global optimization

0 references

Frontiers in global optimization

0 references

Handbook of test problems in local and global optimization

0 references

Primal-relaxed dual global optimization approach

0 references

A locally-biased form of the DIRECT algorithm.

0 references

Adapting derivative free optimization methods to engineering models with discrete variables

0 references

On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization

0 references

A combined global \& local search (CGLS) approach to global optimization

0 references

Construction of convex relaxations using automated code generation techniques

0 references

Q4464665

0 references

A New Algorithm for MINLP Applied to Gas Transport Energy Cost Minimization

0 references

The travelling salesman problem with neighbourhoods: MINLP solution

0 references

Elements of Large-Scale Mathematical Programming Part I: Concepts

0 references

An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima

0 references

Towards globally optimal operation of water supply networks

0 references

Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming

0 references

Convexity of products of univariate functions and convexification transformations for geometric programming

0 references

Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions

0 references

Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions

0 references

Algorithm 852

0 references

An active-set trust-region method for derivative-free nonlinear bound-constrained optimization

0 references

A merit function approach for direct search

0 references

Optimizing an empirical scoring function for transmembrane protein structure determination

0 references

Asynchronous parallel hybrid optimization combining DIRECT and GSS

0 references

Solving mixed integer bilinear problems using MILP formulations

0 references

Computational Comparison of Convex Underestimators for Use in a Branch-and-Bound Global Optimization Framework

0 references

An Ellipsoidal Branch and Bound Algorithm for Global Optimization

0 references

A derivative-free approximate gradient sampling algorithm for finite minimax problems

0 references

Different transformations for solving non-convex trim-loss problems by MINLP

0 references

Q3095025

0 references

Nonlinear integer programming

0 references

GloptiPoly

0 references

GloptiPoly 3: moments, optimization and semidefinite programming

0 references

A literature review on circle and sphere packing problems: models and methodologies

0 references

An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints

0 references

An adaptive radial basis algorithm (ARBF) for expensive black-box mixed-integer constrained global optimization

0 references

`` Direct Search'' Solution of Numerical and Statistical Problems

0 references

Q4889854

0 references

Global optimization by multilevel coordinate search

0 references

The Convex Envelope of (<i>n</i>–1)-Convex Functions

0 references

A method for simulation based optimization using radial basis functions

0 references

A taxonomy of global optimization methods based on response surfaces

0 references

Lipschitzian optimization without the Lipschitz constant

0 references

Efficient global optimization of expensive black-box functions

0 references

Q4464670

0 references

Cutting circles and polygons from area-minimizing rectangles

0 references

Cutting ellipses from area-minimizing rectangles

0 references

Implicit filtering

0 references

Convex envelopes of products of convex and component-wise concave functions

0 references

Convex envelopes generated from finitely many compact convex sets

0 references

Constrained optimization in expensive simulation: novel approach

0 references

Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems

0 references

Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development

0 references

A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids

0 references

Mixed variable optimization of the number and composition of heat intercepts in a thermal insulation system

0 references

Q4435425

0 references

Stationarity Results for Generating Set Search for Linearly Constrained Optimization

0 references

Global optimization of bilinear programs with a multiparametric disaggregation technique

0 references

Computational optimization, methods and algorithms.

0 references

A black-box scatter search for optimization problems with integer variables

0 references

Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity

0 references

Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm

0 references

Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization

0 references

A rigorous global filtering algorithm for quadratic constraints

0 references

Implementing Generating Set Search Methods for Linearly Constrained Minimization

0 references

Pattern Search Algorithms for Bound Constrained Minimization

0 references

Pattern Search Methods for Linearly Constrained Minimization

0 references

Decomposition strategy for the stochastic pooling problem

0 references

Reformulations in mathematical programming: automatic symmetry detection and exploitation

0 references

The reformulation-optimization software engine

0 references

Reformulation in mathematical programming: An application to quantum chemistry

0 references

Global optimization. From theory to implementation.

0 references

A recipe for finding good solutions to MINLPs

0 references

Convex envelopes of monomials of odd degree

0 references

An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms

0 references

Global solution approach for a nonconvex MINLP problem in product portfolio optimization

0 references

The global solver in the LINDO API

0 references

A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs

0 references

A remark on the GOP algorithm for global optimization

0 references

A derivative-free algorithm for inequality constrained nonlinear programming via smoothing of an \(\ell_\infty\) penalty function

0 references

Derivative-free methods for bound constrained mixed-integer optimization

0 references

Derivative-free methods for mixed-integer constrained optimization problems

0 references

Sequential penalty derivative-free methods for nonlinear constrained optimization

0 references

Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program

0 references

A technique to derive the analytical form of convex envelopes for some bivariate functions

0 references

Alternative branching rules for some nonconvex problems

0 references

Global optimization. Theory, algorithms, and applications

0 references

On convex envelopes for bivariate functions over polytopes

0 references

A survey for the quadratic assignment problem

0 references

Q3682236

0 references

An Algorithm Model for Mixed Variable Programming

0 references

A derivative-free algorithm for bound constrained optimization

0 references

Some results on the strength of relaxations of multilinear functions

0 references

A reformulation framework for global optimization

0 references

Some transformation techniques with applications in global optimization

0 references

Convex underestimation strategies for signomial functions

0 references

Global optimization of mixed-integer signomial programming problems

0 references

Solving long-term financial planning problems via global optimization

0 references

Finding all solutions of nonlinearly constrained systems of equations

0 references

Constrained multifidelity optimization using model calibration

0 references

A computational framework for derivative-free optimization of cardiovascular geometries

0 references

Optimal aeroacoustic shape design using the surrogate management framework

0 references

Trailing-edge noise reduction using derivative-free optimization and large-eddy simulation

0 references

Constrained derivative-free optimization on thin domains

0 references

Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

0 references

Decomposition based and branch and bound global optimization approaches for the phase equilibrium problem

0 references

Q4464676

0 references

Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes

0 references

Convex envelopes for edge-concave functions

0 references

Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators

0 references

Advances for the pooling problem: modeling, global optimization, and computational studies (Survey)

0 references

Global optimization of mixed-integer models with quadratic and signomial functions: a review

0 references

Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations

0 references

GLOMIQO: global mixed-integer quadratic optimizer

0 references

ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations

0 references

A framework for globally optimizing mixed-integer signomial programs

0 references

Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2

0 references

McCormick-Based Relaxations of Algorithms

0 references

Benchmarking optimization software with performance profiles.

0 references

Influence of ensemble surrogate models and sampling strategy on the solution quality of algorithms for~computationally expensive black-box global optimization problems

0 references

SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems

0 references

Rounding-based heuristics for nonconvex MINLPS

0 references

A Simplex Method for Function Minimization

0 references

Derived eigenvalues of symmetric matrices, with applications to distance geometry

0 references

A trust-region-based derivative free algorithm for mixed integer programming

0 references

Relaxation and decomposition methods for mixed integer nonlinear programming.

0 references

Global optimization algorithms for linearly constrained indefinite quadratic problems

0 references

Global Optimization of the Scenario Generation and Portfolio Selection Problems

0 references

Semidefinite programming relaxations for semialgebraic problems

0 references

Validation of nominations in gas network optimization: models, methods, and solutions

0 references

Q4308910

0 references

Linear programming relaxations of quadratically constrained quadratic programs

0 references

A global optimization algorithm for linear fractional and bilinear programs

0 references

Column enumeration based decomposition techniques for a class of non-convex MINLP problems

0 references

Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions

0 references

Constrained global optimization of expensive black box functions using radial basis functions

0 references

Improved strategies for radial basis function methods for global optimization

0 references

Parallel radial basis function methods for the global optimization of expensive functions

0 references

A stochastic radial basis function method for the global optimization of expensive functions

0 references

A quasi-multistart framework for global optimization of expensive functions using response surface models

0 references

Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations

0 references

Lifting inequalities: a framework for generating strong cuts for nonlinear programs

0 references

A convex envelope formula for multilinear functions

0 references

Portfolio optimization for wealth-dependent risk preferences

0 references

Derivative-free optimization: a review of algorithms and comparison of software implementations

0 references

Global minimization of large-scale constrained concave quadratic problems by separable programming

0 references

Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks

0 references

Large-scale standard pooling problems with constrained pools and fixed demands

0 references

Global optimization of explicit strong-stability-preserving Runge-Kutta methods

0 references

A branch-and-reduce approach to global optimization

0 references

Analysis of bounds for multilinear functions

0 references

BARON: A general purpose global optimization software package

0 references

A method for stochastic constrained optimization using derivative-free surrogate pattern search and collocation

0 references

Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations

0 references

Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations

0 references

More test examples for nonlinear programming codes

0 references

Generalized McCormick relaxations

0 references

A clique algorithm for standard quadratic programming

0 references

A genetic algorithm for a global optimization problem arising in the detection of gravitational waves

0 references

Reduced RLT representations for nonconvex polynomial programming problems

0 references

Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets

0 references

A reformulation-linearization technique for solving discrete and continuous nonconvex problems

0 references

A new reformulation-linearization technique for bilinear programming problems

0 references

Enhancing RLT relaxations via a new class of semidefinite cuts

0 references

A reformulation-convexification approach for solving nonconvex quadratic programming problems

0 references

New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems

0 references

On jet-convex functions and their tensor products

0 references

New methods for calculating \(\alpha\)BB-type underestimators

0 references

A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms

0 references

Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation

0 references

Global Optimization in Geometry — Circle Packing into the Square

0 references

Algorithms for an integer multicommodity network flow problem with node reliability considerations

0 references

On a class of functions attaining their maximum at the vertices of a polyhedron

0 references

Q4464689

0 references

Existence and sum decomposition of vertex polyhedral convex envelopes

0 references

Product disaggregation in global optimization and relaxations of rational programs

0 references

Explicit convex and concave envelopes through polyhedral subdivisions

0 references

Semidefinite relaxations of fractional programs via novel convexification techniques

0 references

Convex extensions and envelopes of lower semi-continuous functions

0 references

Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications

0 references

Global optimization of mixed-integer nonlinear programs: a theoretical and computational study

0 references

A polyhedral branch-and-cut approach to global optimization

0 references

Multivariate McCormick relaxations

0 references

A branch-and-cut algorithm for nonconvex quadratic programs with box constraints

0 references

A polyhedral study of nonconvex quadratic programs with box constraints

0 references

A particle swarm pattern search method for bound constrained global optimization

0 references

PSwarm: a hybrid solver for linearly constrained global derivative-free optimization

0 references

Efficient global optimization algorithm assisted by multiple surrogate techniques

0 references

Implicitly and densely discrete black-box optimization problems

0 references

Analysis of direct searches for discontinuous functions

0 references

Global optimization of expensive-to-evaluate functions: An empirical comparison of two sampling criteria

0 references

An informational approach to the global optimization of expensive-to-evaluate functions

0 references

Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity

0 references

Global optimization of bounded factorable functions with discontinuities

0 references

The cluster problem revisited

0 references

Interval mathematics, algebraic equations and optimization

0 references

A surrogate-based optimization method with RBF neural network enhanced by linear interpolation and hybrid infill strategy

0 references

Stochastic adaptive search for global optimization.

0 references

Semidefinite programming relaxations for the quadratic assignment problem

0 references

Global optimization of general non-convex problems with intermediate bilinear substructures

0 references

Global optimization of general nonconvex problems with intermediate polynomial substructures

0 references

Identifiers

zbMATH Open document ID

1346.90677

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

10.1016/J.EJOR.2015.12.018

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:322958