Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
In this paper, first-order optimality conditions for nonlinear programming (NLP) and mixed-integer nonlinear programming (MINLP) problems are developed. Based on these conditions, the authors present three separate optimality-based reduction algorithms for unconstrained, one-constraint, and multi-constraint problems that may be purely continuous or involve integer variables. By dropping redundant constraints at each node of the branch-and-bound tree, the reduction algorithms are flexibly applied to equality-constrained problems. An efficient implementation of the presented algorithms in the branch-and-bound solver BARON is given. The computations illustrate that these algorithms often reduce the solution time and total number of nodes for continuous problems, but they are less effective for mixed-integer programs.
- Domain reduction techniques for global NLP and MINLP optimization
- Reduction constraints for the global optimization of NLPs
- Theoretical and computational results about optimality-based domain reductions
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Global optimization and constraint satisfaction: the branch-and-reduce approach
- A branch-and-reduce approach to global optimization
- A finite algorithm for global minimization of separable concave programs
- A global MINLP approach to symbolic regression
- A hybrid LP/NLP paradigm for global optimization relaxations
- A polyhedral branch-and-cut approach to global optimization
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Different transformations for solving non-convex trim-loss problems by MINLP
- Domain reduction techniques for global NLP and MINLP optimization
- Global optimization and constraint satisfaction: the branch-and-reduce approach
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization of nonconvex factorable programming problems
- scientific article; zbMATH DE number 3898606 (Why is no real title available?)
- scientific article; zbMATH DE number 480288 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Interval analysis on directed acyclic graphs for global optimization
- McCormick-Based Relaxations of Algorithms
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- MINTO, a Mixed INTeger Optimizer
- Mixed integer programming: analyzing 12 years of progress
- Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Redundancy elimination with a lexicographic solved form
- Relaxations of factorable functions with convex-transformable intermediates
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- The global solver in the LINDO API
- Using dual presolving reductions to reformulate cumulative constraints
- Domain reduction techniques for global NLP and MINLP optimization
- Time-optimal velocity planning by a bound-tightening technique
- Global optimization problems and domain reduction strategies
- Bound reduction using pairs of linear inequalities
- Theoretical and computational results about optimality-based domain reductions
- Feasibility-based bounds tightening via fixed points
- Domain reduction using GRASP construction phase for transmission expansion planning problem
- Reduction constraints for the global optimization of NLPs
- On the Performance of NLP Solvers Within Global MINLP Solvers
- Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- (Global) optimization: historical notes and recent developments
- A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps
- Non-convex optimization problems with linear KKT subsystem
- Solving continuous and discrete nonlinear programs with BARON
- A combined linear and nonlinear presolve for nonlinear optimization
- Simultaneous convexification for the planar obnoxious facility location problem
This page was built for publication: Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2182853)
