Calm local optimality for couple-constrained minimax problems

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Ma, Xiaoxiao, Ye, Jane
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914075509784576
author Ma, Xiaoxiao
Ye, Jane
author_facet Ma, Xiaoxiao
Ye, Jane
contents Recently, a new local optimality concept for minimax problems, termed calm local minimax points, has been introduced. In this paper, we extend this concept to a general class of nonsmooth, nonconvex nonconcave minimax problems with coupled constraints, where the inner feasible set depends on the outer variable. We derive comprehensive first-order and second-order necessary and sufficient optimality conditions for calm local minimax points in the setting of nonsmooth, nonconvex nonconcave minimax problems with coupled constraints. Furthermore, we show how these conditions apply to problems with set constraints, as well as those involving systems of inequalities and equalities. By unifying existing formulations that often rely on stronger assumptions within the framework of calm local minimax points, we show that our results hold under weaker assumptions than those previously required.
format Preprint
id arxiv_https___arxiv_org_abs_2510_03861
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Calm local optimality for couple-constrained minimax problems
Ma, Xiaoxiao
Ye, Jane
Optimization and Control
Recently, a new local optimality concept for minimax problems, termed calm local minimax points, has been introduced. In this paper, we extend this concept to a general class of nonsmooth, nonconvex nonconcave minimax problems with coupled constraints, where the inner feasible set depends on the outer variable. We derive comprehensive first-order and second-order necessary and sufficient optimality conditions for calm local minimax points in the setting of nonsmooth, nonconvex nonconcave minimax problems with coupled constraints. Furthermore, we show how these conditions apply to problems with set constraints, as well as those involving systems of inequalities and equalities. By unifying existing formulations that often rely on stronger assumptions within the framework of calm local minimax points, we show that our results hold under weaker assumptions than those previously required.
title Calm local optimality for couple-constrained minimax problems
topic Optimization and Control
url https://arxiv.org/abs/2510.03861