Bounding Global Minima with Interval Arithmetic

DOI10.1287/OPRE.27.4.743zbMATH Open0417.90078OpenAlexW2158787712MaRDI QIDQ3208450FDOQ3208450

Authors: L. J. Mancini, Garth P. McCormick 

Publication date: 1979

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.27.4.743

zbMATH Keywords

application of mathematical programmingunconstrained optimizationinterval analysisglobal minimatermination criteriacomputation of interval boundsdesign of chemical plant

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30)

Cited In (5)

• What can interval analysis do for global optimization?
• Bounds for Lagrange multipliers and optimal points
• Calculation of bounds on variables satisfying nonlinear inequality constraints
• Inverting an interval Hessian of a factorable function
• Characterization of perturbed mathematical programs and interval analysis

This page was built for publication: Bounding Global Minima with Interval Arithmetic

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