Pages that link to "Item:Q5900037"
From MaRDI portal
The following pages link to A simple polynomial-time rescaling algorithm for solving linear programs (Q5900037):
Displaying 17 items.
- Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384506) (← links)
- Solving conic systems via projection and rescaling (Q1683682) (← links)
- A simple method for convex optimization in the oracle model (Q2164690) (← links)
- Rescaled Coordinate Descent Methods for Linear Programming (Q3186489) (← links)
- Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- Geometric Rescaling Algorithms for Submodular Function Minimization (Q4958557) (← links)
- A Data-Independent Distance to Infeasibility for Linear Conic Systems (Q4959838) (← links)
- Multidimensional Binary Search for Contextual Decision-Making (Q4971566) (← links)
- Method of Alternating Contractions and Its Applications to Some Convex Optimization Problems (Q5010045) (← links)
- Rescaling Algorithms for Linear Conic Feasibility (Q5119854) (← links)
- Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems (Q5870377) (← links)
- Implementation of a projection and rescaling algorithm for second-order conic feasibility problems (Q5882232) (← links)
- A deterministic rescaled perceptron algorithm (Q5962726) (← links)
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)
- An exponential lower bound for Zadeh's pivot rule (Q6038661) (← links)
- Adversarial manifold estimation (Q6118078) (← links)