Convex programming with set functions

DOI10.1216/RMJ-1987-17-3-535zbMath0644.90069OpenAlexW2068380951MaRDI QIDQ1102862

B. George

Publication date: 1987

Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1216/rmj-1987-17-3-535

zbMATH Keywords

subdifferentialconjugate functionOptimality conditionsconvex set functions

Mathematics Subject Classification ID

Convex programming (90C25) Convexity of real functions of several variables, generalizations (26B25) Methods of successive quadratic programming type (90C55)

Related Items (7)

Epigraphs of convex set functions ⋮ Convolution of set functions ⋮ The saddle theorem for multiobjective generalized fractional programming problems with set functions ⋮ Fenchel duality theorem in multiobjective programming problems with set functions ⋮ Duality theorems for convex and quasiconvex set functions ⋮ Lagrange multiplier theorem of multiobjective programming problems with set functions ⋮ Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces

This page was built for publication: Convex programming with set functions