Search Results for author: Masoud Ahookhosh

Found 5 papers, 4 papers with code

Matrix Completion via Nonsmooth Regularization of Fully Connected Neural Networks

no code implementations15 Mar 2024 Sajad Faramarzi, Farzan Haddadi, Sajjad Amini, Masoud Ahookhosh

As such, the resulting regularized objective function becomes nonsmooth and nonconvex, i. e., existing gradient-based methods cannot be applied to our model.

Matrix Completion

Block Alternating Bregman Majorization Minimization with Extrapolation

1 code implementation9 Jul 2021 Le Thi Khanh Hien, Duy Nhat Phan, Nicolas Gillis, Masoud Ahookhosh, Panagiotis Patrinos

In this paper, we consider a class of nonsmooth nonconvex optimization problems whose objective is the sum of a block relative smooth function and a proper and lower semicontinuous block separable function.

Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization

1 code implementation4 Aug 2019 Masoud Ahookhosh, Le Thi Khanh Hien, Nicolas Gillis, Panagiotis Patrinos

We introduce and analyze BPALM and A-BPALM, two multi-block proximal alternating linearized minimization algorithms using Bregman distances for solving structured nonconvex problems.

Optimization and Control Numerical Analysis Numerical Analysis

Bregman forward-backward splitting for nonconvex composite optimization: superlinear convergence to nonisolated critical points

1 code implementation28 May 2019 Masoud Ahookhosh, Andreas Themelis, Panagiotis Patrinos

We introduce Bella, a locally superlinearly convergent Bregman forward-backward splitting method for minimizing the sum of two nonconvex functions, one of which satisfying a relative smoothness condition and the other one possibly nonsmooth.

Optimization and Control 90C06, 90C25, 90C26, 49J52, 49J53

Cannot find the paper you are looking for? You can Submit a new open access paper.