Due to their extraordinary utility and broad applicability in many areas of classical mathematics and modern physical sciences (most notably, computerized tomography), algorithms for solving convexâ€¦ (More)

Historically the polylogarithm has attracted specialists and non specialists alike with its lovely evaluations Much the same can be said for Euler sums or multiple harmonic sums which within the pastâ€¦ (More)

Euler sums (also called Zagier sums) occur within the context of knot theory and quantum field theory. There are various conjectures related to these sums whose incompletion is a sign that both theâ€¦ (More)

The convex feasibility problem, that is, finding a point in the intersection of finitely many closed convex sets in Euclidean space, arises in various areas of mathematics and physical sciences. Itâ€¦ (More)

We study convex programs that involve the minimization of a convex function over a convex subset of a topological vector space, subject to a finite number of linear inequalities. We develop theâ€¦ (More)

The strong conical hull intersection property and bounded linear regularity are properties of a collection of finitely many closed convex intersecting sets in Euclidean space. These fundamentalâ€¦ (More)

In Part I of this work we derived a duality theorem for partially finite convex programs, problems for which the standard Slater condition fails almost invariably. Our result depended on a constraintâ€¦ (More)

Like differentiability, convexity is a natural and powerful property of functions that plays a significant role in many areas of mathematics, both pure and applied. It ties together notions fromâ€¦ (More)