output
20112026
most citedGraph Self-Supervised Learning: A Survey

518 citations

Showing math.OCShow all

64 papers · 1 filter

math.OC2024

Explicit Convergence Rate of The Proximal Point Algorithm under R-Continuity

Ba Khiet Le, Michel Théra

The paper provides a thorough comparison between R-continuity and other fundamental tools in optimization such as metric regularity, metric subregularity and calmness. We show that…

math.OC2024★ 2 cited

Doubly relaxed forward-Douglas--Rachford splitting for the sum of two nonconvex and a DC function

Minh N. Dao, Tan Nhat Pham, Phan Thanh Tung

In this paper, we consider a class of structured nonconvex nonsmooth optimization problems whose objective function is the sum of three nonconvex functions, one of which is express…

math.OC2024★ 7 cited

Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions

Tan Nhat Pham, Minh N. Dao, Andrew Eberhard +1

In this paper, we develop a splitting algorithm incorporating Bregman distances to solve a broad class of linearly constrained composite optimization problems, whose objective func…

math.OC2022

Weak and strong convergence of an inertial proximal method for solving bilevel monotone equilibrium problems

AÏcha Balhag, Zakaria Mazgouri, Michel Théra

In this paper, we introduce an inertial proximal method for solving a bilevel problem involving two monotone equilibrium bifunctions in Hilbert spaces. Under suitable conditions an…

math.OC2022★ 2 cited

Locating Theorems of Differential Inclusions Governed by Maximally Monotone Operators

Minh N. Dao, Hassan Saoud, Michel Théra

In this paper, we are interested in studying the asymptotic behavior of the solutions of differential inclusions governed by maximally monotone operators. In the case where the LaS…

math.OC2022★ 6 cited

A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems

Tan Nhat Pham, Minh N. Dao, Rakibuzzaman Shah +3

In this paper, we consider a class of structured nonconvex nonsmooth optimization problems, in which the objective function is formed by the sum of a possibly nonsmooth nonconvex f…