Pages that link to "Item:Q1598748"

The following pages link to Pivot versus interior point methods: Pros and cons (Q1598748):

Displaying 16 items.

• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• On simplex method with most-obtuse-angle rule and cosine rule (Q548344) (← links)
• The double pivot simplex method (Q684156) (← links)
• Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods (Q709179) (← links)
• New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← links)
• A linear optimization oracle for zonotope computation (Q824329) (← links)
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization (Q1677554) (← links)
• Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied (Q1787922) (← links)
• The \(s\)-monotone index selection rules for pivot algorithms of linear programming (Q1926882) (← links)
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
• A corrector-predictor interior-point method with new search direction for linear optimization (Q2201317) (← links)
• The big-M method with the numerical infinite \(M\) (Q2230778) (← links)
• A new least square algorithm for linear programming (Q2505271) (← links)
• The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function (Q2698611) (← links)
• A new full-NT step interior-point method for circular cone optimization (Q5147630) (← links)
• EUR\(O\)pt, the continuous optimization working group of EURO: from idea to maturity (Q6114937) (← links)