Bregman proximal point type algorithms for quasiconvex minimization

References

• Rockafellar RT. Monotone operators and proximal point algorithms. SIAM J Control Optim. 1976;14:877–898.
   Web of Science ®Google Scholar
• Bauschke HH, Combettes PL. Convex Analysis and Monotone Operators Theory in Hilbert Spaces. CMS Books in Mathematics. Springer-Verlag, second edition; 2017.
   Google Scholar
• Bonnel H, Iusem A, Svaiter BF. Proximal methods in vector optimization. SIAM J Optim. 2005;15:953–970.
   Web of Science ®Google Scholar
• Brito AS, Da Cruz Neto JX, Lopes JO, et al. Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints. J Optim Theory Appl. 2012;154:217–234.
   Web of Science ®Google Scholar
• Grad S-M, Lara F. Solving mixed variational inequalities beyond convexity. J Optim Theory Appl. 2021;190:565–580.
   Web of Science ®Google Scholar
• Iusem A, Sosa W. On the proximal point method for equilibrium problem in Hilbert spaces. Optimization. 2010;59(8):1259–1274.
   Web of Science ®Google Scholar
• Kaplan A, Tichatschke R. Proximal point methods and nonconvex optimization. J Global Optim. 1998;13:389–406.
   Web of Science ®Google Scholar
• Langenberg N, Tichatschke R. Interior proximal methods for quasiconvex optimization. J Global Optim. 2012;52:641–661.
   Web of Science ®Google Scholar
• Mijajlović N, Jacimović M. Proximal methods for solving quasi-variational inequalities. Comput Math Math Phys. 2015;55:1981–1985.
   Web of Science ®Google Scholar
• Pan S, Chen J-S. Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming. J Global Optim. 2007;39:555–575.
   Web of Science ®Google Scholar
• Papa Quiroz EA, Mallma Ramirez L, R.Oliveira P. An inexact proximal method for quasiconvex minimization. Eur J Oper Res. 2015;246:721–729.
   Web of Science ®Google Scholar
• Papa Quiroz EA, Oliveira PR. An extension of proximal methods for quasiconvex minimization on the nonnegative orthant. Eur J Oper Res. 2012;216:26–32.
   Web of Science ®Google Scholar
• Censor Y, Zenios SA. Proximal minimization algorithm with D-functions. J Optim Theory Appl. 1992;73:451–464.
   Web of Science ®Google Scholar
• Bregman L. The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming. USSR Comput Math Math Phys. 1967;34:200–217.
   Google Scholar
• Chen G, Teboulle M. Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM J Optim. 1993;3:538–543.
   Web of Science ®Google Scholar
• Hendrikx H, Bach F, Massoulié L. Dual-free stochastic decentralized optimization with variance reduction. Adv Neural Inf Process Syst. 2020;33:19455–19466.
   Google Scholar
• Kiwiel KC. Proximal minimization methods with generalized Bregman functions. SIAM J Control Optim. 1997;35:1142–1168.
   Web of Science ®Google Scholar
• Mukkamala MC, Westerkamp F, Laude E, et al. Bregman proximal framework fordeep linear neural networks, arXiv preprint arXiv:19100363; 2020.
   Google Scholar
• Bolte J, Sabach S, Teboulle M, et al. First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems. SIAM J Optim. 2018;28:2131–2151.
   Web of Science ®Google Scholar
• Mukkamala MC, Ochs P, Pock T, et al. Convex-concave backtracking for inertial Bregman proximal gradient algorithms in conconvex optimization. SIAM J Math Data Sci. 2020;2:658–682.
   Google Scholar
• Mukkamala MC, Fadili J, Ochs P. Global convergence of model function based Bregman proximal minimization algorithms. J Global Optim. 2021;2:1–29.
   Google Scholar
• Teboulle M. A simplified view of first order methods for optimization. Math Programm. 2018;170:67–96.
   Web of Science ®Google Scholar
• Poljak BT. Existence theorems and convergence of minimizing sequences in extremum problems with restrictions. Sov Math. 1966;7:72–75.
   Google Scholar
• Cambini A, Martein L. Generalized convexity and optimization. Berlin: Springer-Verlag; 2009.
   Google Scholar
• Vial JP. Strong convexity of sets and functions. J Math Econ. 1982;9:187–205.
   Web of Science ®Google Scholar
• Vial JP. Strong and weak convexity of sets and functions. Math Oper Res. 1983;8:231–259.
   Web of Science ®Google Scholar
• Jovanović M. A note on strongly convex and quasiconvex functions. Math Notes. 1996;60:584–585.
   Web of Science ®Google Scholar
• Lara F. On strongly quasiconvex functions: existence results and proximal point algorithms. J Optim Theory Appl. 2022;192:891–911.
   Web of Science ®Google Scholar
• Cambini R, Carosi L. Coercivity concepts and recession function in constrained problems. Int J Math Sci. 2003;2:83–96.
   Google Scholar
• Hadjisavvas N. Generalized convexity, generalized monotonicity and nonsmooth analysis. In: N. Hadjisavvas et al., editors. Handbook of generalized convexity and generalized monotonicity. Boston: Springer-Verlag; 2005. p. 465–500.
   Google Scholar
• Solodov M, Svaiter B. An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions. Math Oper Res. 2000;25:214–230.
   Web of Science ®Google Scholar
• Bauschke HH, Borwein JM, Combettes PL. Bregman monotone optimization algorithms. SIAM J Control Optim. 2003;42:596–636.
   Web of Science ®Google Scholar
• Langenberg N, Tichatschke R. Interior proximal methods for quasiconvex optimization. J Global Optim. 2011;52:641–661.
   Web of Science ®Google Scholar
• Burachik R, Iusem A. A generalized proximal point algorithm for the variational inequality problem in a Hilbert space. SIAM J Optim. 1998;8:197–216.
   Web of Science ®Google Scholar
• Cunha FGM, da Cruz Neto JX, Oliveira PR. Proximal point algorithm with a ϕ-divergence for quasiconvex programming. SIAM J Optim. 2010;59:777–792.
   Google Scholar
• Papa Quiroz EA. An extesion of the proximal point algorithm with Bregman distances on Hadamard manifolds proximal method for quasiconvex minimization. J Global Optim. 2013;56:43–59.
   Web of Science ®Google Scholar
• Papa Quiroz EA, Mallma Ramirez L, R.Oliveira P. An inexact algorithm with proximal distances for variational inequalities. RAIRO-Oper Res. 2018;52:159–176.
   Web of Science ®Google Scholar
• da S. Souza S, Oliveira PR, da Cruz Neto JX, et al. A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant. Eur J Oper Res. 2010;210:365–376.
   Google Scholar
• Papa Quiroz EA, Oliveira PR. Proximal point methods for quasiconvex and convex functions with Bregman distances on Hadamard manifolds. J Convex Anal. 2009;16:49–69.
   Web of Science ®Google Scholar
• Arjevani Y, Shalev-Shwartz S, Shamir O. On lower and upper bounds in smooth and strongly convex optimization. J Mach Learn Res. 2016;17:1–51.
   Web of Science ®Google Scholar
• Aybat NS, Fallah A, Gürbüzbalaban M, et al. Robust accelerated gradient methods for smooth strongly convex functions. SIAM J Optim. 2020;30:717–751.
   Web of Science ®Google Scholar
• Ghadimi S, Lan G. Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization I: a generic algorithmic framework. SIAM J Optim. 2012;22:1469–1492.
   Web of Science ®Google Scholar
• Hazan E, Kale S. Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization. J Mach Learn Res. 2014;15:2489–2512.
   Web of Science ®Google Scholar
• Xiao X. A unified convergence analysis of stochastic Bregman proximal gradient and extragradient methods. J Optim Theory Appl. 2021;188:605–227.
   Web of Science ®Google Scholar