Interval analysis on directed acyclic graphs for global optimization
From MaRDI portal
A new representation method is discussed for solving global optimization problems using directed acyclic graphs. The method employs various techniques from interval analysis, round-off analysis, slope enclosures, forward and backward evaluation, automatic differentiation, constraint propagation, etc. For sufficiently sparse problems the computational work is proportional to the number of operations in the calculation of the objective function.
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
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- 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
Cited in
(42)- Enhancing numerical constraint propagation using multiple inclusion representations
- Interval propagation and search on directed acyclic graphs for numerical constraint solving
- Optimal resolution sequence of problems modelled by directed graphs
- An analytical approach to global optimization
- A surprising approach in interval global optimization
- Domain reduction techniques for global NLP and MINLP optimization
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns
- Tighter McCormick relaxations through subgradient propagation
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method
- Exclusion regions for parameter-dependent systems of equations
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- The supporting hyperplane optimization toolkit for convex MINLP
- SUSPECT: MINLP special structure detector for Pyomo
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Exclusion regions for optimization problems
- First order rejection tests for multiple-objective optimization
- A general framework for convexity analysis in deterministic global optimization
- A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
- Rigorous packing of unit squares into a circle
- Enhancing interval constraint propagation by identifying and filtering \(n\)-ary subsystems
- Efficient interval partitioning-local search collaboration for constraint satisfaction
- Nonlinear optimization with GAMS /LGO
- Algorithmic differentiation techniques for global optimization in the COCONUT environment
- Symmetry in mathematical programming
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Rigorous filtering using linear relaxations
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Bound constrained interval global optimization in the COCONUT environment
- A reliable affine relaxation method for global optimization
- Reverse propagation of McCormick relaxations
- A new interval approach to global optimization
- DrAmpl: A meta solver for optimization problem analysis
- Constraint propagation on quadratic constraints
- (Global) optimization: historical notes and recent developments
- On interval-subgradient and no-good cuts
- Subdomain separability in global optimization
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- A convex reformulation for speed planning of a vehicle under the travel time and energy consumption objectives
- MUSE-BB: a decomposition algorithm for nonconvex two-stage problems using strong multisection branching
- Parabolic approximation \& relaxation for MINLP
- Publisher correction to: ``Parabolic approximation \& relaxation for MINLP
- Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
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)
