Pages that link to "Item:Q1406601"

The following pages link to Variational methods in partially ordered spaces (Q1406601):

Displaying 50 items.

• A scalarization scheme for binary relations with applications to set-valued and robust optimization (Q2022231) (← links)
• The finite intersection property for equilibrium problems (Q2022298) (← links)
• Ekeland variational principles involving set perturbations in vector equilibrium problems (Q2022330) (← links)
• Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization (Q2025290) (← links)
• Calculating radius of robust feasibility of uncertain linear conic programs via semi-definite programs (Q2032008) (← links)
• A limiting subdifferential version of Ekeland's variational principle in set optimization (Q2037881) (← links)
• Essential stability in unified vector optimization (Q2038924) (← links)
• A general branch-and-bound framework for continuous global multiobjective optimization (Q2038927) (← links)
• Six set scalarizations based on the oriented distance: continuity, convexity and application to convex set optimization (Q2040433) (← links)
• Well-posedness and stability in set optimization with applications (Q2045917) (← links)
• Stability of minimality and criticality in directional set-valued optimization problems (Q2045919) (← links)
• Metric inequality conditions on sets and consequences in optimization (Q2046537) (← links)
• Ekeland's type variational principle for locally convex cone-valued functions (Q2051917) (← links)
• Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case (Q2059178) (← links)
• Generalized strong vector quasi-equilibrium problems with variable ordering structure (Q2067847) (← links)
• Coderivatives and Aubin property of efficient point and efficient solution set-valued maps in parametric vector optimization (Q2069572) (← links)
• Strict directional solutions in vectorial problems: necessary optimality conditions (Q2070365) (← links)
• Exact penalization and optimality conditions for approximate directional minima (Q2078264) (← links)
• New notions of proper efficiency in set optimization with the set criterion (Q2095564) (← links)
• Continuity and sensitivity analysis of parameterized Nash games (Q2099318) (← links)
• Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification (Q2105868) (← links)
• A note on the generalized nonlinear vector variational-like inequality problem (Q2112627) (← links)
• Generalized \({\varepsilon }\)-quasi solutions of set optimization problems (Q2114597) (← links)
• A note on pointwise well-posedness of set-valued optimization problems (Q2115255) (← links)
• Metric regularity and Lyusternik-Graves theorem via approximate fixed points of set-valued maps in noncomplete metric spaces (Q2116028) (← links)
• On the ordinal structure of the weighted set relation (Q2135509) (← links)
• An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) (← links)
• Modelling equilibrium for a multi-criteria selfish routing network equilibrium flow problem (Q2146721) (← links)
• What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization (Q2147143) (← links)
• Vectorial Ekeland variational principle and cyclically antimonotone equilibrium problems (Q2150744) (← links)
• Remarks on some variants of minimal point theorem and Ekeland variational principle with applications (Q2162672) (← links)
• Connectedness of solution sets for generalized vector equilibrium problems via free-disposal sets in complete metric space (Q2162689) (← links)
• Approximations for Pareto and proper Pareto solutions and their KKT conditions (Q2168054) (← links)
• A barrier method in convex vector optimization with generalized inequality constraints (Q2174915) (← links)
• Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps (Q2176278) (← links)
• On the existence of weak efficient solutions of nonconvex vector optimization problems (Q2188949) (← links)
• Lagrange multipliers in convex set optimization with the set and vector criteria (Q2189633) (← links)
• Optimality conditions for approximate proper solutions in multiobjective optimization with polyhedral cones (Q2192032) (← links)
• Necessary conditions for nondominated solutions in vector optimization (Q2198529) (← links)
• A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization (Q2230945) (← links)
• A steepest descent method for set optimization problems with set-valued mappings of finite cardinality (Q2231334) (← links)
• Set relations and weak minimal solutions for nonconvex set optimization problems with applications (Q2231343) (← links)
• The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments (Q2242324) (← links)
• A pre-order principle and set-valued Ekeland variational principle (Q2252307) (← links)
• Improvement sets and vector optimization (Q2253346) (← links)
• Nonlinear scalarization with applications to Hölder continuity of approximate solutions (Q2260231) (← links)
• Variational analysis in psychological modeling (Q2260666) (← links)
• Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior (Q2260684) (← links)
• Minimum type functions, plus-cogauges, and applications (Q2260689) (← links)
• The relationship between multi-objective robustness concepts and set-valued optimization (Q2264185) (← links)