PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 16, 20240 citationsOpen Access

Optimality conditions at infinity for nonsmooth minimax programming

View Full Paper
NTNguyen Van TuyenKBKwan Deok BaeDKDo Sang Kim

Key Points

Key points are not available for this paper at this time.

Abstract

This paper is devoted to study of optimality conditions at infinity in nonsmooth minimax programming problems and applications. By means of the limiting subdifferential and normal cone at infinity, we dirive necessary and sufficient optimality conditions of Karush--Kuhn--Tucker type for nonsmooth minimax programming problems with constraint. The obtained results are applied to a nonsmooth vector optimization problem.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Tuyen et al. (2024) studied this question.

synapsesocial.com/papers/68e69d5db6db643587622b3ahttps://doi.org/10.48550/arxiv.2405.09869
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Optimality Conditions at Infinity in Semialgebraic Vector Optimization2025 · 1 citations
  2. 2On Optimality Conditions for Mathematical Programming Problems Based on Strong Subdifferentials2026
  3. 3Optimality conditions and subdifferential calculus for infinite sums of functions2024
  4. 4Coderivatives at Infinity of Set-Valued Mappings with Applications to Optimization2026
  5. 5Optimality conditions for differentiable linearly constrained pseudoconvex programs2024 · 1 citations