34 research outputs found
Hyperbolic programs and their derivative relaxations
We study the algebraic and facial structures of hyperbolic programs, and examine natural relaxations of hyperbolic programs, the relaxations themselves being hyperbolic programs
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
Following the breakthrough work of Tardos (Oper. Res. '86) in the bit-complexity model, Vavasis and Ye (Math. Prog. '96) gave the first exact algorithm for linear programming in the real model of computation with running time depending only on the constraint matrix. For solving a linear program (LP) max cx, Ax = b, x ≥ 0, A g m × n, Vavasis and Ye developed a primal-dual interior point method using a g€layered least squares' (LLS) step, and showed that O(n3.5 log(χA+n)) iterations suffice to solve (LP) exactly, where χA is a condition measure controlling the size of solutions to linear systems related to A. Monteiro and Tsuchiya (SIAM J. Optim. '03), noting that the central path is invariant under rescalings of the columns of A and c, asked whether there exists an LP algorithm depending instead on the measure χA∗, defined as the minimum χAD value achievable by a column rescaling AD of A, and gave strong evidence that this should be the case. We resolve this open question affirmatively. Our first main contribution is an O(m2 n2 + n3) time algorithm which works on the linear matroid of A to compute a nearly optimal diagonal rescaling D satisfying χAD ≤ n(χ∗)3. This algorithm also allows us to approximate the value of χA up to a factor n (χ∗)2. This result is in (surprising) contrast to that of Tunçel (Math. Prog. '99), who showed NP-hardness for approximating χA to within 2poly(rank(A)). The key insight for our algorithm is to work with ratios gi/gj of circuits of A - i.e., minimal linear dependencies Ag=0 - which allow us to approximate the value of χA∗ by a maximum geometric mean cycle computation in what we call the g€circuit ratio digraph' of A. While this resolves Monteiro and Tsuchiya's question by appropriate preprocessing, it falls short of providing either a truly scaling invariant algorithm or an improvement upon the base LLS analysis. In this vein, as our second main contribution we develop a scaling invariant LLS algorithm, which uses and dynamically maintains improving estimates of the circuit ratio digraph, together with a refined potential function based analysis for LLS algorithms in general. With this analysis, we derive an improved O(n2.5 lognlog(χA∗+n)) iteration bound for optimally solving (LP) using our algorithm. The same argument also yields a factor n/logn improvement on the iteration complexity bound of the original Vavasis-Ye algorithm
Three steps towards metrological traceability for ballistics signature measurements.
Abstract The National Institute of Standards and Technology (NIST) in collaboration with the Bureau of Alcohol, Tobacco, Firearms, and Explosives (ATF) has developed the Standard Reference Material (SRM) bullets and casings. NIST and ATF are proposing to establish a National Ballistics Measurement Traceability and Quality System for ballistics signature measurements and correlations using these materials. In this paper, three key steps towards metrological traceability for ballistics signature measurements are discussed that include: 1) Establishing a reference standard; 2) Establishing an unbroken chain of calibrations; and 3) Evaluating measurement uncertainty
Polynomial-sized Semidefinite Representations of Derivative Relaxations of Spectrahedral Cones
We give explicit polynomial-sized (in and ) semidefinite
representations of the hyperbolicity cones associated with the elementary
symmetric polynomials of degree in variables. These convex cones form a
family of non-polyhedral outer approximations of the non-negative orthant that
preserve low-dimensional faces while successively discarding high-dimensional
faces. More generally we construct explicit semidefinite representations
(polynomial-sized in , and ) of the hyperbolicity cones associated with
th directional derivatives of polynomials of the form where the are symmetric
matrices. These convex cones form an analogous family of outer approximations
to any spectrahedral cone. Our representations allow us to use semidefinite
programming to solve the linear cone programs associated with these convex
cones as well as their (less well understood) dual cones.Comment: 20 pages, 1 figure. Minor changes, expanded proof of Lemma
A framework for applying subgradient methods
I discuss a framework that came to mind five years ago, in trying to solve an algorithmic problem in the context of hyperbolic programming. I never solved that problem, but the framework has proved to have interesting algorithmic consequences for convex optimization generally.Non UBCUnreviewedAuthor affiliation: Cornell UniversityFacult
Incorporating Condition Measures Into The Complexity Theory Of Linear Programming
this paper, we take the approach of traditional complexity theory: Requiring the input