Boundedness of certain sets of Lagrange multipliers in vector optimization

DOI10.1016/j.amc.2015.05.112zbMath1410.90187OpenAlexW1811446409MaRDI QIDQ1732203

Xianqiang Yang

Publication date: 22 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2015.05.112

zbMATH Keywords

nonsmooth optimizationoptimality conditionsconstraint qualificationsMP-subdifferential

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)

Related Items (1)

Existence and boundedness of second-order Karush-Kuhn-Tucker multipliers for set-valued optimization with variable ordering structures

Cites Work

• Unnamed Item
• Unnamed Item
• Constrained qualifications in multiobjective optimization problems: Differentiable case
• A Lagrange multiplier rule with small convex-valued subdifferentials for nonsmooth problems of mathematical programming involving equality and nonfunctional constraints
• Bounded sets of KKT multipliers in vector optimization
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Necessary Conditions in Nonsmooth Optimization
• Optimization and nonsmooth analysis
• Shrinking generalized gradients
• A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
• Semiregularity and Generalized Subdifferentials with Applications to Optimization
• Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
• Regularity Conditions and Optimality in Vector Optimization

This page was built for publication: Boundedness of certain sets of Lagrange multipliers in vector optimization