Pages that link to "Item:Q1403294"

The following pages link to Smoothed analysis of termination of linear programming algorithms (Q1403294):

Displaying 12 items.

• \(l_1\)-gain performance analysis and positive filter design for positive discrete-time Markov jump linear systems: a linear programming approach (Q466286) (← links)
• Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
• Robust smoothed analysis of a condition number for linear programming (Q662310) (← links)
• Smoothed analysis of complex conic condition numbers (Q864180) (← links)
• Approximation schemes for packing with item fragmentation (Q927410) (← links)
• Smoothed analysis of probabilistic roadmaps (Q1028227) (← links)
• Positive consensus for multi-agent systems with average dwell time switching (Q2235434) (← links)
• State estimation on positive Markovian jump systems with time-varying delay and uncertain transition probabilities (Q2282061) (← links)
• Smoothed analysis of binary search trees (Q2371805) (← links)
• Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design (Q2672280) (← links)
• The average condition number of most tensor rank decomposition problems is infinite (Q2697393) (← links)
• (Q5111230) (← links)