Calculation of bounds on variables satisfying nonlinear inequality constraints
From MaRDI portal
Publication:1207040
DOI10.1007/BF01100238zbMath0845.90105OpenAlexW2013168719MaRDI QIDQ1207040
Garth P. McCormick, Ammar Salah El-Deen Hamed
Publication date: 4 May 1993
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01100238
Related Items
Theoretical and computational results about optimality-based domain reductions, A branch-and-reduce approach to global optimization, Alternative branching rules for some nonconvex problems, Domain reduction techniques for global NLP and MINLP optimization, Global optimization problems and domain reduction strategies, Time-optimal velocity planning by a bound-tightening technique, Quasiconvex relaxations based on interval arithmetic, Calculation of bounds on variables satisfying nonlinear inequality constraints, Tighter McCormick relaxations through subgradient propagation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the global minimization of concave functions
- Concave minimization via conical partitions and polyhedral outer approximation
- Convex programs with an additional reverse convex constraint
- Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- The design centering problem as a d.c. programming problem
- Linear programs with an additional reverse convex constraint
- Reverse convex programming
- On the convergence of two branch-and-bound algorithms for nonconvex programming problems
- Inverting an interval Hessian of a factorable function
- Calculation of bounds on variables satisfying nonlinear inequality constraints
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- Bounding Global Minima with Interval Arithmetic
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- A finite algorithm for concave minimization over a polyhedron
- Fourier's Method of Linear Programming and Its Dual
- Global minimization of a difference of two convex functions
- A modified version of Tuy's method for solving d.c. programing problem
- A method for globally minimizing concave functions over convex sets
- Locating an Isolated Global Minimizer of a Constrained Nonconvex Program
- Bounding Global Minima
- Computer-generated interval extensions of factorable functions and their derivatives
- An algorithm for nonconvex programming problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Concave minimization over a convex polyhedron
- An Algorithm for Separable Nonconvex Programming Problems
- A Branch-and-Bound Algorithm for Multi-Level Fixed-Charge Problems
- An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
