Multivalued convexity and optimization: A unified approach to inequality and equality constraints
From MaRDI portal
Publication:4154377
DOI10.1007/BF01584336zbMath0375.90062WikidataQ56936046 ScholiaQ56936046MaRDI QIDQ4154377
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items (66)
Existence and Lagrangian duality for maximization of set-valued functions ⋮ Vector quasi-equilibrium problems for the sum of two multivalued mappings ⋮ Set-valued systems with infinite-dimensional image and applications ⋮ On the continuity of midpoint hull convex set-valued functions ⋮ Theorems of the alternative for multifunctions with applications to optimization: General results ⋮ Optimality conditions for approximate quasi efficiency in set-valued equilibrium problems ⋮ A systematization of convexity and quasiconvexity concepts for set-valued maps, defined byl-type andu-type preorder relations ⋮ Using \(\rho \)-cone arcwise connectedness on parametric set-valued optimization problems ⋮ Unnamed Item ⋮ Convex solutions of the multi-valued iterative equation of order \(n\) ⋮ Intersection theorems for generalized weak KKM set‐valued mappings with applications in optimization ⋮ PARAMETRIC SET-VALUED OPTIMIZATION PROBLEMS UNDER GENERALIZED CONE CONVEXITY ⋮ On constrained set-valued optimization problems with \(\rho\)-cone arcwise connectedness ⋮ Theorems of the alternative for multivalued mappings and applications to mixed convex \(\backslash\) concave systems of inequalities ⋮ Approximate quasi efficiency of set-valued optimization problems via weak subdifferential ⋮ Convex and convex-like optimization over a range inclusion problem and first applications ⋮ Well-posedness and approximate controllability for some integrodifferential evolution systems with multi-valued nonlocal conditions ⋮ Set-valued minimax programming problems under generalized cone convexity ⋮ A hahn-banach theorem in ordered linear spaces and its applications ⋮ Weak Henig proper solution sets for set optimization problems ⋮ Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems ⋮ Strongly convex set-valued maps ⋮ Ohlin-type theorem for convex set-valued maps ⋮ Regularity, calmness and support principle ⋮ Unnamed Item ⋮ KKT conditions for weak\(^\ast\) compact convex sets, theorems of the alternative, and optimality conditions ⋮ Remark on the system of nonlinear variational inclusions ⋮ \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces ⋮ A Minty variational principle for set optimization ⋮ Second-order optimality conditions for set-valued optimization problems under Benson proper efficiency ⋮ Semicontinuity of approximate solution mappings for parametric generalized weak vector equilibrium problems ⋮ On selections of generalized convex set-valued maps ⋮ Explicitly quasiconvex set-valued optimization ⋮ Theorems of the alternative for multifunctions. ⋮ Optimality conditions for a nonconvex set-valued optimization problem ⋮ On nonlinear programming in complex spaces ⋮ On cone convexity of set-valued maps ⋮ Lagrange duality in set optimization ⋮ Set-valued fractional programming problems under generalized cone convexity ⋮ Some Optimality Conditions in Vector Optimization ⋮ Theorems of the alternative for set-valued functions in infinite-dimensional spaces ⋮ A note on quasiconvex set-valued maps. ⋮ Lagrange duality, stability and subdifferentials in vector optimization ⋮ Optimality conditions for maximizations of set-valued functions ⋮ A generalized alternative theorem of partial and generalized cone subconvexlike set-valued maps and its applications in linear spaces ⋮ Convexity of the optimal multifunctions and its consequences in vector optimization ⋮ Optimality conditions for maximizations of set-valued functions ⋮ Set Optimization—A Rather Short Introduction ⋮ The vector complementary problem and its equivalences with the weak minimal element in ordered spaces ⋮ Set-valued optimization problems via second-order contingent epiderivative ⋮ Lagrangian multipliers for generalized affine and generalized convex vector optimization problems of set-valued maps ⋮ Convexity and concavity properties of the optimal value function in parametric nonlinear programming ⋮ A theorem of the alternative and its application to the optimization of set-valued maps ⋮ Intersection theorems for weak \(KKM\) set-valued mappings in the finite dimensional setting ⋮ Optimality conditions for set-valued minimax fractional programming problems ⋮ Necessary optimality conditions for set-valued optimization problems via the extremal principle ⋮ Multivalued mappings ⋮ The optimality conditions for vector optimization of set-valued maps ⋮ A derivative-free descent method in set optimization ⋮ Regularity conditions for constrained extremum problems ⋮ A characterization of cone-convexity for set-valued functions by cone-quasiconvexity ⋮ Saddle points and duality in multi-objective programming ⋮ On vector quasi-equilibrium problems via a Browder-type fixed-point theorem ⋮ Connectedness of the approximate solution sets for set optimization problems ⋮ Surrogate dual problems and surrogate Lagrangians ⋮ Vectorization in set optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regularity and Stability for Convex Multivalued Functions
- The theorem of the alternative, the key-theorem, and the vector-maximum problem
- Technical Note—Optimality Conditions and Recession Cones
- Seven Kinds of Convexity
- Convex Analysis
- Quasi-Convex Programming
This page was built for publication: Multivalued convexity and optimization: A unified approach to inequality and equality constraints
