An Interior Proximal Method with Proximal Distances for Quasimonotone Equilibrium Problems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We introduce an interior proximal point algorithm with proximal distances to solve quasimonotone Equilibrium problems defined on convex sets. Under adequate assumptions, we prove that the sequence generated by the algorithm converges to a solution of the problem and for a broad class of proximal distances the rate of convergence of the sequence is linear or superlinear.

Original languageEnglish
Title of host publicationModelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 4th International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences - MCO 2021
EditorsHoai An Le Thi, Hoai Minh Le, Hoai An Le Thi, Tao Pham Dinh
PublisherSpringer Science and Business Media Deutschland GmbH
Pages3-15
Number of pages13
ISBN (Print)9783030926656
DOIs
StatePublished - 2022
Externally publishedYes
Event4th International conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, MCO 2021 - Hanoi, Viet Nam
Duration: 11 Dec 202113 Dec 2021

Publication series

NameLecture Notes in Networks and Systems
Volume363 LNNS
ISSN (Print)2367-3370
ISSN (Electronic)2367-3389

Conference

Conference4th International conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, MCO 2021
Country/TerritoryViet Nam
CityHanoi
Period11/12/2113/12/21

Bibliographical note

Publisher Copyright:
© 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Keywords

  • Proximal algorithms
  • Proximal distances
  • Quasimonotone bifunctions

Cite this