A global optimization algorithm based on Lagrangian dual

MaRDI QIDQ5322697zbMATH OpenFDO

Authors Huizhuo Wu, Kecun Zhang

Publication date 22 July 2009

zbMATH Keywords

global optimizationnonconvex quadratic programmingLagrangian dualtechnical design

Mathematics Subject Classification ID

Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)

Recommendations

• A global optimization algorithm using Lagrangian underestimates and the interval Newton method
• A global optimization algorithm for generalized quadratic programming
• A global optimization approach for quadratic programs with nonconvex quadratic constraints
• A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints
• A global optimization algorithm using linear relaxation

Cited in

(2)

• A global optimization algorithm using Lagrangian underestimates and the interval Newton method
• Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems

This page was built for publication: A global optimization algorithm based on Lagrangian dual

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