Lagrange multiplier rule for nonconvex set-valued optimization problem

MaRDI QIDQ5144441zbMATH OpenFDO

Authors Hui Huang

Publication date 16 January 2021

Full work available at URL http://www.yokohamapublishers.jp/online-p/PJO/vol13/pjov13n3p403.pdf

zbMATH Keywords

existenceoptimality conditionset-valued mappingweak subgradient

Mathematics Subject Classification ID

Convex programming (90C25) Set-valued and variational analysis (49J53) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30)

Recommendations

• Characterizing the Lagrange multiplier rule in nonconvex set-valued optimization
• The Lagrange Multiplier Rule in Set-Valued Optimization
• Optimality conditions for a nonconvex set-valued optimization problem
• Lagrange multiplier rules for weakly minimal solutions of compact-valued set optimization problems
• On Lagrange multiplier rules for set-valued optimization problems in the sense of set criterion

Cited in

(9)

• Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
• Optimality conditions for a nonconvex set-valued optimization problem
• Properties of uniform tangent sets and Lagrange multiplier rule
• A set-valued Lagrange theorem based on a process for convex vector programming
• scientific article; zbMATH DE number 1777440 (Why is no real title available?)
• Sharp Lagrange multipliers for set-valued optimization problems
• Characterizing the Lagrange multiplier rule in nonconvex set-valued optimization
• Generalized Lagrange multiplier rule for non-convex vector optimization problems
• The Lagrange Multiplier Rule in Set-Valued Optimization

This page was built for publication: Lagrange multiplier rule for nonconvex set-valued optimization problem

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