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