Approximate optimality conditions for minimax programming problems

DOI10.1080/02331930902878366zbMath1229.90256OpenAlexW2090638003MaRDI QIDQ3066917

Aparna Mehra, Anulekha Dhara

Publication date: 20 January 2011

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930902878366

zbMATH Keywords

Lagrange multipliersoptimality conditionslocally Lipschitz functionslimiting subdifferentialsproximal subdifferentials

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Optimality conditions for minimax problems (49K35)

Related Items (1)

A simple approach to optimality conditions in minmax programming

Cites Work

• Unnamed Item
• Metric regularity, tangent sets, and second-order optimality conditions
• Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
• Inequality systems and global optimization
• A Fuzzy Necessary Optimality Condition for Non-Lipschitz Optimization in Asplund Spaces
• Lagrange Multipliers and Optimality
• SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS
• Variational Analysis
• Necessary conditions for constrained optimization problems with semicontinuous and continuous data
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• Variational Analysis and Generalized Differentiation I
• A survey of subdifferential calculus with applications

This page was built for publication: Approximate optimality conditions for minimax programming problems