Convexity and montonicity in global optimization.

<a class="pub-badge pub-badge--grey" href="https://zbmath.org/1049.90067" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q2768076" rel="nofollow">MaRDI QID Q2768076</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q2768076" rel="nofollow">FDO</a>

Authors 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)

Recommendations

• Convexification, concavification and monotonization in global optimization
• Convexity and global optimization: A theoretical link
• Convexification and monotone optimization
• Abstract convexity and global optimization
• scientific article; zbMATH DE number 1225234
• Convex analysis and global optimization
• Convex analysis and 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

Cited in

(3)

• A novel approach to bilevel nonlinear programming
• Convexity and global optimization: A theoretical link
• scientific article; zbMATH DE number 2159407 (Why is no real title available?)

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)