Pages that link to "Item:Q1924065"
From MaRDI portal
The following pages link to Primal-dual methods for linear programming (Q1924065):
Displaying 16 items.
- Interior penalty functions and duality in linear programming (Q483200) (← links)
- A primal-dual simplex method for linear programs (Q688212) (← links)
- A unified view of interior point methods for linear programming (Q803041) (← links)
- A stable primal-dual approach for linear programming under nondegeneracy assumptions (Q849092) (← links)
- A build-up variant of the logarithmic barrier method for LP (Q1200789) (← links)
- Direct-dual block method of linear programming (Q1287534) (← links)
- Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
- On the interplay among entropy, variable metrics and potential functions in interior-point algorithms (Q1360218) (← links)
- The primal-dual method for approximation algorithms (Q1849526) (← links)
- The convergence of an interior-point method using modified search directions in final iterations (Q1886472) (← links)
- Experimental investigations in combining primal dual interior point method and simplex based LP solvers (Q1904702) (← links)
- A primal-dual interior-point method for linear programming based on a weighted barrier function (Q1906738) (← links)
- (Q3538742) (← links)
- Convergence rate of primal dual reciprocal Barrier Newton interior-point methods (Q4391287) (← links)
- LOQO:an interior point code for quadratic programming (Q4504789) (← links)
- Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables (Q4848422) (← links)