Interval analysis on directed acyclic graphs for global optimization
From MaRDI portal
Recommendations
- A new interval approach to global optimization
- A surprising approach in interval global optimization
- Interval propagation and search on directed acyclic graphs for numerical constraint solving
- Interval-arithmetic-oriented interval computing technique for global optimization
- Global optimization using interval arithmetic
Cites work
- Applying interval arithmetic to real, integer, and boolean constraints
- BARON: A general purpose global optimization software package
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems
- Taylor forms -- use and limits.
- The Krawczyk operator and Kantorovich's theorem
- Use of interval slopes for the irrational part of factorable functions
- Verified integration of ODEs and flows using differential algebraic methods on high-order Taylor models
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
Cited in
(37)- Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
- Exclusion regions for optimization problems
- SUSPECT: MINLP special structure detector for Pyomo
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method
- Tighter McCormick relaxations through subgradient propagation
- Optimal resolution sequence of problems modelled by directed graphs
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- A new interval approach to global optimization
- Efficient interval partitioning-local search collaboration for constraint satisfaction
- Nonlinear optimization with GAMS /LGO
- A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
- A surprising approach in interval global optimization
- Rigorous filtering using linear relaxations
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Constraint propagation on quadratic constraints
- The supporting hyperplane optimization toolkit for convex MINLP
- Bound constrained interval global optimization in the COCONUT environment
- A reliable affine relaxation method for global optimization
- On interval-subgradient and no-good cuts
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- DrAmpl: A meta solver for optimization problem analysis
- Exclusion regions for parameter-dependent systems of equations
- A general framework for convexity analysis in deterministic global optimization
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Subdomain separability in global optimization
- Interval propagation and search on directed acyclic graphs for numerical constraint solving
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- First order rejection tests for multiple-objective optimization
- Reverse propagation of McCormick relaxations
- Symmetry in mathematical programming
- Enhancing numerical constraint propagation using multiple inclusion representations
- Domain reduction techniques for global NLP and MINLP optimization
- Rigorous packing of unit squares into a circle
- (Global) optimization: historical notes and recent developments
- Enhancing interval constraint propagation by identifying and filtering \(n\)-ary subsystems
- Algorithmic differentiation techniques for global optimization in the COCONUT environment
This page was built for publication: Interval analysis on directed acyclic graphs for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q816066)
