Efficient interval partitioning for constrained global optimization
From MaRDI portal
Publication:956597
DOI10.1007/S10898-008-9297-7zbMATH Open1151.90047OpenAlexW1986444549MaRDI QIDQ956597FDOQ956597
Chandra Sekhar Pedamallu, Linet Özdamar, Tibor Csendes, Tamás Vinkó
Publication date: 25 November 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9297-7
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
constrained global optimizationparsingadaptive search tree managementinterval partitioningsubdivision direction selection rules
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithm 681: INTBIS, a portable interval Newton/bisection package
- PROFIL/BIAS - A fast interval library
- Title not available (Why is that?)
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A new multisection technique in interval methods for global optimization
- Nonlinear coordinate transformations for unconstrained optimization. I: Basic transformations
- Global optimization on Stiefel manifolds: a computational approach
- Global Optimization and Constraint Satisfaction
- Global Optimization and Constraint Satisfaction
- Nonlinear coordinate transformations for unconstrained optimization. II: Theoretical background
- New interval methods for constrained global optimization
- Depth-first iterative-deepening: An optimal admissible tree search
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems
- Title not available (Why is that?)
- Computable error bounds for nonlinear programming
- Title not available (Why is that?)
- An interval algorithm for constrained global optimization
- The Generalized Coconut Problem
- Title not available (Why is that?)
- Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
Cited In (9)
- A sequential approach for unconstrained optimization via a partitioning technique
- A fast memoryless interval-based algorithm for global optimization
- On constrained optimization by interval arithmetic and interval order relations
- Mathematically rigorous global optimization in floating-point arithmetic
- Stochastic filter methods for generally constrained global optimization
- Constructing large feasible suboptimal intervals for constrained nonlinear optimization
- Interval subdivision strategies for constrained optimization
- Title not available (Why is that?)
- TRIOPT: A triangulation-based partitioning algorithm for global optimization
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)
