Efficient interval partitioning for constrained global optimization

DOI10.1007/s10898-008-9297-7zbMath1151.90047OpenAlexW1986444549MaRDI QIDQ956597

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

zbMATH Keywords

constrained global optimizationparsingadaptive search tree managementinterval partitioningsubdivision direction selection rules

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (4)

Stochastic filter methods for generally constrained global optimization ⋮ On constrained optimization by interval arithmetic and interval order relations ⋮ A fast memoryless interval-based algorithm for global optimization ⋮ Mathematically rigorous global optimization in floating-point arithmetic

Uses Software

• GLOPT
• PROFIL/BIAS
• SNOPT
• CONOPT
• CFSQP
• MINOS
• GlobSol
• PrincetonLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear coordinate transformations for unconstrained optimization. II: Theoretical background
• Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
• Depth-first iterative-deepening: An optimal admissible tree search
• Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems
• An interval algorithm for constrained global optimization
• PROFIL/BIAS - A fast interval library
• A new multisection technique in interval methods for global optimization
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization
• Nonlinear coordinate transformations for unconstrained optimization. I: Basic transformations
• New interval methods for constrained global optimization
• Global optimization on Stiefel manifolds: a computational approach
• The Generalized Coconut Problem
• Subdivision Direction Selection 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
• Computable error bounds for nonlinear programming
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Global Optimization and Constraint Satisfaction
• Global Optimization and Constraint Satisfaction

This page was built for publication: Efficient interval partitioning for constrained global optimization