Saved in:
Bibliographic Details
Main Authors: Wang, Ruyu, Zhao, Wenling, Song, Daojin, Hu, Yaozhong
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2401.06351
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914639301836800
author Wang, Ruyu
Zhao, Wenling
Song, Daojin
Hu, Yaozhong
author_facet Wang, Ruyu
Zhao, Wenling
Song, Daojin
Hu, Yaozhong
contents This study delves into equilibrium problems, focusing on the identification of finite solutions for feasible solution sequences. We introduce an innovative extension of the weak sharp minimum concept from convex programming to equilibrium problems, coining this as weak sharpness for solution sets. Recognizing situations where the solution set may not exhibit weak sharpness, we propose an augmented mapping approach to mitigate this limitation. The core of our research is the formulation of augmented weak sharpness for the solution set, a comprehensive concept that encapsulates both weak sharpness and strong non-degeneracy within feasible solution sequences. Crucially, we identify a necessary and sufficient condition for the finite termination of these sequences under the premise of augmented weak sharpness for the solution set in equilibrium problems. This condition significantly broadens the scope of existing literature, which often assumes the solution set to be weakly sharp or strongly non-degenerate, especially in the context of mathematical programming and variational inequality problems. Our findings not only shed light on the termination conditions in equilibrium problems but also introduce a less stringent sufficient condition for the finite termination of various optimization algorithms. This research, therefore, makes a substantial contribution to the field by enhancing our understanding of termination conditions in equilibrium problems and expanding the applicability of established theories to a wider range of optimization scenarios.
format Preprint
id arxiv_https___arxiv_org_abs_2401_06351
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle The augmented weak sharpness of solution sets in equilibrium problems
Wang, Ruyu
Zhao, Wenling
Song, Daojin
Hu, Yaozhong
Optimization and Control
90C31, 49J40, 49K40, 91A10, 49M37
This study delves into equilibrium problems, focusing on the identification of finite solutions for feasible solution sequences. We introduce an innovative extension of the weak sharp minimum concept from convex programming to equilibrium problems, coining this as weak sharpness for solution sets. Recognizing situations where the solution set may not exhibit weak sharpness, we propose an augmented mapping approach to mitigate this limitation. The core of our research is the formulation of augmented weak sharpness for the solution set, a comprehensive concept that encapsulates both weak sharpness and strong non-degeneracy within feasible solution sequences. Crucially, we identify a necessary and sufficient condition for the finite termination of these sequences under the premise of augmented weak sharpness for the solution set in equilibrium problems. This condition significantly broadens the scope of existing literature, which often assumes the solution set to be weakly sharp or strongly non-degenerate, especially in the context of mathematical programming and variational inequality problems. Our findings not only shed light on the termination conditions in equilibrium problems but also introduce a less stringent sufficient condition for the finite termination of various optimization algorithms. This research, therefore, makes a substantial contribution to the field by enhancing our understanding of termination conditions in equilibrium problems and expanding the applicability of established theories to a wider range of optimization scenarios.
title The augmented weak sharpness of solution sets in equilibrium problems
topic Optimization and Control
90C31, 49J40, 49K40, 91A10, 49M37
url https://arxiv.org/abs/2401.06351