Duality in Vector Optimization

From MaRDI portal
Publication:3181987


DOI10.1007/978-3-642-02886-1zbMath1177.90355WikidataQ59487147 ScholiaQ59487147MaRDI QIDQ3181987

Radu Ioan Boţ, Gert Wanka, Sorin-Mihai Grad

Publication date: 1 October 2009

Published in: Vector Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02886-1


90C25: Convex programming

90C29: Multi-objective and goal programming

90C46: Optimality conditions and duality in mathematical programming


Related Items

Unnamed Item, Unnamed Item, Unnamed Item, An algorithm to solve polyhedral convex set optimization problems, Lagrange duality, stability and subdifferentials in vector optimization, Duality and gap function for generalized multivalued ϵ-vector variational inequality, Unnamed Item, On the acceleration of the double smoothing technique for unconstrained convex optimization problems, On the Intrinsic Core of Convex Cones in Real Linear Spaces, Moreau Envelope of Supremum Functions with Applications to Infinite and Stochastic Programming, A new approach to strong duality for composite vector optimization problems, Abstract convexity of set-valued topical functions with application in DC-type optimization, Formulation and properties of a divergence used to compare probability measures without absolute continuity, A Fenchel-Moreau theorem for $\bar L^0$-valued functions, Algebraic core and convex calculus without topology, Unnamed Item, On the stability of approximate solutions to set-valued equilibrium problems, New duality results for evenly convex optimization problems, Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization, Solving monotone inclusions involving parallel sums of linearly composed maximally monotone operators, Quadratic scalarization for decomposed multiobjective optimization, On duality for mathematical programs with vanishing constraints, Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators, Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality, Generalized fractal transforms and self-similar objects in cone metric spaces, Sensitivity analysis for a Lagrange dual problem to a vector optimization problem, Bouligand-Severi \(k\)-tangents and strongly semisimple MV-algebras., Saddle points and scalarizing sets in multiple objective linear programming, Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces, Applications of convex analysis within mathematics, On the Fritz John saddle point problem for differentiable multiobjective optimization, Weak and strong subgradients of set-valued maps, A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function, Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior, Duality in vector optimization via augmented Lagrangian, Revisiting some rules of convex analysis, Classical linear vector optimization duality revisited, Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency, Perturbation approach to generalized Nash equilibrium problems with shared constraints, Duality for \(\varepsilon \)-variational inequalities via the subdifferential calculus, Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality, Duality related to approximate proper solutions of vector optimization problems, On extension results for \(n\)-cyclically monotone operators in reflexive Banach spaces, Stable and total Fenchel duality for composed convex optimization problems, Complete characterizations of robust strong duality for robust vector optimization problems, Minimax rule for energy optimization, Characterizations via linear scalarization of minimal and properly minimal elements, Duality results for nonlinear single minimax location problems via multi-composed optimization, Gap functions for quasi-variational inequalities via duality, Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme, Geometry of the expected value set and the set-valued sample mean process, Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications, On gap functions for nonsmooth multiobjective optimization problems, Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs, Error bound results for convex inequality systems via conjugate duality, Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization, A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems, Mixed \(E\)-duality for \(E\)-differentiable vector optimization problems under (generalized) \(V\)-\(E\)-invexity, An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems, Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization, Duality in nonconvex vector optimization, Min-sup-type zero duality gap properties for DC composite optimization problem, Differential stability properties in convex scalar and vector optimization, Decision making and games with vector outcomes, Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty, Vector optimization w.r.t. relatively solid convex cones in real linear spaces, Second-order cone programming relaxations for a class of multiobjective convex polynomial problems, Sequential approximate weak optimality conditions for multiobjective fractional programming problems via sequential calculus rules for the Brøndsted-Rockafellar approximate subdifferential, A perturbation approach to vector optimization problems: Lagrange and Fenchel-Lagrange duality, Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications, Second-order optimality conditions for efficiency in \(C^{1,1}\)-smooth quasiconvex multiobjective programming problem, Lagrange duality in set optimization, Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems, Strong and total Fenchel dualities for robust convex optimization problems, A Fenchel-Moreau-Rockafellar type theorem on the Kantorovich-Wasserstein space with applications in partially observable Markov decision processes, New Farkas-type results for vector-valued functions: a non-abstract approach, Valuation and pricing of electricity delivery contracts: the producer's view, Primal-dual optimization conditions for the robust sum of functions with applications, Convex risk minimization via proximal splitting methods, Farkas-type results for vector-valued functions with applications, A Lagrange duality approach for multi-composed optimization problems, Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems, A proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality, Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems, Bouligand-Severi tangents in MV-algebras., Scaling-invariant maximum margin preference learning, Preconditioned three-operator splitting algorithm with applications to image restoration, Convex robust sum optimization problems with conic and set constraints: duality and optimality conditions revisited, Set Optimization—A Rather Short Introduction, On biconjugates of infimal functions, On the use of the quasi-relative interior in optimization, Gap functions for generalized vector equilibrium problems via conjugate duality and applications, Solution smoothness of ill-posed equations in Hilbert spaces: four concepts and their cross connections, The Differential Semantics of Łukasiewicz Syntactic Consequence, Conjugate Duality in Constrained Set-Valued Vector Optimization Problems, Duality for vector optimization problems via a general scalarization, A Fenchel–Rockafellar duality theorem for set-valued optimization, Inertial forward–backward methods for solving vector optimization problems, Duality results for extended multifacility location problems, Unnamed Item, Unnamed Item, A set-valued Lagrange theorem based on a process for convex vector programming, An Oriented Distance Function Application to Gap Functions for Vector Variational Inequalities, Scalar and Vector Optimization with Composed Objective Functions and Constraints, An Extended Fenchel--Lagrange Duality Approach and Optimality Conditions for Strong Bilevel Programming Problems, Proper minimal points of nonconvex sets in Banach spaces in terms of the limiting normal cone, Robust optimization revisited via robust vector Farkas lemmas, Conjugate Duality for Constrained Vector Optimization in Abstract Convex Frame, Pareto-Fenchel ε-Subdifferential Composition Rule and ε-Efficiency, Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone, Set-valued optimization in variable preference structures with new variants of generalized convexity, Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators, Locally convex spaces with all Archimedean cones closed, Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem, Robust duality for nonconvex uncertain vector optimization via a general scalarization, Conjugate duality in set optimization via nonlinear scalarization, New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems, Regularization for Wasserstein distributionally robust optimization, Connectedness of the solution sets in generalized semi-infinite set optimization, Nonlinear Cone Separation Theorems in Real Topological Linear Spaces, Necessary optimality conditions for vector reverse convex minimization problems via a conjugate duality