The Lagrange Multiplier Rule in Set-Valued Optimization
From MaRDI portal
Publication:4518164
Recommendations
- Characterizing the Lagrange multiplier rule in nonconvex set-valued optimization
- Lagrange multiplier rule for nonconvex set-valued optimization problem
- scientific article; zbMATH DE number 1777440
- Lagrange multipliers for set-valued optimization problems associated with coderivatives
- scientific article; zbMATH DE number 2156020
Cited in
(58)- Optimality conditions for set-valued maps with set optimization
- Computation formulas and multiplier rules for graphical derivatives in separable Banach spaces
- Kuhn-Tucker condition and Wolfe duality of preinvex set-valued optimization
- Optimality conditions for proper efficient solutions of vector set-valued optimization.
- The existence of contingent epiderivatives for set-valued maps
- Approximate quasi efficiency of set-valued optimization problems via weak subdifferential
- Boundedness of certain sets of Lagrange multipliers in vector optimization
- Second-order optimality conditions in set optimization
- Second-order optimality conditions for strict efficiency of constrained set-valued optimization
- Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems
- Scalar Lagrange multiplier rules for set-valued problems in infinite-dimensional spaces
- Second-order Karush-Kuhn-Tucker optimality conditions for set-valued optimization subject to mixed constraints
- Quasi-contingent derivatives and studies of higher-orders in nonsmooth optimization
- Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps
- New second-order optimality conditions for vector equilibrium problems with constraints in terms of contingent derivatives
- New higher-order strong Karush-Kuhn-Tucker conditions for proper solutions in nonsmooth optimization
- Lagrange multipliers in convex set optimization with the set and vector criteria
- Second-order Karush-Kuhn-Tucker optimality conditions for set-valued optimization
- Karush-Kuhn-Tucker conditions in set optimization
- Lagrange multiplier rules for approximate solutions in vector optimization
- The Lagrange multiplier rule for super efficiency in vector optimization
- The Fermat rule for multifunctions for super efficiency
- Lagrange multipliers for set-valued optimization problems associated with coderivatives
- The Fermat rule for multifunctions on Banach spaces
- On necessary optimality conditions with higher-order complementarity slackness for set-valued optimization problems
- Necessary optimality conditions in nondifferentiable vector optimization
- A new nonlinear scalarization function and applications
- Set Optimization—A Rather Short Introduction
- The Fermat Rule and Lagrange Multiplier Rule for Various Efficient Solutions of Set-Valued Optimization Problems Expressed in Terms of Coderivatives
- Estimations of the Lagrange multipliers' norms in set-valued optimization
- ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
- Conic positive definiteness and sharp minima of fractional orders in vector optimization problems
- On approximate solutions in set-valued optimization problems
- Some Calculus Rules for Contingent Epiderivatives
- Optimality criteria in set-valued optimization
- A multiplier rule in set-valued optimisation
- scientific article; zbMATH DE number 1777440 (Why is no real title available?)
- Higher-order Karush-Kuhn-Tucker conditions in nonsmooth optimization
- Lagrange multiplier rules for weak approximate Pareto solutions of constrained vector optimization problems in Hilbert spaces
- Lagrange duality, stability and subdifferentials in vector optimization
- The Fermat Rule for Set Optimization Problems with Lipschitzian Set-Valued Mappings
- Lagrange multiplier rules for weak approximate Pareto solutions to constrained vector optimization problems with variable ordering structures
- Characterizing the Lagrange multiplier rule in nonconvex set-valued optimization
- Lagrange multiplier rule for nonconvex set-valued optimization problem
- A set-valued Lagrange theorem based on a process for convex vector programming
- Extended radial epiderivatives of non-convex vector-valued maps and parametric quasiconvex programming
- Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
- Generalized radial epiderivatives and nonconvex set-valued optimization problems
- On Non-linear Optimization with a Perturbed Objective Function
- On vector variational-like inequalities and set-valued optimization problems
- Optimality conditions for global minimizers to a class of convex set optimization problem subjected to geometric constraints
- Optimality conditions for the difference of convex set-valued mappings
- About contingent epiderivatives
- Second-order optimality conditions with the envelope-like effect for set-valued optimization
- Some remarks on the existence and computation of contingent epiderivatives
- Weak sharp minima for piecewise linear multiobjective optimization in normed spaces
- Optimality conditions for a nonconvex set-valued optimization problem
- Scalar multiplier rules in set-valued optimization
This page was built for publication: The Lagrange Multiplier Rule in Set-Valued Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4518164)
