SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS

DOI10.1142/S0217595908001729zbMath1190.90270OpenAlexW2050509364MaRDI QIDQ3520507

Aparna Mehra, Anulekha Dhara

Publication date: 26 August 2008

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595908001729

zbMATH Keywords

epi-convergence\(\varepsilon\)-subdifferentialssequential dualityepigraph of conjugate functionsnonsmooth minimax program

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46)

Related Items (1)

Approximate optimality conditions for minimax programming problems

Cites Work

• Unnamed Item
• Inequality systems and optimization
• Liberating the subgradient optimality conditions from constraint qualifications
• Duality for a class of nondifferentiable mathematical programming problems
• Necessary conditions and sufficient conditions for static minmax problems
• Duality for a class of minmax and inexact programming problem
• Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
• Inequality systems and global optimization
• Bounded sets of KKT multipliers in vector optimization
• Characterizations of solution sets of convex vector minimization problems
• Lagrange Multipliers and Optimality
• Variational Analysis
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• Efficient and Accurate Parallel Inversion of the Gamma Distribution

This page was built for publication: SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS