Saddle-point theorems for the generalized cone-convex optimizations of set-valued functions

2017/09/14 by Renying Zeng, Zeng, Renying
Computer Science · Engineering · Mathematics · #49J53 #90C26 #90C48 #Advanced Optimization Algorithms Research #FOS: Mathematics #Optimization and Control (math.OC) #Optimization and Variational Analysis #Sparse and Compressive Sensing Techniques

paper · pdf · doi:10.48550/arxiv.1709.04892

openalex publication_date 2017/09/14 · openalex created_date 2017/09/25 · openalex updated_date 2026/07/28

Abstract

This paper works with preconvexlike set-valued vector optimization problems in topological linear spaces. A Fakas-Minkowski alternative theorem, a scalarization theorem, some vector saddle-point theorems and some scalar saddle point theorem are proved.

Related

• Some optimality conditions of set-valued optimization problems in locally convex topological vector spaces
• Efficient Solutions in Generalized Linear Vector Optimization
• Contractibility of the solution sets for set optimization problems
• Scalarization in vector optimization by functions with uniform sublevel sets
• Conic cancellation laws and some applications