Pages that link to "Item:Q5704144"

The following pages link to On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System (Q5704144):

Displaying 16 items.

• A condition-based algorithm for solving polyhedral feasibility problems (Q457560) (← links)
• Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization (Q463718) (← links)
• On two measures of problem instance complexity and their correlation with the performance of SeDuMi on second-order cone problems (Q853555) (← links)
• Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information (Q858332) (← links)
• Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems (Q868472) (← links)
• Computing approximate solutions for convex conic systems of constraints (Q1575064) (← links)
• Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system (Q1587936) (← links)
• Some characterizations and properties of the ``distance to the ill-posedness'' and the condition measure of a conic linear system (Q1961978) (← links)
• New characterizations of Hoffman constants for systems of linear constraints (Q2020601) (← links)
• Complexity indices for the multidimensional knapsack problem (Q2045626) (← links)
• On the block-structured distance to non-surjectivity of sublinear mappings (Q2487844) (← links)
• A new condition measure, preconditioners, and relations between different measures of conditioning for conic linear systems (Q2784428) (← links)
• Extreme points of well-posed polytopes (Q3446581) (← links)
• Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm (Q4702342) (← links)
• Computation of condition numbers for linear programming problems using Peña’s method (Q5475283) (← links)
• Linear programming sensitivity measured by the optimal value worst-case analysis (Q6644997) (← links)