Abstract
In this paper, we present DC (difference of convex functions) auxiliary principle methods for solving lexicographic equilibrium problems. Under the strongly monotone and Lipchitz-type assumptions of the cost bifunction, we study the convergence of the sequence generated by the proposed algorithms to a unique solution of the considered lexicographic equilibrium problem. Moreover, we also study the asymptotic behavior of the algorithm for solving the considered problem under the presence of computational errors. Finally, we give some numerical experiments to illustrate the behaviour of the proposed algorithms and provide their comparison with some known algorithms.
| Original language | English |
|---|---|
| Pages (from-to) | 129-153 |
| Number of pages | 25 |
| Journal | Journal of Global Optimization |
| Volume | 85 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 2023 |
| Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
Keywords
- Affine variational inequalities
- Auxiliary principle
- DC functions
- Lexicographic equilibrium problems
- Lipschitz-type condition
- Strongly monotonicity
ASJC Scopus subject areas
- Business, Management and Accounting (miscellaneous)
- Computer Science Applications
- Control and Optimization
- Management Science and Operations Research
- Applied Mathematics
Fingerprint
Dive into the research topics of 'DC auxiliary principle methods for solving lexicographic equilibrium problems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver