Approximate optimality conditions for minimax programming problems

DOI10.1080/02331930902878366MaRDI QIDQ3066917zbMATH OpenOpenAlexFDO

Authors Anulekha Dhara, Aparna Mehra

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

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

Recommendations

• The optimality conditions for approximate solutions of quasiconvex programming problems
• Necessary optimality conditions for minimax programming problems with mathematical constraints
• Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
• The optimality conditions for generalized minimax programming
• scientific article; zbMATH DE number 592636

Cites work

• scientific article; zbMATH DE number 1266748 (Why is no real title available?)
• A fuzzy necessary optimality condition for non-Lipschitz optimization in Asplund spaces
• A survey of subdifferential calculus with applications
• Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
• Inequality systems and global optimization
• Lagrange Multipliers and Optimality
• Metric regularity, tangent sets, and second-order optimality conditions
• Necessary conditions for constrained optimization problems with semicontinuous and continuous data
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS
• Variational Analysis
• Variational Analysis and Generalized Differentiation I

Cited in

(13)

• scientific article; zbMATH DE number 3942321 (Why is no real title available?)
• scientific article; zbMATH DE number 4078115 (Why is no real title available?)
• Minimizing Condition Number via Convex Programming
• Optimality Conditions for Approximate Pareto Minimality
• Sufficient optimality and sensitivity analysis of a parameterized min-max programming
• Optimality conditions for minimax programming of analytic functions
• scientific article; zbMATH DE number 502980 (Why is no real title available?)
• Optimality conditions, approximate stationarity, and applications -- a story beyond Lipschitzness
• Necessary optimality conditions for average cost minimization problems
• scientific article; zbMATH DE number 3849019 (Why is no real title available?)
• A simple approach to optimality conditions in minmax programming
• Comments on properties of the minmax solutions in goal programming
• Finding approximate solutions to minimax problems

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

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