activity
20042026
most citedImproved bounds for the crossing numbers of K_m,n and K_n

66 citations · 187 across the 28 of their papers we have counts for

collaborators
Showing 2022 · math.OCShow all

5 papers · 2 filters

math.OC2022

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…

math.OC2022

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…

math.OC2022

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…

math.OC2022

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…

math.OC2022

Construction of multivariate polynomial approximation kernels via semidefinite programming

Felix Kirschner, Etienne de Klerk

In this paper we construct a hierarchy of multivariate polynomial approximation kernels via semidefinite programming. We give details on the implementation of the semidefinite prog…