On the Grassmann condition number

We give new insight into the Grassmann condition of the conic feasibility problem \[ x \in L \cap K \setminus\{0\}. \] Here $K\subseteq V$ is a regular convex cone and $L\subseteq V$ is a linear subspace of the finite dimensional Euclidean vector space $V$. The Grassmann condition of this problem is the reciprocal of the distance from $L$ to the set of ill-posed instances in the Grassmann manifold where $L$ lives. We consider a very general distance in the Grassmann manifold defined by two possibly different norms in $V$. We establish the equivalence between the Grassmann distance to ill-posedness of the above problem and a natural measure of the least violated trial solution to its alternative feasibility problem. We also show a tight relationship between the Grassmann and Renegar's condition measures, and between the Grassman measure and a symmetry measure of the above feasibility problem. Our approach can be readily specialized to a canonical norm in $V$ induced by $K$, a prime example being the one-norm for the non-negative orthant. For this special case we show that the Grassmann distance ill-posedness of is equivalent to a measure of the most interior solution to the above conic feasibility problem.

[1]  M. Frei Analysis On Symmetric Cones , 2016 .

[2]  Peter Bürgisser,et al.  Probabilistic Analysis of the Grassmann Condition Number , 2011, Found. Comput. Math..

[3]  Joel A. Tropp,et al.  Living on the edge: phase transitions in convex programs with random data , 2013, 1303.6672.

[4]  Peter Bürgisser,et al.  A Coordinate-Free Condition Number for Convex Programming , 2011, SIAM J. Optim..

[5]  Dimitris Bertsimas,et al.  A Geometric Characterization of the Power of Finite Adaptability in Multistage Stochastic and Adaptive Optimization , 2011, Math. Oper. Res..

[6]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[7]  Felipe Cucker,et al.  On strata of degenerate polyhedral cones, II: Relations between condition measures , 2010, J. Complex..

[8]  Robert M. Freund,et al.  Projective re-normalization for improving the behavior of a homogeneous conic linear system , 2009, Math. Program..

[9]  Robert M. Freund,et al.  A geometric analysis of Renegar’s condition number, and its interplay with conic curvature , 2007, Math. Program..

[10]  Felipe Cucker,et al.  A Condition Number for Multifold Conic Systems , 2008, SIAM J. Optim..

[11]  Robert M. Freund,et al.  On the symmetry function of a convex set , 2008, Math. Program..

[12]  Michel Baes,et al.  Spectral Functions and Smoothing Techniques on Jordan Algebras: How algebraic techniques can help to design efficient optimization algorithms , 2009 .

[13]  Robert M. Freund,et al.  Complexity of convex optimization using geometry-based measures and a reference point , 2015, Math. Program..

[14]  Javier Peña Conic systems and sublinear mappings: equivalent approaches , 2004, Oper. Res. Lett..

[15]  Felipe Cucker,et al.  Unifying Condition Numbers for Linear Programming , 2003, Math. Oper. Res..

[16]  Farid Alizadeh,et al.  Extension of primal-dual interior point algorithms to symmetric cones , 2003, Math. Program..

[17]  R. Rockafellar,et al.  The radius of metric regularity , 2002 .

[18]  Robert M. Freund,et al.  A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems , 2002, SIAM J. Optim..

[19]  Felipe Cucker,et al.  A new condition number for linear programming , 2001, Math. Program..

[20]  Farid Alizadeh,et al.  Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones , 2001, Math. Oper. Res..

[21]  Adrian S. Lewis,et al.  Convex Analysis And Nonlinear Optimization , 2000 .

[22]  Javier Peña,et al.  Understanding the Geometry of Infeasible Perturbations of a Conic Linear System , 1999, SIAM J. Optim..

[23]  Robert M. Freund,et al.  Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system , 2000, Math. Program..

[24]  A. S. Lewis,et al.  Ill-Conditioned Convex Processes and Conic Linear Systems , 1999, Math. Oper. Res..

[25]  Robert M. Freund,et al.  Some characterizations and properties of the “distance to ill-posedness” and the condition measure of a conic linear system , 1999, Math. Program..

[26]  Robert M. Freund,et al.  Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm , 1999, SIAM J. Optim..

[27]  James Renegar,et al.  Linear programming, complexity theory and elementary functional analysis , 1995, Math. Program..

[28]  James Renegar,et al.  Incorporating Condition Measures into the Complexity Theory of Linear Programming , 1995, SIAM J. Optim..

[29]  Yinyu Ye,et al.  Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming , 1994, Math. Oper. Res..