Fetching the paper…
Reading the bibliography…
Counterexamples to some old-standing optimization problems in the smooth convex coercive setting are provided.
1911
Earlier work this paper cites.
Sulle stratificazioni convesse
de Finetti, B. (1949) · 1949
Earlier work this paper cites.
Fenchel, W., Convex Cones, Sets and Functions, Mimeographed lecture note, Princeton University, 1951
1951
Earlier work this paper cites.
Bernstein polynomials
Lorentz, G. G. (1954) · 1954
Earlier work this paper cites.
Convex functions on convex polytopes
Gale, D., Klee, V. and Rockafellar, R. T. (1968) · 1968
Earlier work this paper cites.
Convex analysis (Vol. 28). Princeton university press
Rockafellar, R. T. (1970) · 1970
Earlier work this paper cites.
On search directions for minimization algorithms
Powell, M. J. (1973) · 1973
Earlier work this paper cites.
Auslender, A., Optimisation Méthodes Numériques, Masson, Paris, France, 1976
1976
Earlier work this paper cites.
Kannai, Y. (1977). Concavifiability and constructions of concave utility functions. Journal of mathematical Economics, 4(1), 1–56
1977
Earlier work this paper cites.
Crouzeix, J.-P. (1980). Conditions for convexity of quasiconvex functions. Mathematics of Operations Research, 5(1), 120-125
1980
Earlier work this paper cites.
Problem Complexity and Method Efficiency in Optimization
A. S. Nemirovsky and D. B. Yudin (1983) · 1983
Earlier work this paper cites.
Differential inclusions: set-valued maps and viability theory. Springer
Aubin, J.-P. and Cellina, A. (1984) · 1984
Earlier work this paper cites.
Sur les trajectoires du gradient d’une fonction analytique
Łojasiewicz, S. (1984), · 1984
Earlier work this paper cites.
Problèmes rencontrés dans mon parcours mathématique : un bilan
Thom, R. (1989) · 1989
Cited alongside, same era.
Manselli, P., and Pucci, C. (1991). Maximum length of steepest descent curves for quasi-convex functions. Geometriae Dedicata, 38(2), 211–227
1991
Cited alongside, same era.
Convex bodies: the Brunn-Minkowski theory (No. 151)
Schneider, R. (1993) · 1993
Cited alongside, same era.
Nesterov, Y., and Nemirovskii, A. (1994). Interior-point polynomial algorithms in convex programming (Vol. 13). Siam
1994
Cited alongside, same era.
Torralba, D., Convergence épigraphique et changements d’échelle en analyse variationnelle et optimisation, Ph.D. Thesis (Université Montpellier 2, 1996)
1996
Cited alongside, same era.
Boyd, S., and Vandenberghe, L. (2004). Convex optimization. Cambridge university press
2004
Later among the works it cites.
Ma, T. W. (2009). Higher chain formula proved by combinatorics. The electronic journal of combinatorics, 16(1)
2009
Later among the works it cites.
Characterizations of Łojasiewicz inequalities: subgradient flows, talweg, convexity
Bolte, J., Daniilidis, A., Ley, O., and Mazet, L. (2010) · 2010
Later among the works it cites.
Daniilidis, A., Ley, O., and Sabourau, S. (2010). Asymptotic behaviour of self-contracted planar curves and gradient orbits of convex functions. Journal de matéhmatiques pures et appliquées, 94(2), 183–199
2010
Later among the works it cites.
Bauschke, H. H., and Combettes, P. L. (2011). Convex analysis and monotone operator theory in Hilbert spaces (Vol. 408). New York: Springer
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Alvarez D. F. and Pérez C., J. M. (1998) · 1998
Cited alongside, same era.
Auslender, A. (1999). Penalty and barrier methods: a unified framework. SIAM Journal on Optimization, 10(1), 211–230
1999
Cited alongside, same era.
Golub, G. H., Hansen, P. C., and O’Leary, D. P. (1999). Tikhonov regularization and total least squares. SIAM Journal on Matrix Analysis and Applications, 21(1), 185–194
1999
Cited alongside, same era.
Proof of the gradient conjecture of R. Thom
Kurdyka, K., Mostowski, T. and Parusinski, A. (2000) · 2000
Cited alongside, same era.
Mirror descent and nonlinear projected subgradient methods for convex optimization
Beck, A. and Teboulle, M. (2003) · 2003
Cited alongside, same era.
Bolte, J., and Teboulle, M. (2003). Barrier operators and associated gradient-like dynamical systems for constrained minimization problems. SIAM journal on control and optimization, 42(4), 1266-1292
2003
Cited alongside, same era.
Nesterov, Y. (2003). Lectures on convex optimization (Vol. 137). Springer
2003
Cited alongside, same era.
Borwein, J. M., Li, G., and Yao, L. (2014). Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets. SIAM Journal on Optimization, 24(1), 498–527
2014
Later among the works it cites.
Bertsekas, D. P., Scientific, A. (2015). Convex optimization algorithms. Belmont: Athena Scientific
2015
Later among the works it cites.
Coordinate descent algorithms
Wright, S. J. (2015) · 2015
Later among the works it cites.
A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
Bauschke, H. H., Bolte, J. and Teboulle, M. (2016) · 2016
Later among the works it cites.
Chen, C., He, B., Ye, Y., and Yuan, X. (2016). The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent. Mathematical Programming, 155(1-2), 57–79
2016
Later among the works it cites.
Beck, A. (2017). First-order methods in optimization (Vol. 25). SIAM
2017
Later among the works it cites.
Bolte, J., Nguyen, T. P., Peypouquet, J., and Suter, B. W. (2017). From error bounds to the complexity of first-order descent methods for convex functions. Mathematical Programming, 165(2), 471–507
2017
Later among the works it cites.
On the convergence of block coordinate descent type methods
Beck, A. and Tetruashvili, L. (2013) · 2060
Closest in time.