scientific article; zbMATH DE number 4051358

MaRDI QIDQ3787798zbMATH OpenFDO

Authors

Publication date 1988

zbMATH Keywords

constrained global optimizationconstraint dropping strategycutting planeidentification of redundant constraintsNonlinear cutsouter cut methodsunbounded feasible sets

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• Imbedding and cutting methods for global optimization and their applications
• On an outer approximation concept in global optimization
• Cutting angle methods in global optimization
• On global optimality conditions and cutting plane algorithms
• A polyhedral branch-and-cut approach to global optimization
• scientific article; zbMATH DE number 5989987
• Convex Programming Methods for Global Optimization
• Extended cutting angle method of global optimization
• scientific article; zbMATH DE number 1225234
• A cut-peak function method for global optimization

Cited in

(5)

• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
• On global optimality conditions and cutting plane algorithms
• Cutting angle methods in global optimization
• On the hierarchy of γ-valid cuts in global optimization
• On an outer approximation concept in global optimization

This page was built for publication:

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