Abstract
In this paper we present an extension of the proximal point algorithm with Bregman distances to solve constrained minimization problems with quasiconvex and convex objective function on Hadamard manifolds. The proposed algorithm is a modified and extended version of the one presented in Papa Quiroz and Oliveira (J Convex Anal 16(1): 49–69, 2009). An advantage of the proposed algorithm, for the nonconvex case, is that in each iteration the algorithm only needs to find a stationary point of the proximal function and not a global minimum. For that reason, from the computational point of view, the proposed algorithm is more practical than the earlier proximal method. Another advantage, for the convex case, is that using minimal condition on the problem data as well as on the proximal parameters we get the same convergence results of the Euclidean proximal algorithm using Bregman distances.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bregman L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7(3), 200–217 (1967)
Burachik R.S., Iusem A.: Generalized proximal point algorithm for the variational inequality problem in Hilbert space. SIAM J. Optim. 8, 197–216 (1998)
Censor Y., Lent A.: An iterative row-action method for interval convex programming. J. Optim. Theory Appl. 34(3), 321–353 (1981)
Chen J.S., Pan S.H.: Proximal-like algorithm using the quasi D-function for convex second-order cone programming. J. Optim. Theory Appl. 138, 95–113 (2008)
Chen G., Teboulle M.: Convergence analysis of proximal-like minimization algorithm using Bregman functions. SIAM J. Optim. 3, 538–543 (1993)
Censor Y., Zenios A.: Proximal minimization algorithms with D-functions. J. Optim. Theory Appl. 73(3), 451–464 (1992)
do Carmo M.P.: Riemannian Geometry. Bikhausen, Boston (1992)
Doljansky M., Teboulle M.: An interior proximal algorithm and the exponential multiplier method for semidefinite programming. SIAM J. Optim. 9, 1–13 (1998)
Kiwiel K.C.: Proximal minimization methods with generalized Bregman functions. SIAM J. Control Optim. 35, 1142–1168 (1997)
Papa Quiroz E.A., Oliveira P.R.: Proximal point methods for quasiconvex and convex functions with Bregman distances on Hadamard manifolds. J. Convex Anal. 16(1), 49–69 (2009)
Papa Quiroz, E.A., Oliveira, P.R.: Full convergence of the proximal point method for quasiconvex functions on Hadamard manifolds. To appear in ESAIM-COCV-Control, Optimization and Calculus of Variations (2011)
Rapcsák T.: Smooth Nonlinear Optimization. Kluwer Academic Publishers, Dordrecht (1997)
Sakai T.: Riemannian Geometry. American Mathematical Society, Providence (1996)
Udriste C.: Convex Function and Optimization Methos on Riemannian Manifolds. Kluwer Academic Publishers, Dordrecht (1994)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Papa Quiroz, E.A. An extension of the proximal point algorithm with Bregman distances on Hadamard manifolds. J Glob Optim 56, 43–59 (2013). https://doi.org/10.1007/s10898-012-9996-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-012-9996-y