Convexity and montonicity in global optimization.

zbMATH Open1049.90067MaRDI QIDQ2768076FDOQ2768076

Hoang Tuy

Publication date: 2001

zbMATH Keywords

polynomial programmingdifference of convex functionsnormal setscanonical monotonic optimization problemdifference of monotonic functionspolyblock algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Set-valued and variational analysis (49J53)

Cited In (3)

• A novel approach to bilevel nonlinear programming
• Title not available (Why is that?)
• Convexity and global optimization: A theoretical link

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Abstract convexity and global optimization 👍 👎
• Convex analysis and global optimization 👍 👎
• Convex analysis and global optimization 👍 👎
• Convexification, concavification and monotonization in global optimization 👍 👎
• Global optimization on convex sets 👍 👎
• Convexification and concavification methods for some global optimization problems 👍 👎
• On convexification for a class of global optimization problems 👍 👎
• Convexity and global optimization: A theoretical link 👍 👎

This page was built for publication: Convexity and montonicity in global optimization.

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