Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
From MaRDI portal
Publication:2182853
DOI10.1007/s10898-020-00886-zzbMath1480.90232OpenAlexW3005775749MaRDI QIDQ2182853
Gang Rong, Nikolaos V. Sahinidis, Yi Zhang, Carlos J. Nohra
Publication date: 26 May 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00886-z
optimality conditionspropagationdomain reductionmixed-integer nonlinear programming (MINLP)branch-and-reduceinequality-constrained problem
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)
Related Items
(Global) optimization: historical notes and recent developments, A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using dual presolving reductions to reformulate cumulative constraints
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Interval analysis on directed acyclic graphs for global optimization
- Different transformations for solving non-convex trim-loss problems by MINLP
- MINTO, a Mixed INTeger Optimizer
- Redundancy elimination with a lexicographic solved form
- A finite algorithm for global minimization of separable concave programs
- A hybrid LP/NLP paradigm for global optimization relaxations
- A global MINLP approach to symbolic regression
- Domain reduction techniques for global NLP and MINLP optimization
- A polyhedral branch-and-cut approach to global optimization
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A branch-and-reduce approach to global optimization
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Relaxations of factorable functions with convex-transformable intermediates
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- McCormick-Based Relaxations of Algorithms
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Mixed Integer Programming: Analyzing 12 Years of Progress
- Global Optimization and Constraint Satisfaction
- Global optimization of nonconvex factorable programming problems
