Vector Optimization and Monotone Operators via Convex Duality
This book investigates several duality approaches for vector optimization problems, while also comparing them. Special attention is paid to duality for linear vector optimization problems, for which a vector dual that avoids the shortcomings of the classical ones is proposed. Moreover, the book addresses different efficiency concepts for vector optimization problems. Among the problems that appear when the framework is generalized by considering set-valued functions, an increasing interest is generated by those involving monotone operators, especially now that new methods for approaching them by means of convex analysis have been developed. Following this path, the book provides several results on different properties of sums of monotone operators.
Presents the first approach to the maximal monotonicity of the diagonal operators by means of representative functionsIntroduces a framework for vector duality via general scalarizationsInvestigates the structure of the closedness-type regularity conditions in scalar optimization, showing how one can derive them