Pages that link to "Item:Q4012424"
From MaRDI portal
The following pages link to Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method (Q4012424):
Displayed 19 items.
- A long-step barrier method for convex quadratic programming (Q689102) (← links)
- Convergence behavior of interior-point algorithms (Q689124) (← links)
- A potential-reduction variant of Renegar's short-step path-following method for linear programming (Q811094) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise (Q1206441) (← links)
- An interior point method for quadratic programs based on conjugate projected gradients (Q1260618) (← links)
- Long-step interior-point algorithms for a class of variational inequalities with monotone operators (Q1264995) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming (Q1319021) (← links)
- On the classical logarithmic barrier function method for a class of smooth convex programming problems (Q1321158) (← links)
- On the number of iterations of Karmarkar's algorithm for linear programming (Q1321670) (← links)
- Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
- Fast convergence of the simplified largest step path following algorithm (Q1361106) (← links)
- The largest step path following algorithm for monotone linear complementarity problems (Q1363413) (← links)
- Large step volumetric potential reduction algorithms for linear programming (Q1915924) (← links)
- A cutting plane method from analytic centers for stochastic programming (Q1922690) (← links)
- An alternative derivation of the projective interior point method for linear programming through the least squares approach (Q4764596) (← links)
- General central path and the largest step general central path following algorithm for linear programming (Q5949520) (← links)
- IFORS' Operational Research Hall of Fame: Clóvis Caesar Gonzaga (Q6195051) (← links)