Supplementary material: Continuation of Nesterov's Smoothing for Regression with Structured Sparsity in High-Dimensional Neuroimaging

If we view knowledge as a duality then by implication, all knowledge is to some degree both hard and soft: it is simply that the balance between the two varies.. This approach need

The formal proof carried out in the system Coq - from the axiomatization of real numbers as a commutative, ordered, archimedian and complet field - is a classical proof seeing that

The aim of this paper is to refine the well-known convex optimization Theorem of primal attainement (see for instance [2, Proposition 5.3.3], and also the Appendix of this

Is it possible to define a mapping of Courant-Beltrami type for a con- vex program (non necessarily an ordinary one)? In other words, is it always possible to reduce the problem of

We give a simple proof of the “tree-width duality theorem” of Seymour and Thomas that the tree-width of a finite graph is exactly one less than the largest order of its brambles..

However, since our approach for the existence of the principal eigenfunction N is a byproduct of the contraction result provided by Harris’s theorem, this precludes the case

As regards the most basic issue, namely (DG) pertaining to the question whether duality makes sense at all, this is analyzed in detail — building on a lot of previous literature —

In this exercise sheet, we work out some of the details in the proof of the Poincar´ e Duality Theorem..