Global Optimization over Unbounded Domains

DOI10.1137/0328031MaRDI QIDQ5202854zbMATH OpenOpenAlexFDO

Authors R. L. Voller, H. Ratschek

Publication date 1990

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0328031

zbMATH Keywords

branch-and-boundglobal optimizationoptimization over unbounded domainsunconstrained optimization

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Fractional programming (90C32)

Recommendations

• scientific article; zbMATH DE number 852342
• Interval tools for global optimization
• A branch-and-bound algorithm for bound constrained optimization problems without derivatives
• scientific article; zbMATH DE number 4066243
• scientific article; zbMATH DE number 2068078

Cited in

(6)

• What can interval analysis do for global optimization?
• Interval mathematics, algebraic equations and optimization
• Unsolvability of some optimization problems
• scientific article; zbMATH DE number 2068078 (Why is no real title available?)
• On solving mixed-integer constraint satisfaction problems with unbounded variables
• Interval tools for global optimization

This page was built for publication: Global Optimization over Unbounded Domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202854)