On the degree and separability of nonconvexity and applications to optimization problems

MaRDI QIDQ1373758zbMATH OpenFDO

Authors Phan Thien Thach, Hiroshi Konno

Publication date 1997

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

d.c. representations of closed setsdualitygeneralized convexityHilbert spacesindex of nonconvexitynonconvex minimization

Mathematics Subject Classification ID

Convexity of real functions of several variables, generalizations (26B25) Convex programming (90C25) Programming in abstract spaces (90C48)

Recommendations

• D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems
• scientific article; zbMATH DE number 3950216
• A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems
• Optimization on low rank nonconvex structures

Cited in

(7)

• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Quantitative measure of nonconvexity for black-box continuous functions
• Separation theorems for nonconvex sets and application in optimization
• Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
• Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l₁- and l_∞-norms
• A note on nonconvex minimax theorem with separable homogeneous polynomials
• Characterization of d.c. Functions in terms of quasidifferentials

This page was built for publication: On the degree and separability of nonconvexity and applications to optimization problems

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