New results on verified global optimization

DOI10.1007/BF02252252zbMath0879.65039OpenAlexW1511783970MaRDI QIDQ2564991

Yanyan Li

Publication date: 7 January 1997

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02252252

zbMATH Keywords

global optimizationnumerical resultsbranch and bound principlemulti-section algorithmsubdivision of boxes

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (6)

Solving a huff-like competitive location and design model for profit maximization in the plane ⋮ Heuristic rejection in interval global optimization ⋮ Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms ⋮ New interval methods for constrained global optimization ⋮ Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms ⋮ Parallel methods for verified global optimization practice and theory

Cites Work

• Optimal centered forms
• Global optimization using interval analysis - the multi-dimensional case
• Automatic differentiation: techniques and applications
• Global optimization using interval analysis: The one-dimensional case
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization
• Preconditioners for the Interval Gauss–Seidel Method
• Interval Methods for Systems of Equations
• Subdivision Direction Selection in Interval Methods for Global Optimization
• ICIAM/GAMM 95 Applied Stochastics Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New results on verified global optimization