Convexification approaches for a class of continuous global optimization problem

MaRDI QIDQ3180755zbMATH OpenFDO

Authors

Publication date 6 January 2017

zbMATH Keywords

convexificationglobal optimizationnecessary and sufficient conditionpositive sub-definite function

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26)

Recommendations

• Convexification and concavification for a general class of global optimization problems
• Convexification, concavification and monotonization in global optimization
• A convexification method for a class of global optimization problems with applications to reliability optimization
• On convexification for a class of global optimization problems
• Convexification and concavification for a class of non-monotone optimization problems

Cited in

(4)

• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• scientific article; zbMATH DE number 6135095 (Why is no real title available?)
• A convexification method for a class of global optimization problems with applications to reliability optimization
• Continuous global optimization of multivariable functions based on Sergeev and Kvasov diagonal approach

This page was built for publication: Convexification approaches for a class of continuous global optimization problem

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