5 citations · 8 across the 16 of their papers we have counts for
16 papers
Difference-of-Convex Optimization via Inexact Smoothing Descent Methods: Difference of High-Order Moreau Envelopes
Alireza Kabgani, Moslem Zamani, Masoud Ahookhosh
This paper studies difference-of-convex (DC) optimization problems through smoothing descent techniques. In particular, we introduce the difference of high-order Moreau envelopes (…
On the convergence rate of the Douglas-Rachford splitting algorithm
Hadi Abbaszadehpeivasti, Moslem Zamani
This work is concerned with the convergence rate analysis of the Douglas-Rachford splitting (DRS) method for finding a zero of the sum of two maximally monotone operators. We obtai…
Are Convex Optimization Curves Convex?
Guy Barzilai, Ohad Shamir, Moslem Zamani
In this paper, we study when we might expect the optimization curve induced by gradient descent to be \emph{convex} -- precluding, for example, an initial plateau followed by a sha…
Exact Convergence rate of the subgradient method by using Polyak step size
Moslem Zamani, François Glineur
This paper studies the last iterate of subgradient method with Polyak step size when applied to the minimization of a nonsmooth convex function with bounded subgradients. We show t…
On the Set of Possible Minimizers of a Sum of Convex Functions
Moslem Zamani, François Glineur, Julien M. Hendrickx
Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this work, we give an exact characterization o…
Exact convergence rate of the last iterate in subgradient methods
Moslem Zamani, François Glineur
We study the convergence of the last iterate in subgradient methods applied to the minimization of a nonsmooth convex function with bounded subgradients. We first introduce a proof…
Convergence rate analysis of randomized and cyclic coordinate descent for convex optimization through semidefinite programming
Hadi Abbaszadehpeivasti, Etienne de Klerk, Moslem Zamani
In this paper, we study randomized and cyclic coordinate descent for convex unconstrained optimization problems. We improve the known convergence rates in some cases by using the n…
Convergence rate analysis of the gradient descent-ascent method for convex-concave saddle-point problems
Moslem Zamani, Hadi Abbaszadehpeivasti, Etienne de Klerk
In this paper, we study the gradient descent-ascent method for convex-concave saddle-point problems. We derive a new non-asymptotic global convergence rate in terms of distance to…
The exact worst-case convergence rate of the alternating direction method of multipliers
Moslem Zamani, Hadi Abbaszadehpeivasti, Etienne de Klerk
Recently, semidefinite programming performance estimation has been employed as a strong tool for the worst-case performance analysis of first order methods. In this paper, we deriv…
Conditions for linear convergence of the gradient method for non-convex optimization
Hadi Abbaszadehpeivasti, Etienne de Klerk, Moslem Zamani
In this paper, we derive a new linear convergence rate for the gradient method with fixed step lengths for non-convex smooth optimization problems satisfying the Polyak-Lojasiewicz…
On the rate of convergence of the Difference-of-Convex Algorithm (DCA)
Hadi Abbaszadehpeivasti, Etienne de Klerk, Moslem Zamani
In this paper, we study the convergence rate of the DCA (Difference-of-Convex Algorithm), also known as the convex-concave procedure, with two different termination criteria that a…
The exact worst-case convergence rate of the gradient method with fixed step lengths for L-smooth functions
Hadi Abbaszadehpeivasti, Etienne de Klerk, Moslem Zamani
In this paper, we study the convergence rate of the gradient (or steepest descent) method with fixed step lengths for finding a stationary point of an -smooth function. We estab…
Error bounds and a condition number for the absolute value equations
Moslem Zamani, Milan Hladic
Absolute value equations, due to their relation to the linear complementarity problem, have been intensively studied recently. In this paper, we present error bounds for absolute v…
Proper efficiency, scalarization and transformation in multi-objective optimization: Unified approaches
Moslem Zamani, Majid Soleimani-damaneh
In this paper, we investigate the relationships between proper efficiency and the solutions of a general scalarization problem in multi-objective optimization. We provide some cond…
New bounds for nonconvex quadratically constrained quadratic programming
Moslem Zamani
In this paper, we study some bounds for nonconvex quadratically constrained quadratic programs. We propose two types of bounds for quadratically constrained quadratic programs, qua…
A new dual for quadratic programming and its applications
Moslem Zamani
The main outcomes of the paper are divided into two parts. First, we present a new dual for quadratic programs, in which, the dual variables are affine functions, and we prove stro…