Domain reduction techniques for global NLP and MINLP optimization
From MaRDI portal
Publication:1699520
Abstract: Optimization solvers routinely utilize presolve techniques, including model simplification, reformulation and domain reduction techniques. Domain reduction techniques are especially important in speeding up convergence to the global optimum for challenging nonconvex nonlinear programming (NLP) and mixed-integer nonlinear programming (MINLP) optimization problems. In this work, we survey the various techniques used for domain reduction of NLP and MINLP optimization problems. We also present a computational analysis of the impact of these techniques on the performance of various widely available global solvers on a collection of 1740 test problems.
Recommendations
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Reduction constraints for the global optimization of NLPs
- On the Performance of NLP Solvers Within Global MINLP Solvers
- scientific article; zbMATH DE number 1054663
- scientific article; zbMATH DE number 1078157
- Global optimization problems and domain reduction strategies
- scientific article; zbMATH DE number 1054662
- Improve-and-branch algorithm for the global optimization of nonconvex NLP problems
- Theoretical and computational results about optimality-based domain reductions
- A new global optimization method for univariate constrained twice-differentiable NLP problems
Cites work
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 480288 (Why is no real title available?)
- scientific article; zbMATH DE number 679862 (Why is no real title available?)
- scientific article; zbMATH DE number 1054673 (Why is no real title available?)
- scientific article; zbMATH DE number 2080318 (Why is no real title available?)
- scientific article; zbMATH DE number 221928 (Why is no real title available?)
- scientific article; zbMATH DE number 2084777 (Why is no real title available?)
- scientific article; zbMATH DE number 804857 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 1440918 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A branch-and-reduce approach to global optimization
- A convex envelope formula for multilinear functions
- A finite algorithm for global minimization of separable concave programs
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A new approach to computing optimal schedules for the job-shop scheduling problem
- A new dominance procedure for combinatorial optimization problems
- A polyhedral branch-and-cut approach to global optimization
- A polyhedral study of nonconvex quadratic programs with box constraints
- A probing algorithm for MINLP with failure prediction by SVM
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A rigorous global filtering algorithm for quadratic constraints
- A server for automated performance analysis of benchmarking data
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
- Advanced preprocessing techniques for linear and quadratic programming
- An Algorithm for Separable Nonconvex Programming Problems
- An Analysis of Slow Convergence in Interval Propagation
- An Automatic Method of Solving Discrete Programming Problems
- An LPCC approach to nonconvex quadratic programs
- An analytical approach to global optimization
- An improved branch and bound algorithm for minimum concave cost network flow problems
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Applying interval arithmetic to real, integer, and boolean constraints
- Arc-consistency for continuous variables
- BDD-guided clause generation
- Bound constrained interval global optimization in the COCONUT environment
- Bound reduction using pairs of linear inequalities
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Branching and bounds tighteningtechniques for non-convex MINLP
- Calculation of bounds on variables satisfying nonlinear inequality constraints
- Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
- Coefficient strengthening: a tool for reformulating mixed-integer programs
- Complete search in continuous global optimization and constraint satisfaction
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computing the range of values of real functions with accuracy higher than second order
- Conflict analysis in mixed integer programming
- Conflict graphs in solving integer programming problems
- Constraint aggregation for rigorous global optimization
- Constraint propagation with interval labels
- Constraint propagation, relational arithmetic in AI systems and mathematical programs
- Convex envelopes for edge-concave functions
- Convex envelopes generated from finitely many compact convex sets
- Convex envelopes of products of convex and component-wise concave functions
- Convex extensions and envelopes of lower semi-continuous functions
- Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems
- Deletion presolve for accelerating infeasibility diagnosis in optimization models
- Deterministic global optimization using interval constraint propagation techniques
- Different transformations for solving non-convex trim-loss problems by MINLP
- Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron
- Domain filtering consistencies for non-binary constraints
- Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
- Enhancing numerical constraint propagation using multiple inclusion representations
- Epsilon-inflation in verification algorithms
- Exclusion Regions for Systems of Equations
- Exclusion regions for optimization problems
- Explicit convex and concave envelopes through polyhedral subdivisions
- Exploiting orbits in symmetric ILP
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Feasibility-based bounds tightening via fixed points
- Finding duplicate rows in a linear programming model
- Formal optimization of some reduced linear programming problems
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- GRASP: a search algorithm for propositional satisfiability
- GlobSol user guide
- Global optimization and constraint satisfaction: the branch-and-reduce approach
- Global optimization of general non-convex problems with intermediate bilinear substructures
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization of nonconvex problems with multilinear intermediates
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints
- Global optimization problems and domain reduction strategies
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Heuristics for dynamically adapting propagation in constraint satisfaction problems
- ICOS: a branch and bound based solver for rigorous global optimization
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Integrated methods for optimization.
- Interval Methods for Systems of Equations
- Interval analysis on directed acyclic graphs for global optimization
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Interval propagation and search on directed acyclic graphs for numerical constraint solving
- Introduction to Interval Analysis
- Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming
- Linear relaxations and reduced-Cost based propagation of continuous variable subscripts
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- MINTO, a Mixed INTeger Optimizer
- Mathematical programming techniques in water network optimization
- Mixed integer models for the stationary case of gas network optimization
- Mixed integer programming: analyzing 12 years of progress
- Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- Orbital branching
- Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Preprocessing complementarity problems
- Preprocessing for quadratic programming
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Presolve Reductions in Mixed Integer Programming
- Presolving in linear programming
- Principles and Practice of Constraint Programming – CP 2004
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Progress in presolving for mixed integer programming
- Pruning by isomorphism in branch-and-cut
- Pruning moves
- Recording and minimizing nogoods from restarts
- Redundancy elimination with a lexicographic solved form
- Relaxations of factorable functions with convex-transformable intermediates
- Relaxing the optimality conditions of box QP
- Rigorous global search: continuous problems
- SCIP: solving constraint integer programs
- Safe and tight linear estimators for global optimization
- Safe bounds in linear and mixed-integer linear programming
- Seizure warning algorithm based on optimization and nonlinear dynamics
- Simple bounds for solutions of monotone complementarity problems and convex programs
- Solving Large-Scale Zero-One Linear Programming Problems
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Stronger Inference through Implied Literals from Conflicts and Knapsack Covers
- The AMPL modeling language: an aid to formulating and solving optimization problems
- The Power of Dominance Relations in Branch-and-Bound Algorithms
- The cluster problem in multivariate global optimization
- The cluster problem revisited
- The complexity of integer bound propagation
- The essence of constraint propagation
- The global solver in the LINDO API
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods
- Theoretical and computational results about optimality-based domain reductions
- Three enhancements for optimization-based bound tightening
- Transposition Theorems and Qualification‐Free Optimality Conditions
- Using dual presolving reductions to reformulate cumulative constraints
Cited in
(21)- Optimal control of water distribution networks without storage
- Tighter McCormick relaxations through subgradient propagation
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending
- Bi-objective design-for-control of water distribution networks with global bounds
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- Optimization and validation of pumping system design and operation for water supply in high-rise buildings
- Improved convex and concave relaxations of composite bilinear forms
- Global optimality bounds for the placement of control valves in water supply networks
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- On the Performance of NLP Solvers Within Global MINLP Solvers
- EAGO.jl: easy advanced global optimization in Julia
- On tackling reverse convex constraints for non-overlapping of unequal circles
- Global optimization problems and domain reduction strategies
- Tuning BARON using derivative-free optimization algorithms
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Optimal placement of charging station and distributed generation considering electricity price and load uncertainty using NSBSA algorithm
- scientific article; zbMATH DE number 1078157 (Why is no real title available?)
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver
- Using two-dimensional projections for stronger separation and propagation of bilinear terms
- Global dynamic optimization using edge-concave underestimator
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
Describes a project that uses
Uses Software
This page was built for publication: Domain reduction techniques for global NLP and MINLP optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699520)
