Optimality conditions at infinity for nonsmooth minimax programming problems with some applications

DOI10.1007/S10957-025-02652-1MaRDI QIDQ6998498zbMATH OpenFDO

Authors Nguyen Van Tuyen, Kwan Deok Bae, Do Sang Kim

Publication date 11 April 2025

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10957-025-02652-1

zbMATH Keywords

limiting subdifferential at infinityminimax programmingnormal cone at infinityoptimality at infinityrobust minimax optimizationvector optimization

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Optimality conditions for minimax problems (49K35) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Minimax problems in mathematical programming (90C47)

Cites work

• A method for establishing optimality conditions for a nonsmooth vector-valued minimax problem
• Clarke's tangent cones, subgradients, optimality conditions and the Lipschitzness at infinity
• Constrained minimax for a vector-valued function
• Convex analysis and global optimization
• Existence of solution to \(n\)-person noncooperative games and minimax regret equilibria with set payoffs
• scientific article; zbMATH DE number 51950 (Why is no real title available?)
• scientific article; zbMATH DE number 3634008 (Why is no real title available?)
• Isolated efficiency in nonsmooth semi-infinite multi-objective programming
• Maximax and minimax rearrangement optimization problems
• Minimax and applications
• Minimax programming as a tool for studying robust multi-objective optimization problems
• Minimax representation of nonexpansive functions and application to zero-sum recursive games
• Nonconvex separation theorems and some applications in vector optimization
• Nondifferentiable minimax programming problems with applications
• On error bounds and optimality conditions at infinity
• On the variational principle
• Optimality and duality for robust multiobjective optimization problems
• Optimality conditions and sensitivity analysis in parametric convex minimax programming
• Optimality conditions and sensitivity analysis in parametric nonconvex minimax programming
• Optimality conditions for nondifferentiable minimax programs and vector optimization problems
• Optimality Conditions for Nonsmooth Nonconvex-Nonconcave Min-Max Problems and Generative Adversarial Networks
• Pareto optimality, game theory and equilibria
• Proper efficiency and the theory of vector maximization
• Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints
• Subdifferentials at infinity and applications in optimization
• Towards a new era in subdifferential analysis?
• Variational Analysis
• Variational analysis and applications

Cited in

(3)

• Optimality conditions and solution analysis at infinity for nonsmooth optimization problems
• Weak sharp minima at infinity and solution stability in mathematical programming via asymptotic analysis
• Directional subdifferentials at infinity and their applications

This page was built for publication: Optimality conditions at infinity for nonsmooth minimax programming problems with some applications

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