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

DOI10.1017/S0334270000003635MaRDI QIDQ3968045zbMATH OpenOpenAlexFDO

Authors Hang-Chin Lai, Shushih Yang

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

dualitysubdifferentialsaddle pointLagrangiansubgradientconjugate setconvex set functionconjugate functionalfinite atomless measure spaceoptimization of convex set functions

Mathematics Subject Classification ID

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

Cited in

(28)

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

This page was built for publication: Saddle point and duality in the optimization theory of convex set functions

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