Near-subconvexlikeness in vector optimization with set-valued functions

DOI10.1023/A:1017535631418zbMath1012.90061OpenAlexW187778025WikidataQ57445531 ScholiaQ57445531MaRDI QIDQ1608147

Shou-Yang Wang, Yang, Xinmin, Li, Duan

Publication date: 12 August 2002

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1017535631418

zbMATH Keywords

vector optimization set-valued functions scalarization theorem of the alternative Lagrangian multiplier theorem nearly-subconvexlike functions

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Multi-objective and goal programming (90C29)

Related Items (80)

A kind of unified super efficiency via assumption (A) and applications in vector optimization ⋮ Approximate weakly efficient solutions of set-valued vector equilibrium problems ⋮ Globally proper efficiency of set-valued optimization and vector variational inequality involving the generalized contingent epiderivative ⋮ Characterizations of improvement sets via quasi interior and applications in vector optimization ⋮ A note on ``Higher-order optimality conditions in set-valued optimization using Studniarski derivatives and applications to duality ⋮ Higher-order optimality conditions for strict and weak efficient solutions in set-valued optimization ⋮ On super efficiency in set-valued optimization ⋮ Error bounds for generalized mixed vector equilibrium problems via a minimax strategy ⋮ A new kind of inner superefficient points ⋮ Nearly subconvexlike set-valued maps and vector optimization problems ⋮ Strict efficiency in vector optimization with nearly convexlike set-valued maps ⋮ The semi-\(E\) cone convex set-valued map and its applications ⋮ New higher-order strong Karush-Kuhn-Tucker conditions for proper solutions in nonsmooth optimization ⋮ Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces ⋮ Chain rules for a proper \(\varepsilon\)-subdifferential of vector mappings ⋮ Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps ⋮ \(\varepsilon\)-strict subdifferentials of set-valued maps and optimality conditions ⋮ Connectedness of Henig weakly efficient solution set for set-valued optimization problems ⋮ \(E\)-super efficiency of set-valued optimization problems involving improvement sets ⋮ Existence and optimality conditions for approximate solutions to vector optimization problems ⋮ Duality related to approximate proper solutions of vector optimization problems ⋮ Approximate Lagrangian duality and saddle point optimality in set optimization ⋮ Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior ⋮ Lower semicontinuity of the solution mapping to a parametric generalized vector equilibrium problem ⋮ Second-order optimality conditions for cone-subarcwise connected set-valued optimization problems ⋮ Duality results for generalized vector variational inequalities with set-valued maps ⋮ Superefficiency in vector optimization with nearly subconvexlike set-valued maps ⋮ Optimality conditions for the Henig efficient solution of vector equilibrium problems with constraints ⋮ Unnamed Item ⋮ Unnamed Item ⋮ \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces ⋮ Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems ⋮ A kind of unified proper efficiency in vector optimization ⋮ Hartley proper efficiency in multifunction optimization ⋮ Strong duality with super efficiency in set-valued optimization ⋮ Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications ⋮ A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization ⋮ Optimality and duality in set-valued optimization utilizing limit sets ⋮ Moreau-Rockafellar theorems for nonconvex set-valued maps ⋮ The effects of adding objectives to an optimisation problem on the solution set ⋮ New second-order tangent epiderivatives and applications to set-valued optimization ⋮ Second-order Karush-Kuhn-Tucker optimality conditions for set-valued optimization subject to mixed constraints ⋮ Benson proper efficiency for vector optimization of generalized subconvexlike set-valued maps in ordered linear spaces ⋮ \( \varepsilon \)-properly efficiency of multiobjective semidefinite programming with set-valued functions ⋮ Painlevé-Kuratowski stability of the solution sets to perturbed vector generalized systems ⋮ Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces ⋮ Nonlinear separation methods and applications for vector equilibrium problems using improvement sets ⋮ ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps ⋮ Optimality conditions of vector set-valued optimization problem involving relative interior ⋮ A generalized alternative theorem of partial and generalized cone subconvexlike set-valued maps and its applications in linear spaces ⋮ Calmness and exact penalization in constrained scalar set-valued optimization ⋮ The relationship between ic-cone-convexness and nearly cone-subconvexlikeness ⋮ The relationship between two kinds of generalized convex set-valued maps in real ordered linear spaces ⋮ On super efficiency in set-valued optimisation in locally convex spaces ⋮ Higher-order optimality conditions and duality for approximate solutions in non-convex set-valued optimization ⋮ New generalized convexity notion for set-valued maps and application to vector optimization ⋮ Optimality conditions for strictly efficient solutions in set-valued optimization ⋮ Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces ⋮ Hartley proper efficiency in multiobjective optimization problems with locally Lipschitz set-valued objectives and constraints ⋮ Second-Order M-Composed Tangent Derivative and Its Applications ⋮ An optimal alternative theorem and applications to mathematical programming ⋮ Optimality conditions for strong vector equilibrium problems under a weak constraint qualification ⋮ Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps ⋮ Optimality conditions and duality for nonsmooth vector equilibrium problems with constraints ⋮ Approximate proper efficiency in vector optimization ⋮ Optimality conditions for multiobjective optimization problem constrained by parameterized variational inequalities ⋮ \(\epsilon \)-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces ⋮ Strong Duality with Proper Efficiency in Multiobjective Optimization Involving Nonconvex Set-Valued Maps ⋮ Benson proper efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions. ⋮ Kuhn-Tucker condition and Wolfe duality of preinvex set-valued optimization ⋮ Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems ⋮ Approximate Benson efficient solutions for set-valued equilibrium problems ⋮ Henig efficiency in vector optimization with nearly cone-subconvexlike set-valued functions ⋮ E-Benson proper efficiency in vector optimization ⋮ Generalized ( ,α, ρ, θ)–d–V–univex functions and non-smooth alternative theorems ⋮ Characterizations of Hartley proper efficiency in nonconvex vector optimization ⋮ Semicontinuity of Approximate Solution Mappings to Parametric Set-Valued Weak Vector Equilibrium Problems ⋮ Higher-order optimality conditions for set-valued optimization with ordering cones having empty interior using variational sets ⋮ A new approach to constrained optimization via image space analysis ⋮ Optimality conditions for quasi-solutions of vector optimization problems

Cites Work

This page was built for publication: Near-subconvexlikeness in vector optimization with set-valued functions