A Two-Step Proximal Point Algorithm for Nonconvex Equilibrium Problems with Applications to Fractional Programming

We present a proximal point type algorithm tailored for tackling pseudomonotone equilibrium problems in a Hilbert space which are not necessarily convex in the second argument of the involved bifunction. Motivated by the extragradient algorithm, we propose a two-step method and we prove that the gen...

Full description

Saved in:
Bibliographic Details
Published in:Journal of global optimization 2024-11, Vol.90 (3), p.755-779
Main Authors: Iusem, Alfredo, Lara, Felipe, Marcavillaca, Raúl T., Yen, Le Hai
Format: Article
Language:English
Subjects:
Algorithms
Computer Science
Equilibrium
Hilbert space
Mathematical programming
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Ordinary differential equations
Real Functions
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a proximal point type algorithm tailored for tackling pseudomonotone equilibrium problems in a Hilbert space which are not necessarily convex in the second argument of the involved bifunction. Motivated by the extragradient algorithm, we propose a two-step method and we prove that the generated sequence converges strongly to a solution of the nonconvex equilibrium problem under mild assumptions and, also, we establish a linear convergent rate for the iterates. Furthermore, we identify a new class of functions that meet our assumptions, and we provide sufficient conditions for quadratic fractional functions to exhibit strong quasiconvexity. Finally, we perform numerical experiments comparing our algorithm against two alternative methods for classes of nonconvex mixed variational inequalities.
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-024-01419-8