activity
20082017
most citedLiving on the edge: Phase transitions in convex programs with random data

28 citations · 67 across the 7 of their papers we have counts for

collaborators

10 papers

math.NA2017

Effective Condition Number Bounds for Convex Regularization

Dennis Amelunxen, Martin Lotz, Jake Walvin

We derive bounds relating Renegar's condition number to quantities that govern the statistical performance of convex regularization in settings that include the -analysis s…

math.NA2015

Average-case complexity without the black swans

Dennis Amelunxen, Martin Lotz

We introduce the concept of weak average-case analysis as an attempt to achieve theoretical complexity results that are closer to practical experience than those resulting from tra…

math.CO2015

Intrinsic Volumes of Polyhedral Cones: A combinatorial perspective

Dennis Amelunxen, Martin Lotz

The theory of intrinsic volumes of convex cones has recently found striking applications in areas such as convex optimization and compressive sensing. This article provides a self-…

math.MG2014★ 10 cited

Measures on polyhedral cones: characterizations and kinematic formulas

Dennis Amelunxen

This paper is about conic intrinsic volumes and their associated integral geometry. We pay special attention to the biconic localizations of the conic intrinsic volumes, the so-cal…

math.PR2014★ 9 cited

Gordon's inequality and condition numbers in conic optimization

Dennis Amelunxen, Martin Lotz

The probabilistic analysis of condition numbers has traditionally been approached from different angles; one is based on Smale's program in complexity theory and features integral…

cs.IT2013★ 28 cited

Living on the edge: Phase transitions in convex programs with random data

Dennis Amelunxen, Martin Lotz, Michael B. McCoy +1

Recent research indicates that many convex optimization problems with random constraints exhibit a phase transition as the number of constraints increases. For example, this phenom…

math.OC2012★ 11 cited

Intrinsic volumes of symmetric cones

Dennis Amelunxen, Peter Bürgisser

We compute the intrinsic volumes of the cone of positive semidefinite matrices over the real numbers, over the complex numbers, and over the quaternions, in terms of integrals rela…

math.OC2011★ 7 cited

Probabilistic analysis of the Grassmann condition number

Dennis Amelunxen, Peter Bürgisser

We analyze the probability that a random m-dimensional linear subspace of R^n both intersects a regular closed convex cone C\subseteq R^n and lies within distance αof an m-dimensio…

math.OC2011

A coordinate-free condition number for convex programming

Dennis Amelunxen, Peter Bürgisser

We introduce and analyze a natural geometric version of Renegar's condition number R for the homogeneous convex feasibility problem associated with a regular cone C subseteq R^n. L…

math.OC2008★ 2 cited

Robust Smoothed Analysis of a Condition Number for Linear Programming

Peter Bürgisser, Dennis Amelunxen

We perform a smoothed analysis of the GCC-condition number C(A) of the linear programming feasibility problem \exists x\in\R^{m+1} Ax < 0. Suppose that \bar{A} is any matrix with r…