Bounding Global Minima

DOI10.1287/MOOR.1.1.50zbMATH Open0457.90064OpenAlexW2055133649MaRDI QIDQ3907417FDOQ3907417

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

Publication date: 1976

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

Full work available at URL: https://doi.org/10.1287/moor.1.1.50

zbMATH Keywords

nonconvex optimizationglobal minimumunconstrained optimizationsufficient existence conditionsconvex compact domainbounding global minimauniformly strictly convex objective functionunique unconstrained minimizer

Mathematics Subject Classification ID

Convex programming (90C25)

Cited In (7)

• Global optimization using interval analysis: The one-dimensional case
• Interval analytic treatment of convex programming problems
• On parametric nonlinear programming
• Bounds for Lagrange multipliers and optimal points
• Calculation of bounds on variables satisfying nonlinear inequality constraints
• Nonlinear equations and optimization
• Characterization of perturbed mathematical programs and interval analysis

This page was built for publication: Bounding Global Minima

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