Lagrange multipliers theorem and saddle point optimality criteria in mathematical programming

DOI10.1016/j.jmaa.2005.10.038zbMath1102.90069MaRDI QIDQ852755

Duong Minh Duc, Nguyen Dinh Hoang, Lam Hoang Nguyen

Publication date: 15 November 2006

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2005.10.038

zbMATH Keywords

mathematical programming; saddle point; Lagrange multipliers theorem

Mathematics Subject Classification ID

90C46: Optimality conditions and duality in mathematical programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized differentials of nonsmooth functions, and necessary conditions for an extremum
• A generalized derivative for calm and stable functions
• On incomplete Lagrange function and saddle point optimality criteria in mathematical programming
• An abstract extremal principle with applications to welfare economics
• A Lagrange multiplier rule with small convex-valued subdifferentials for nonsmooth problems of mathematical programming involving equality and nonfunctional constraints
• Multiplier Rules Under Mixed Assumptions of Differentiability and Lipschitz Continuity
• Necessary Conditions in Nonsmooth Optimization
• Shrinking generalized gradients
• Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
• Lagrange Multipliers for Nonconvex Generalized Gradients with Equality, Inequality, and Set Constraints
• Necessary Suboptimality and Optimality Conditions via Variational Principles
• Lagrange multipliers for functions derivable along directions in a linear subspace
• Implicit Functions and Optimization Problems without Continuous Differentiability of the Data