“…The notion of well-posedness for unconstrained optimization problems was defined by Tykhonov [34]. Following this concept (see, for instance, [12,28]), many types of well-posedness for variational problems were introduced, namely: wellposedness of Levitin-Polyak type [11,17,19,20], and extended well-posedness (for instance, [5,6,9,14,15,22,[25][26][27]38]), α-well-posedness [23,36], and L-well-posedness [21]. Also, this tool can be useful to investigate the connected problems, namely: fixedpoint problems [3], hemivariational inequality [37], variational inequality [2,7,18], equilibrium problems [4,8], Nash equilibrium [24], complementary problems [10], etc.…”