A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence
This paper considers a conceptual version of a convex optimization algorithm which is based on replacing a convex optimization problem with the root-finding problem for the approximate sub-differential mapping which is solved by repeated projection onto the epigraph of conjugate function. Whilst the projection problem is not exactly solvable in finite space-time it can be approximately solved up to arbitrary precision by simple iterative methods, which use linear support functions of the epigraph. It seems therefore useful to study computational characteristics of the idealized version of this algorithm when projection on the epigraph is computed precisely to estimate the potential benefits for such development. The key results of this study are that the conceptual algorithm attains super-linear rate of convergence in general convex case, the rate of convergence becomes quadratic for objective functions forming super-set of strongly convex functions, and convergence is finite when objective function has sharp minimum. In all cases convergence is global and does not require differentiability of the objective.
KeywordsConvex optimization Conjugate function Approximate sub-differential Super-linear convergence Quadratic convergence Finite convergence Projection Epigraph
This work is supported by RF Ministry of Education and Science, project 1.7658.2017/6.7.
- 1.Shor, N.Z., Kiwiel, K.C., Ruszczynski, A.: Minimization Methods for Non-differentiable Functions. Springer Series in Computational Mathematics. Springer, Berlin (2012)Google Scholar
- 4.Hirriart-Uruty, J.-B., Lemarechal, C.: Convex Analysis and Minimization Algorithms II Advanced Theory and Bundle Methods. A Series of Comprehensive Studies in Mathematics. Springer-Verlag, Berlin (1993)Google Scholar
- 8.Nurminski, E.A.: Numerical Methods of Convex Optimization. Nauka, Moscow (1991). (in Russian)Google Scholar
- 10.Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 123–231 (2013)Google Scholar
- 12.Ferris, M.C.: Weak Sharp Minima and Penalty Functions in Mathematical Programming. Ph.D. Dissertation, University of Cambridge, Cambridge, UK (1988)Google Scholar
- 16.Vorontsova, E.A.: A projective separating plane method with additional clipping for non-smooth optimization. WSEAS Trans. Math. 13, 115–121 (2014)Google Scholar
- 17.Vorontsova, E.A.: Extended Separating Plane Algorithm and NSO-Solutions of PageRank Problem. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds) Discrete Optimization and Operations Research. 9th International Conference, DOOR 2016 Vladivostok, Russia, September 19-23, 2016. Proceedings. Lecture Notes in Computer Science, vol. 9869 pp. 547–560. Springer, Heidelberg (2016)Google Scholar
- 19.Nurminski, E.A.: Multiple Cuts in Separating Plane Algorithms. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds) Discrete Optimization and Operations Research. In: 9th International Conference, DOOR 2016 Vladivostok, Russia, September 19-23, 2016. Proceedings. Lecture Notes in Computer Science, vol. 9869 pp. 430–440. Springer, Heidelberg (2016)Google Scholar