Supports and convex envelopes

DOI10.1007/BF02591955zbMath0571.90076MaRDI QIDQ3688113

S. J. Grotzinger

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

global optimizationsubdifferentialconjugate functionsubgradientlower semicontinuous functionconvex envelopecentroidseparable optimizationfinite union of polytopeslocally simplicial set

Mathematics Subject Classification ID

Nonlinear programming (90C30) Semi-infinite programming (90C34)

Related Items

Existence and sum decomposition of vertex polyhedral convex envelopes, An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes, A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization

Cites Work

• On characterizingL 1-supports, natural and Chebyshev approximates
• Lagrange Multipliers and Nonconvex Programs
• Unnamed Item
• Unnamed Item