Domain reduction techniques for global NLP and MINLP optimization
From MaRDI portal
Publication:1699520
DOI10.1007/s10601-016-9267-5zbMath1387.90164arXiv1706.08601OpenAlexW2576928011WikidataQ114859260 ScholiaQ114859260MaRDI QIDQ1699520
Yash Puranik, Nikolaos V. Sahinidis
Publication date: 23 February 2018
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.08601
constraint propagationdomain reductionfeasibility-based bounds tighteningoptimality-based bounds tightening
Related Items
EAGO.jl: easy advanced global optimization in Julia, 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, Optimality-based domain reduction for inequality-constrained NLP and MINLP problems, Global dynamic optimization using edge-concave underestimator, Variable Bound Tightening and Valid Constraints for Multiperiod Blending, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, Computational advances in polynomial optimization: RAPOSa, a freely available global solver, Improved convex and concave relaxations of composite bilinear forms, Optimal placement of charging station and distributed generation considering electricity price and load uncertainty using NSBSA algorithm, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, Tighter McCormick relaxations through subgradient propagation, Tuning BARON using derivative-free optimization algorithms, An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs, On tackling reverse convex constraints for non-overlapping of unequal circles, Optimal control of water distribution networks without storage, Global optimality bounds for the placement of control valves in water supply networks
Uses Software
Cites Work
- Theoretical and computational results about optimality-based domain reductions
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Mathematical programming techniques in water network optimization
- Convex envelopes of products of convex and component-wise concave functions
- An LPCC approach to nonconvex quadratic programs
- Bound constrained interval global optimization in the COCONUT environment
- Using dual presolving reductions to reformulate cumulative constraints
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Three enhancements for optimization-based bound tightening
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Relaxing the optimality conditions of box QP
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods
- Orbital branching
- An improved branch and bound algorithm for minimum concave cost network flow problems
- SCIP: solving constraint integer programs
- The cluster problem revisited
- Computing the range of values of real functions with accuracy higher than second order
- Interval analysis on directed acyclic graphs for global optimization
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Coefficient strengthening: a tool for reformulating mixed-integer programs
- Integrated methods for optimization.
- Progress in presolving for mixed integer programming
- Constraint propagation, relational arithmetic in AI systems and mathematical programs
- Enhancing numerical constraint propagation using multiple inclusion representations
- Interval propagation and search on directed acyclic graphs for numerical constraint solving
- Finding duplicate rows in a linear programming model
- Constraint propagation with interval labels
- A new dominance procedure for combinatorial optimization problems
- Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems
- An analytical approach to global optimization
- Calculation of bounds on variables satisfying nonlinear inequality constraints
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Different transformations for solving non-convex trim-loss problems by MINLP
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- Arc-consistency for continuous variables
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- MINTO, a Mixed INTeger Optimizer
- The cluster problem in multivariate global optimization
- Rigorous global search: continuous problems
- A convex envelope formula for multilinear functions
- Redundancy elimination with a lexicographic solved form
- A finite algorithm for global minimization of separable concave programs
- Convex extensions and envelopes of lower semi-continuous functions
- Pruning by isomorphism in branch-and-cut
- Advanced preprocessing techniques for linear and quadratic programming
- Exploiting orbits in symmetric ILP
- Safe bounds in linear and mixed-integer linear programming
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Seizure warning algorithm based on optimization and nonlinear dynamics
- Safe and tight linear estimators for global optimization
- 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
- Linear relaxations and reduced-Cost based propagation of continuous variable subscripts
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Preprocessing for quadratic programming
- Epsilon-inflation in verification algorithms
- Presolving in linear programming
- A branch-and-reduce approach to global optimization
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- Global optimization problems and domain reduction strategies
- The essence of constraint propagation
- Conflict graphs in solving integer programming problems
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Exclusion regions for optimization problems
- Global optimization of nonconvex problems with multilinear intermediates
- Domain filtering consistencies for non-binary constraints
- Bound reduction using pairs of linear inequalities
- Relaxations of factorable functions with convex-transformable intermediates
- Conflict analysis in mixed integer programming
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
- Mixed integer models for the stationary case of gas network optimization
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Pruning Moves
- The Complexity of Integer Bound Propagation
- A Probing Algorithm for MINLP with Failure Prediction by SVM
- Feasibility-Based Bounds Tightening via Fixed Points
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- An Automatic Method of Solving Discrete Programming Problems
- Formal optimization of some reduced linear programming problems
- A server for automated performance analysis of benchmarking data
- Presolve Reductions in Mixed Integer Programming
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- GlobSol user guide
- ICOS: a branch and bound based solver for rigorous global optimization
- Heuristics for dynamically adapting propagation in constraint satisfaction problems
- The AMPL Modeling Language: An Aid to Formulating and Solving Optimization Problems
- An Analysis of Slow Convergence in Interval Propagation
- Introduction to Interval Analysis
- Simple bounds for solutions of monotone complementarity problems and convex programs
- Solving Large-Scale Zero-One Linear Programming Problems
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron
- Interval Methods for Systems of Equations
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- The Power of Dominance Relations in Branch-and-Bound Algorithms
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Applying interval arithmetic to real, integer, and boolean constraints
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure
- On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
- GRASP: a search algorithm for propositional satisfiability
- A new approach to computing optimal schedules for the job-shop scheduling problem
- Exclusion Regions for Systems of Equations
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
- Stronger Inference through Implied Literals from Conflicts and Knapsack Covers
- Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming
- Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models
- Mixed Integer Programming: Analyzing 12 Years of Progress
- Complete search in continuous global optimization and constraint satisfaction
- Transposition Theorems and Qualification‐Free Optimality Conditions
- An Algorithm for Separable Nonconvex Programming Problems
- Deterministic global optimization using interval constraint propagation techniques
- Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
- BDD-Guided Clause Generation
- Global optimization of general non-convex problems with intermediate bilinear substructures
- Global Optimization and Constraint Satisfaction
- Principles and Practice of Constraint Programming – CP 2004
- Constraint aggregation for rigorous global optimization
- 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
