Yura Malitsky

Yura Malitsky

Auto-generated profile, based on publicly available information

Yura Malitsky

Institute for Numerical and Applied Mathematics University of Göttingen 37083 Göttingen Germany

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2015 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
YMYu. Malitsky
Yu. Malitsky
This paper is concerned with some new projection methods for solving variational inequality problems with monotone and Lipschitz-continuous mapping in Hilbert space. First, we propose the projected reflected gradient algorithm with a constant stepsize. It is similar to the projected gradient method, namely, the method requires only one projection onto the feasible set and only one value of the mapping per iteration. This distinguishes our method from most other projection-type methods for variational inequalities with monotone mapping. Also we prove that it has R-linear rate of convergence under the strong monotonicity assumption. The usual drawback of algorithms with constant stepsize is the requirement to know the Lipschitz constant of the mapping. To avoid this, we modify our first algorithm so that the algorithm needs at most two projections per iteration. In fact, our computational experience shows that such cases with two projections are very rare. This scheme, at least theoretically, seems to be very effective. All methods are shown to be globally convergent to a solution of the variational inequality. Preliminary results from numerical experiments are quite promising.

1 January 2020 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
YMYura Malitsky
Yura Malitsky
MTMatthew K. Tam
Matthew K. Tam
In this work, we propose a simple modification of the forward-backward splitting method for finding a zero in the sum of two monotone operators. Our method converges under the same assumptions as T...

31 July 2019 in Mathematical Programming
Verified
Journal Article
Closed access
PDF file
YMYura Malitsky
Yura Malitsky

1 January 2018 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
YMYura Malitsky
Yura Malitsky
TPThomas Pock
Thomas Pock
The paper proposes a linesearch for a primal-dual method. Each iteration of the linesearch requires an update of only the dual (or primal) variable. For many problems, in particular for regularized least squares, the linesearch does not require any additional matrix-vector multiplications. We prove convergence of the proposed method under standard assumptions. We also show an ergodic $O(1/N)$ rate of convergence for our method. In the case when one or both of the prox-functions are strongly convex, we modify our basic method to get a better convergence rate. Finally, we propose a linesearch for a saddle-point problem with an additional smooth term. Several numerical experiments confirm the efficiency of our proposed methods.

1 March 2014 in Cybernetics and Systems Analysis
Verified
Journal Article
Closed access
PDF file
YMYu. V. Malitsky
Yu. V. Malitsky
VSVolodymyr Semenov
Volodymyr Semenov

31 January 2014 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
YMYu. V. Malitsky
Yu. V. Malitsky
VSVolodymyr Semenov
Volodymyr Semenov