Efficient interval partitioning for constrained global optimization
From MaRDI portal
(Redirected from Publication:956597)
Recommendations
- scientific article; zbMATH DE number 6183018
- Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
- New interval methods for constrained global optimization
- scientific article; zbMATH DE number 818540
- Interval subdivision strategies for constrained optimization
Cites work
- scientific article; zbMATH DE number 3854326 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 193463 (Why is no real title available?)
- scientific article; zbMATH DE number 1057693 (Why is no real title available?)
- scientific article; zbMATH DE number 1058961 (Why is no real title available?)
- scientific article; zbMATH DE number 1067639 (Why is no real title available?)
- scientific article; zbMATH DE number 6183018 (Why is no real title available?)
- A new multisection technique in interval methods for global optimization
- Algorithm 681: INTBIS, a portable interval Newton/bisection package
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
- An interval algorithm for constrained global optimization
- Benchmarking global optimization and constraint satisfaction codes
- Computable error bounds for nonlinear programming
- Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems
- Depth-first iterative-deepening: An optimal admissible tree search
- Global optimization and constraint satisfaction: the branch-and-reduce approach
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization on Stiefel manifolds: a computational approach
- New interval methods for constrained global optimization
- Nonlinear coordinate transformations for unconstrained optimization. I: Basic transformations
- Nonlinear coordinate transformations for unconstrained optimization. II: Theoretical background
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- PROFIL/BIAS - A fast interval library
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
- The Generalized Coconut Problem
Cited in
(10)- Mathematically rigorous global optimization in floating-point arithmetic
- A sequential approach for unconstrained optimization via a partitioning technique
- TRIOPT: A triangulation-based partitioning algorithm for global optimization
- Efficient interval partitioning-local search collaboration for constraint satisfaction
- A fast memoryless interval-based algorithm for global optimization
- Interval subdivision strategies for constrained optimization
- Stochastic filter methods for generally constrained global optimization
- Constructing large feasible suboptimal intervals for constrained nonlinear optimization
- scientific article; zbMATH DE number 6183018 (Why is no real title available?)
- On constrained optimization by interval arithmetic and interval order relations
Describes a project that uses
Uses Software
This page was built for publication: Efficient interval partitioning for constrained global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q956597)
