Global optimization problems and domain reduction strategies
From MaRDI portal
Publication:1960192
Recommendations
- Theoretical and computational results about optimality-based domain reductions
- Domain reduction techniques for global NLP and MINLP optimization
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Importance of search-domain reduction in random optimization
- Subdomain separability in global optimization
Cites work
- scientific article; zbMATH DE number 1857670 (Why is no real title available?)
- scientific article; zbMATH DE number 757674 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A branch-and-reduce approach to global optimization
- An analytical approach to global optimization
- BARON: A general purpose global optimization software package
- Bidimensional packing by bilinear programming
- Calculation of bounds on variables satisfying nonlinear inequality constraints
- Complete search in continuous global optimization and constraint satisfaction
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Integrals which are convex functionals. II
- Introduction to global optimization
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Packing equal circles in a square: A deterministic global optimization approach
Cited in
(20)- Alternative branching rules for some nonconvex problems
- An exploratory computational analysis of dual degeneracy in mixed-integer programming
- Extended reverse-convex programming: an approximate enumeration approach to global optimization
- Theoretical and computational results about optimality-based domain reductions
- Global optimization reduction of generalized Malfatti's problem
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems
- Reduced RLT representations for nonconvex polynomial programming problems
- On interval-subgradient and no-good cuts
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns
- A virtual microstructure generator for 3D stone masonry walls
- Bidimensional packing by bilinear programming
- A computational study on QP problems with general linear constraints
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations
- Time-optimal velocity planning by a bound-tightening technique
- Domain reduction techniques for global NLP and MINLP optimization
- (Global) optimization: historical notes and recent developments
- Three enhancements for optimization-based bound tightening
- Bound reduction using pairs of linear inequalities
This page was built for publication: Global optimization problems and domain reduction strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1960192)
