We study a proximal point type method for approximating solutions to equilibrium problems generated by pseudomonotone and strongly quasiconvex bifunctions over Hadamard manifolds, that is complete simply connected Riemannian manifolds of nonpositive sectional curvature. Next to the usual proximal step, the method we consider also incorporates an inertia step together with a subsequent over-relaxation, the latter of which is treated in the context of Hadamard manifolds, to our knowledge, for the first time. Making use of a quantitative approach towards such proximal methods for strongly quasiconvex optimization developed by the authors in previous work, we in particular provide effective arguments for the convergence of the method, yielding explicit, fast and very uniform rates of convergence for the distance of the iterates towards the solution. These results extend previous work by Grad, Lara and Marcavillaca on such a method over finite-dimensional Euclidean spaces for the first time to a nonlinear setting, with the quantitative estimates already being novel in the Euclidean case. In particular, our effective approach allows for a fine-grained view on the assumptions on the surrounding objects, so that we are able to either weaken or even fully discharge some previous assumptions.
In this paper, we introduce a new double inertial Mann-type iterative algorithm for approximating
a common solution of a demigeneralized fixed point problem and a monotone variational inequality
problem in reflexive Banach spaces. Our method is developed in the framework of Bregman distances
generated by a Legendre fun...
G. Ezugorie· Applicable Nonlinear Analysi...· 0 citations
The quadratic optimization-free (QO-free) method is a class of powerful and effective algorithms for solving nonlinearly constrained optimization problems in Euclidean spaces. The aim of the present work is to extend this method to solve optimization problems on manifolds with additional equality and inequality constra...
Chun-Ming Tang, Hao He, Wen Huang et al.· 0 citations
In this paper, we consider a class of multiblock nonconvex nonsmooth optimization problems, which covers many applications such as the analysis of pre-earthquake anomalies and machine learning. To solve this class of problems, we propose the inertial block proximal linearized method with two-phase adaptive momentum (IB...
We study an inexact interior-point method for nonsmooth, nonconvex optimization problems with conic inequality constraints. The objective function is given by the sum of a smooth, possibly nonconvex term and a convex, possibly nonsmooth term with a computable proximal mapping. The constraints are formulated by means of...
In this work, we develop an accurate numerical homogenization framework for computing effective Hamiltonians of quasiperiodic Hamilton--Jacobi equations (QHJEs) with convex Hamiltonians of the form $H(x,p) = |p|^k/{k}-f(x), ~k>1$, where $f$ is quasiperiodic. Computing effective Hamiltonians in the quasiperiodic setting...
Kai Jiang, Meng Li, Juan Zhang et al.· 0 citations
In this thesis, two novel iterative algorithms are proposed and analyzed to obtain a common solution to generalized nonlinear variational inequality, equilibrium, and fixed-point problems for nonexpansive mappings in real Hilbert spaces. The first algorithm is developed to approximate a common solution of these three c...
Jackson Kalule· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.