Near-subconvexlikeness in vector optimization with set-valued functions
From MaRDI portal
Publication:1608147
DOI10.1023/A:1017535631418zbMATH Open1012.90061OpenAlexW187778025WikidataQ57445531 ScholiaQ57445531MaRDI QIDQ1608147FDOQ1608147
Authors: Xinmin Yang, Duan Li, Shouyang Wang 
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
Recommendations
- Benson proper efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions.
- Some applications of near \((C, \varepsilon)\)-subconvexlikeness in vector optimization problems with set-valued maps
- Nearly subconvexlike set-valued maps and vector optimization problems
- New generalized convexity notion for set-valued maps and application to vector optimization
- Super efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions
scalarizationvector optimizationset-valued functionstheorem of the alternativeLagrangian multiplier theoremnearly-subconvexlike functions
Cites Work
- Existence and Lagrangian duality for maximization of set-valued functions
- Title not available (Why is that?)
- Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
- Lagrangian duality for preinvex set-valued functions
- Title not available (Why is that?)
- Proper Efficient Points for Maximizations with Respect to Cones
- Lagrangian duality for minimization of nonconvex multifunctions
- Optimization of set-valued functions
- Some general conditions assuring \(\text{int }A+B=\text{int}(A+B)\)
Cited In (86)
- A kind of unified proper efficiency in vector optimization
- Second-order \(M\)-composed tangent derivative and its applications
- Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces
- \( \varepsilon \)-properly efficiency of multiobjective semidefinite programming with set-valued functions
- Approximate Benson properly efficient solutions for set-valued equilibrium problems
- Painlevé-Kuratowski stability of the solution sets to perturbed vector generalized systems
- Title not available (Why is that?)
- The relationship between two kinds of generalized convex set-valued maps in real ordered linear spaces
- A generalized alternative theorem of partial and generalized cone subconvexlike set-valued maps and its applications in linear spaces
- Weakly nondominated solutions of set-valued optimization problems with variable ordering structures in linear spaces
- Title not available (Why is that?)
- A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization
- Approximate Lagrangian duality and saddle point optimality in set optimization
- Nonlinear separation methods and applications for vector equilibrium problems using improvement sets
- New higher-order strong Karush-Kuhn-Tucker conditions for proper solutions in nonsmooth optimization
- Approximate weak efficiency of the set-valued optimization problem with variable ordering structures
- Optimality conditions for strong vector equilibrium problems under a weak constraint qualification
- Approximate Benson efficient solutions for set-valued equilibrium problems
- A new kind of inner superefficient points
- Higher-order optimality conditions with separated derivatives and sensitivity analysis for set-valued optimization
- Benson proper efficiency for vector optimization of generalized subconvexlike set-valued maps in ordered linear spaces
- Approximate proper efficiency 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
- Optimality and duality in set-valued optimization utilizing limit sets
- A new approach to constrained optimization via image space analysis
- Higher-order optimality conditions for set-valued optimization with ordering cones having empty interior using variational sets
- Optimality conditions for quasi-solutions of vector optimization problems
- A kind of unified super efficiency via assumption (A) and applications in vector optimization
- Optimality conditions of vector set-valued optimization problem involving relative interior
- Optimality conditions for strictly efficient solutions in set-valued optimization
- Optimality conditions for the Henig efficient solution of vector equilibrium problems with constraints
- Title not available (Why is that?)
- Characterizations of improvement sets via quasi interior and applications in vector optimization
- The effects of adding objectives to an optimisation problem on the solution set
- Duality related to approximate proper solutions of vector optimization problems
- \(\varepsilon\)-strict subdifferentials of set-valued maps and optimality conditions
- Connectedness of Henig weakly efficient solution set for set-valued optimization problems
- The semi-\(E\) cone convex set-valued map and its applications
- An optimal alternative theorem and applications to mathematical programming
- On super efficiency in set-valued optimization
- \(E\)-super efficiency of set-valued optimization problems involving improvement sets
- Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior
- Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
- Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems
- 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
- Generalized \((\mathcal F,\alpha , \rho , \theta )\)-\(d\)-\(V\)-univex functions and non-smooth alternative theorems
- Benson proper efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions.
- The relationship between ic-cone-convexness and nearly cone-subconvexlikeness
- Nearly subconvexlike set-valued maps and vector optimization problems
- \(E\)-Benson proper efficiency in vector optimization
- Semicontinuity of approximate solution mappings to parametric set-valued weak vector equilibrium problems
- Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications
- Superefficiency in vector optimization with nearly subconvexlike set-valued maps
- Moreau-Rockafellar theorems for nonconvex set-valued maps
- Optimality conditions for multiobjective optimization problem constrained by parameterized variational inequalities
- Error bounds for generalized mixed vector equilibrium problems via a minimax strategy
- Existence and optimality conditions for approximate solutions to vector optimization problems
- Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps
- Kuhn-Tucker condition and Wolfe duality of preinvex set-valued optimization
- \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces
- Henig efficiency in vector optimization with nearly cone-subconvexlike set-valued functions
- Chain rules for a proper \(\varepsilon\)-subdifferential of vector mappings
- Second-order optimality conditions for cone-subarcwise connected set-valued optimization problems
- Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps
- \(\epsilon \)-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces
- New generalized convexity notion for set-valued maps and application to vector optimization
- Second-order Karush-Kuhn-Tucker optimality conditions for set-valued optimization subject to mixed constraints
- Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions
- Duality results for generalized vector variational inequalities with set-valued maps
- Characterizations of Hartley proper efficiency in nonconvex vector optimization
- Lower semicontinuity of the solution mapping to a parametric generalized vector equilibrium problem
- Hartley proper efficiency in multifunction optimization
- Higher-order optimality conditions and duality for approximate solutions in non-convex set-valued optimization
- Hartley proper efficiency in multiobjective optimization problems with locally Lipschitz set-valued objectives and constraints
- ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
- Strong Duality with Proper Efficiency in Multiobjective Optimization Involving Nonconvex Set-Valued Maps
- New second-order tangent epiderivatives and applications to set-valued optimization
- Strict efficiency in vector optimization with nearly convexlike set-valued maps
- Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces
- Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces
- Optimality conditions and duality for nonsmooth vector equilibrium problems with constraints
- On super efficiency in set-valued optimisation in locally convex spaces
- Strong duality with super efficiency in set-valued optimization
- Calmness and exact penalization in constrained scalar set-valued optimization
This page was built for publication: Near-subconvexlikeness in vector optimization with set-valued functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1608147)
