Saddle point and duality in the optimization theory of convex set functions

DOI10.1017/S0334270000003635zbMath0502.49006OpenAlexW2162132477MaRDI QIDQ3968045

Shushih Yang, Hang-Chin Lai

Publication date: 1982

Published in: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0334270000003635

zbMATH Keywords

dualitysubdifferentialLagrangiansaddle pointsubgradientconjugate setconvex set functionconjugate functionalfinite atomless measure spaceoptimization of convex set functions

Mathematics Subject Classification ID

Convex programming (90C25) Methods involving semicontinuity and convergence; relaxation (49J45) Existence theories for problems in abstract spaces (49J27) Convexity of real functions of several variables, generalizations (26B25) Methods of successive quadratic programming type (90C55) Abstract differentiation theory, differentiation of set functions (28A15)

Related Items (28)

Proper D-solutions of multiobjective programming problems with set functions ⋮ Convolution of set functions ⋮ Oil minmax programming problems containing n-set functions ⋮ Moreau-Rockafellar type theorem for convex set functions ⋮ On several results about convex set functions ⋮ Optimality for set functions with values in ordered vector spaces ⋮ Multiobjective Fractional Duality Forn-Set Functions ⋮ Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions ⋮ Generalized convex set functions ⋮ Optimality and duality for multiobjective programming involving subdifferentiable set functions ⋮ Fenchel duality theorem in multiobjective programming problems with set functions ⋮ Duality theorems of vector-valued \(n\)-set functions ⋮ On minimax fractional programming of generalized convex set functions ⋮ On the optimality conditions of vector-valued \(n\)-set functions ⋮ Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions ⋮ On the optimality of differentiable nonconvex \(n\)-set functions ⋮ Duality for generalized fractional programs involving n-set functions ⋮ Optimality conditions and duality for multiobjective measurable subset selection problems ⋮ Approximate Saddle Point and Duality for Multiobjective n-Set Optimization ⋮ Minimax fractional programming for \(n\)-set functions and mixed-type duality under generalized Invexity ⋮ Optimality of differentiable, vector-valued n-set functions ⋮ Optimization theory for n-set functions ⋮ Sufficiency criteria and duality for nonlinear programs involving n-set functions ⋮ The Fenchel-Moreau Theorem for Set Functions ⋮ Duality for a minimax programming problem containing \(n\)-set functions ⋮ Unnamed Item ⋮ On multiple objective 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: Saddle point and duality in the optimization theory of convex set functions