The Fermat Rule for Set Optimization Problems with Lipschitzian Set-Valued Mappings

MaRDI QIDQ4988111zbMATH OpenFDO

Authors Ernest Quintana, Chr. Tammer, Vu Anh Tuan, G. Bouza Allende

Publication date 11 May 2021

Full work available at URL https://arxiv.org/abs/2107.12084, http://yokohamapublishers.jp/online-p/JNCA/vol21/jncav21n5p1137.pdf

zbMATH Keywords

limiting (Mordukhovich) subdifferentialnonlinear scalarizationsoptimality conditionsset optimization

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Abstract: In this paper, we consider set optimization problems where the solution concept is given by the set approach. Specifically, we deal with the lower less and the upper less set relations. First, we derive the convexity and Lipschitzianity of suitable scalarizing functionals under the assumption that the set-valued objective mapping has certain convexity and Lipschitzianity properties. Then, we obtain upper estimates of the limiting subdifferential of these functionals. These results, together with the properties of the scalarization functionals, allow us to obtain a Fermat rule for set optimization problems with Lipschitzian data.

Recommendations

• On some Fermat rules for set-valued optimization problems
• The Fermat Rule and Lagrange Multiplier Rule for Various Efficient Solutions of Set-Valued Optimization Problems Expressed in Terms of Coderivatives
• Strong Fermat rules for constrained set-valued optimization problems on Banach spaces
• On Lagrange multiplier rules for set-valued optimization problems in the sense of set criterion
• A Fenchel-Rockafellar duality theorem for set-valued optimization
• scientific article; zbMATH DE number 5564095
• On derivatives of set-valued maps and optimality conditions for set optimization
• Set optimization problems of generalized semi-continuous set-valued maps with applications
• Existence theorems of set optimization with set-valued maps
• The Lagrange Multiplier Rule in Set-Valued Optimization

Cited in

(6)

• Strong Fermat rules for constrained set-valued optimization problems on Banach spaces
• A steepest descent method for set optimization problems with set-valued mappings of finite cardinality
• The Fermat Rule and Lagrange Multiplier Rule for Various Efficient Solutions of Set-Valued Optimization Problems Expressed in Terms of Coderivatives
• A Vectorization Scheme for Nonconvex Set Optimization Problems
• Existence of Lagrange multipliers for set optimization with application to vector equilibrium problems
• On successive approximations for compact-valued nonexpansive mappings

This page was built for publication: The Fermat Rule for Set Optimization Problems with Lipschitzian Set-Valued Mappings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4988111)