Vector Optimization – serie

Like norms, translation invariant functions are a natural and powerful tool for the separation of sets and scalarization. This book provides an extensive foundation for their application. It presents in a unified way new results as well as results which are scattered throughout the literature. The functions are defined on linear spaces and can be applied to nonconvex problems. Fundamental theorems for the function class are proved, with implications for arbitrary extended real-valued functions. The scope of applications is illustrated by chapters related to vector optimization, set-valued optimization, and optimization under uncertainty, by fundamental statements in nonlinear functional analysis and by examples from mathematical finance as well as from consumer and production theory.  The book is written for students and researchers in mathematics and mathematical economics. Engineers and researchers from other disciplines can benefit from the applications, for example from scalarization methods for multiobjective optimization and optimal control problems.

A new era is emerging in which a group of quantitative methods featuring characteristics of multidimensional comparative analysis (MCA) and multi-criteria decision-making analysis (MCDA) can be used to automate objective decision-making processes. This book introduces the character of the criteria (desirable, non-desirable, motivating, demotivating, and neutral) to MCDA and MCA methods. It presents the author’s own developed methods, the preference vector method (PVM), for solving multi-criteria problems in decision making; and, vector measure construction method (VMCM), which is dedicated to solving typical problems in the field of multidimensional comparative analysis. All methods are explained step by step with relevant examples, primarily in the fields of economics and management.

A new era is emerging in which a group of quantitative methods featuring characteristics of multidimensional comparative analysis (MCA) and multi-criteria decision-making analysis (MCDA) can be used to automate objective decision-making processes. This book introduces the character of the criteria (desirable, non-desirable, motivating, demotivating, and neutral) to MCDA and MCA methods. It presents the author’s own developed methods, the preference vector method (PVM), for solving multi-criteria problems in decision making; and, vector measure construction method (VMCM), which is dedicated to solving typical problems in the field of multidimensional comparative analysis. All methods are explained step by step with relevant examples, primarily in the fields of economics and management.

This book introduces readers to order analysis and various aspects of deep learning, and describes important connections to optimization, such as nonlinear optimization as well as vector and set optimization. Besides a review of the essentials, this book consists of two main parts.The first main part focuses on the introduction of order analysis as an application-driven theory, which allows to treat order structures with an analytical approach. Applications of order analysis to nonlinear optimization, as well as vector and set optimization with fixed and variable order structures, are discussed in detail. This means there are close ties to finance, operations research, and multicriteria decision making.Deep learning is the subject of the second main part of this book. In addition to the usual basics, the focus is on gradient methods, which are investigated in the context of complex models with a large number of parameters. And a new fast variant of a gradient method is presented in this part. Finally, the deep learning approach is extended to data sets given by set-valued data. Although this set-valued approach is more computationally intensive, it has the advantage of producing more robust predictions.This book is primarily intended for researchers in the fields of optimization, order theory, or artificial intelligence (AI), but it will also benefit graduate students with a general interest in these fields. The book assumes that readers have a basic understanding of functional analysis or at least basic analysis. By unifying and streamlining existing approaches, this work will also appeal to professionals seeking a comprehensive and straightforward perspective on AI or order theory approaches.

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.

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.

This book presents the mathematical theory of vector variational inequalities and their relations with vector optimization problems. It is the first-ever book to introduce well-posedness and sensitivity analysis for vector equilibrium problems. The first chapter provides basic notations and results from the areas of convex analysis, functional analysis, set-valued analysis and fixed-point theory for set-valued maps, as well as a brief introduction to variational inequalities and equilibrium problems. Chapter 2 presents an overview of analysis over cones, including continuity and convexity of vector-valued functions. The book then shifts its focus to solution concepts and classical methods in vector optimization. It describes the formulation of vector variational inequalities and their applications to vector optimization, followed by separate chapters on linear scalarization, nonsmooth and generalized vector variational inequalities. Lastly, the book introduces readers to vector equilibrium problems and generalized vector equilibrium problems. Written in an illustrative and reader-friendly way, the book offers a valuable resource for all researchers whose work involves optimization and vector optimization.

This book presents the mathematical theory of vector variational inequalities and their relations with vector optimization problems. It is the first-ever book to introduce well-posedness and sensitivity analysis for vector equilibrium problems. The first chapter provides basic notations and results from the areas of convex analysis, functional analysis, set-valued analysis and fixed-point theory for set-valued maps, as well as a brief introduction to variational inequalities and equilibrium problems. Chapter 2 presents an overview of analysis over cones, including continuity and convexity of vector-valued functions. The book then shifts its focus to solution concepts and classical methods in vector optimization. It describes the formulation of vector variational inequalities and their applications to vector optimization, followed by separate chapters on linear scalarization, nonsmooth and generalized vector variational inequalities. Lastly, the book introduces readers to vector equilibrium problems and generalized vector equilibrium problems. Written in an illustrative and reader-friendly way, the book offers a valuable resource for all researchers whose work involves optimization and vector optimization.

In many areas in engineering, economics and science new developments are only possible by the application of modern optimization methods. Theoptimizationproblemsarisingnowadaysinapplicationsaremostly multiobjective, i.e. many competing objectives are aspired all at once. These optimization problems with a vector-valued objective function have in opposition to scalar-valued problems generally not only one minimal solution but the solution set is very large. Thus the devel- ment of e?cient numerical methods for special classes of multiobj- tive optimization problems is, due to the complexity of the solution set, of special interest. This relevance is pointed out in many recent publications in application areas such as medicine ([63, 118, 100, 143]), engineering([112,126,133,211,224],referencesin[81]),environmental decision making ([137, 227]) or economics ([57, 65, 217, 234]). Consideringmultiobjectiveoptimizationproblemsdemands?rstthe de?nition of minimality for such problems. A ?rst minimality notion traces back to Edgeworth [59], 1881, and Pareto [180], 1896, using the naturalorderingintheimagespace.A?rstmathematicalconsideration ofthistopicwasdonebyKuhnandTucker[144]in1951.Sincethattime multiobjective optimization became an active research ?eld. Several books and survey papers have been published giving introductions to this topic, for instance [28, 60, 66, 76, 112, 124, 165, 188, 189, 190, 215]. Inthelastdecadesthemainfocuswasonthedevelopmentofinteractive methods for determining one single solution in an iterative process.

Many kinds of practical problems such as engineering design, industrial m- agement and ?nancial investment have multiple objectives con?icting with eachother. Thoseproblemscanbeformulatedasmultiobjectiveoptimization. In multiobjective optimization, there does not necessarily a unique solution which minimizes (or maximizes) all objective functions. We usually face to the situation in which if we want to improve some of objectives, we have to give up other objectives. Finally, we pay much attention on how much to improve some of objectives and instead how much to give up others. This is called “trade-o?. ” Note that making trade-o? is a problem of value ju- ment of decision makers. One of main themes of multiobjective optimization is how to incorporate value judgment of decision makers into decision s- port systems. There are two major issues in value judgment (1) multiplicity of value judgment and (2) dynamics of value judgment. The multiplicity of value judgment is treated as trade-o? analysis in multiobjective optimi- tion. On the other hand, dynamics of value judgment is di?cult to treat. However, it is natural that decision makers change their value judgment even in decision making process, because they obtain new information during the process. Therefore, decision support systems are to be robust against the change of value judgment of decision makers. To this aim, interactive p- grammingmethodswhichsearchasolutionwhileelicitingpartialinformation on value judgment of decision makers have been developed. Those methods are required to perform ?exibly for decision makers’ attitude.

Thecontinuousandincreasinginterestconcerningvectoroptimizationperc- tible in the research community, where contributions dealing with the theory of duality abound lately, constitutes the main motivation that led to writing this book. Decisive was also the research experience of the authors in this ?eld, materialized in a number of works published within the last decade. The need for a book on duality in vector optimization comes from the fact that despite the large amount of papers in journals and proceedings volumes, no book mainly concentrated on this topic was available so far in the scienti?c landscape. There is a considerable presence of books, not all recent releases, on vector optimization in the literature. We mention here the ones due to Chen,HuangandYang(cf. [49]),EhrgottandGandibleux(cf. [65]),Eichfelder (cf. [66]), Goh and Yang (cf. [77]), G.. opfert and Nehse (cf. [80]), G.. opfert, - ahi, Tammer and Z? alinescu (cf. [81]), Jahn (cf. [104]), Kaliszewski (cf. [108]), Luc (cf. [125]), Miettinen (cf. [130]), Mishra, Wang and Lai (cf. [131,132]) and Sawaragi, Nakayama and Tanino (cf. [163]), where vector duality is at most tangentially treated. We hope that from our e?orts will bene?t not only researchers interested in vector optimization, but also graduate and und- graduate students. The framework we consider is taken as general as possible, namely we work in (locally convex) topological vector spaces, going to the usual ?nite - mensional setting when this brings additional insights or relevant connections to the existing literature.

In many areas in engineering, economics and science new developments are only possible by the application of modern optimization methods. Theoptimizationproblemsarisingnowadaysinapplicationsaremostly multiobjective, i.e. many competing objectives are aspired all at once. These optimization problems with a vector-valued objective function have in opposition to scalar-valued problems generally not only one minimal solution but the solution set is very large. Thus the devel- ment of e?cient numerical methods for special classes of multiobj- tive optimization problems is, due to the complexity of the solution set, of special interest. This relevance is pointed out in many recent publications in application areas such as medicine ([63, 118, 100, 143]), engineering([112,126,133,211,224],referencesin[81]),environmental decision making ([137, 227]) or economics ([57, 65, 217, 234]). Consideringmultiobjectiveoptimizationproblemsdemands?rstthe de?nition of minimality for such problems. A ?rst minimality notion traces back to Edgeworth [59], 1881, and Pareto [180], 1896, using the naturalorderingintheimagespace.A?rstmathematicalconsideration ofthistopicwasdonebyKuhnandTucker[144]in1951.Sincethattime multiobjective optimization became an active research ?eld. Several books and survey papers have been published giving introductions to this topic, for instance [28, 60, 66, 76, 112, 124, 165, 188, 189, 190, 215]. Inthelastdecadesthemainfocuswasonthedevelopmentofinteractive methods for determining one single solution in an iterative process.

Many kinds of practical problems such as engineering design, industrial m- agement and ?nancial investment have multiple objectives con?icting with eachother. Thoseproblemscanbeformulatedasmultiobjectiveoptimization. In multiobjective optimization, there does not necessarily a unique solution which minimizes (or maximizes) all objective functions. We usually face to the situation in which if we want to improve some of objectives, we have to give up other objectives. Finally, we pay much attention on how much to improve some of objectives and instead how much to give up others. This is called “trade-o?. ” Note that making trade-o? is a problem of value ju- ment of decision makers. One of main themes of multiobjective optimization is how to incorporate value judgment of decision makers into decision s- port systems. There are two major issues in value judgment (1) multiplicity of value judgment and (2) dynamics of value judgment. The multiplicity of value judgment is treated as trade-o? analysis in multiobjective optimi- tion. On the other hand, dynamics of value judgment is di?cult to treat. However, it is natural that decision makers change their value judgment even in decision making process, because they obtain new information during the process. Therefore, decision support systems are to be robust against the change of value judgment of decision makers. To this aim, interactive p- grammingmethodswhichsearchasolutionwhileelicitingpartialinformation on value judgment of decision makers have been developed. Those methods are required to perform ?exibly for decision makers’ attitude.

The theory of Vector Optimization is developed by a systematic usage of infimum and supremum. In order to get existence and appropriate properties of the infimum, the image space of the vector optimization problem is embedded into a larger space, which is a subset of the power set, in fact, the space of self-infimal sets. Based on this idea we establish solution concepts, existence and duality results and algorithms for the linear case. The main advantage of this approach is the high degree of analogy to corresponding results of Scalar Optimization. The concepts and results are used to explain and to improve practically relevant algorithms for linear vector optimization problems.

We always come cross several decision-making problems in our daily life. Such problems are always conflicting in which many different view points should be satisfied. In politics, business, industrial systems, management science, networks, etc. one often encounters such kind of problems. The most important and difficult part in such problems is the conflict between various objectives and goals. In these problems, one has to find the minimum(or maximum) for several objective functions. Such problems are called vector optimization problems (VOP),multi-criteria optimization problems or multi-objective optimization problems. This volume deals with several different topics / aspects of vector optimization theory ranging from the very beginning to the most recent one. It contains fourteen chapters written by different experts in the field of vector optimization.

The theory of Vector Optimization is developed by a systematic usage of infimum and supremum. In order to get existence and appropriate properties of the infimum, the image space of the vector optimization problem is embedded into a larger space, which is a subset of the power set, in fact, the space of self-infimal sets. Based on this idea we establish solution concepts, existence and duality results and algorithms for the linear case. The main advantage of this approach is the high degree of analogy to corresponding results of Scalar Optimization. The concepts and results are used to explain and to improve practically relevant algorithms for linear vector optimization problems.

Thecontinuousandincreasinginterestconcerningvectoroptimizationperc- tible in the research community, where contributions dealing with the theory of duality abound lately, constitutes the main motivation that led to writing this book. Decisive was also the research experience of the authors in this ?eld, materialized in a number of works published within the last decade. The need for a book on duality in vector optimization comes from the fact that despite the large amount of papers in journals and proceedings volumes, no book mainly concentrated on this topic was available so far in the scienti?c landscape. There is a considerable presence of books, not all recent releases, on vector optimization in the literature. We mention here the ones due to Chen,HuangandYang(cf. [49]),EhrgottandGandibleux(cf. [65]),Eichfelder (cf. [66]), Goh and Yang (cf. [77]), G.. opfert and Nehse (cf. [80]), G.. opfert, - ahi, Tammer and Z? alinescu (cf. [81]), Jahn (cf. [104]), Kaliszewski (cf. [108]), Luc (cf. [125]), Miettinen (cf. [130]), Mishra, Wang and Lai (cf. [131,132]) and Sawaragi, Nakayama and Tanino (cf. [163]), where vector duality is at most tangentially treated. We hope that from our e?orts will bene?t not only researchers interested in vector optimization, but also graduate and und- graduate students. The framework we consider is taken as general as possible, namely we work in (locally convex) topological vector spaces, going to the usual ?nite - mensional setting when this brings additional insights or relevant connections to the existing literature.

We always come cross several decision-making problems in our daily life. Such problems are always conflicting in which many different view points should be satisfied. In politics, business, industrial systems, management science, networks, etc. one often encounters such kind of problems. The most important and difficult part in such problems is the conflict between various objectives and goals. In these problems, one has to find the minimum(or maximum) for several objective functions. Such problems are called vector optimization problems (VOP),multi-criteria optimization problems or multi-objective optimization problems. This volume deals with several different topics / aspects of vector optimization theory ranging from the very beginning to the most recent one. It contains fourteen chapters written by different experts in the field of vector optimization.

Set-valued optimization is a vibrant and expanding branch of mathematics that deals with optimization problems where the objective map and/or the constraints maps are set-valued maps acting between certain spaces. Since set-valued maps subsumes single valued maps, set-valued optimization provides an important extension and unification of the scalar as well as the vector optimization problems. Therefore this relatively new discipline has justifiably attracted a great deal of attention in recent years. This book presents, in a unified framework, basic properties on ordering relations, solution concepts for set-valued optimization problems, a detailed description of convex set-valued maps, most recent developments in separation theorems, scalarization techniques, variational principles, tangent cones of first and higher order, sub-differential of set-valued maps, generalized derivatives of set-valued maps, sensitivity analysis, optimality conditions, duality and applications in economicsamong other things.

This book provides an introduction to vector optimization with variable ordering structures, i.e., to optimization problems with a vector-valued objective function where the elements in the objective space are compared based on a variable ordering structure: instead of a partial ordering defined by a convex cone, we see a whole family of convex cones, one attached to each element of the objective space. The book starts by presenting several applications that have recently sparked new interest in these optimization problems, and goes on to discuss fundamentals and important results on a wide range of topics. The theory developed includes various optimality notions, linear and nonlinear scalarization functionals, optimality conditions of Fermat and Lagrange type, existence and duality results. The book closes with a collection of numerical approaches for solving these problems in practice.

Set-valued optimization is a vibrant and expanding branch of mathematics that deals with optimization problems where the objective map and/or the constraints maps are set-valued maps acting between certain spaces. Since set-valued maps subsumes single valued maps, set-valued optimization provides an important extension and unification of the scalar as well as the vector optimization problems. Therefore this relatively new discipline has justifiably attracted a great deal of attention in recent years. This book presents, in a unified framework, basic properties on ordering relations, solution concepts for set-valued optimization problems, a detailed description of convex set-valued maps, most recent developments in separation theorems, scalarization techniques, variational principles, tangent cones of first and higher order, sub-differential of set-valued maps, generalized derivatives of set-valued maps, sensitivity analysis, optimality conditions, duality and applications in economicsamong other things.