An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions

DOI10.1007/s12597-009-0009-yzbMath1192.90146MaRDI QIDQ980524

M. Arounassalame, Paluri S. V. Nataraj

Publication date: 29 June 2010

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-009-0009-y

zbMATH Keywords

interval analysis; polynomial optimization

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

Related Items

Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach

Uses Software

• Matlab
• SeDuMi
• INTLAB
• GloptiPoly
• INTOPT_90
• GlobSol

Cites Work

• Handbook of test problems in local and global optimization
• Rigorous global search: continuous problems
• Bounds for Lagrange multipliers and optimal points
• A simple derivation of the Hansen-Bliek-Rohn-Ning-Kearfott enclosure for linear interval equations
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization
• Derivative-free filter simulated annealing method for constrained continuous global optimization
• An improved interval global optimization algorithm using higher-order inclusion function forms
• Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
• GloptiPoly
• Global Optimization and Constraint Satisfaction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item