Pages that link to "Item:Q747780"

The following pages link to A polynomial projection algorithm for linear feasibility problems (Q747780):

Displaying 14 items.

• Generation of interior points and polyhedral representations of cones in \(\mathbb R^N\) cut by \(M\) planes sharing a common point (Q261538) (← links)
• Solving conic systems via projection and rescaling (Q1683682) (← links)
• An extension of Chubanov's algorithm to symmetric cones (Q1717223) (← links)
• A note on submodular function minimization by Chubanov's LP algorithm (Q2010920) (← links)
• Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration (Q2149567) (← links)
• A polynomial algorithm for convex quadratic optimization subject to linear inequalities (Q2297665) (← links)
• Enhanced basic procedures for the projection and rescaling algorithm (Q2329647) (← links)
• A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints (Q2802141) (← links)
• Rescaled Coordinate Descent Methods for Linear Programming (Q3186489) (← links)
• A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference (Q5060782) (← links)
• Rescaling Algorithms for Linear Conic Feasibility (Q5119854) (← links)
• Computational Complexity of Atomic Chemical Reaction Networks (Q5127181) (← links)
• Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems (Q5870377) (← links)
• A new extension of Chubanov's method to symmetric cones (Q6126666) (← links)