Curiosities and counterexamples in smooth convex optimization

Jérôme Bolte and Edouard Pauwels

No 20-1080, TSE Working Papers from Toulouse School of Economics (TSE)

Abstract: Counterexamples to some old-standing optimization problems in the smooth convex coercive setting are provided. We show that block-coordinate, steepest descent with exact search or Bregman descent methods do not generally converge. Other failures of various desirable features are established: directional convergence of Cauchy's gradient curves, convergence of Newton's flow,finite length of Tikhonov path, convergence of central paths, or smooth Kurdyka- Lojasiewicz inequality. All examples are planar. These examples are based on general smooth convex interpolation results. Given a decreasing sequence of positively curved Ck convex compact sets in the plane, we provide a level set interpolation of a Ck smooth convex function where k 2 is arbitrary. If the intersection is reduced to one point our interpolant has positive denite Hessian, otherwise it is positive denite out of the solution set. Further- more, given a sequence of decreasing polygons we provide an interpolant agreeing with the vertices and whose gradients coincide with prescribed normals.

Date: 2020-03
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.tse-fr.eu/sites/default/files/TSE/docu ... 2020/wp_tse_1080.pdf Full Text (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:tse:wpaper:124147

Access Statistics for this paper

More papers in TSE Working Papers from Toulouse School of Economics (TSE) Contact information at EDIRC.
Bibliographic data for series maintained by ().