Pages that link to "Item:Q1196720"

The following pages link to A polynomial method of approximate centers for linear programming (Q1196720):

Displaying 27 items.

• A long-step barrier method for convex quadratic programming (Q689102) (← links)
• Convergence behavior of interior-point algorithms (Q689124) (← links)
• A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
• On the complexity of following the central path of linear programs by linear extrapolation. II (Q1181914) (← links)
• Todd's low-complexity algorithm is a predictor-corrector path-following method (Q1197903) (← links)
• A build-up variant of the logarithmic barrier method for LP (Q1200789) (← links)
• Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints (Q1293959) (← links)
• Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
• A long-step primal-dual path-following method for semidefinite programming (Q1306474) (← links)
• Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
• Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
• A feasible descent cone method for linearly constrained minimization problems (Q1336880) (← 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)
• Volumetric path following algorithms for linear programming (Q1361113) (← links)
• The largest step path following algorithm for monotone linear complementarity problems (Q1363413) (← links)
• The curvature integral and the complexity of linear complementarity problems (Q1904662) (← links)
• A logarithmic barrier cutting plane method for convex programming (Q1904709) (← links)
• An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904) (← links)
• Primal-dual target-following algorithms for linear programming (Q1915912) (← links)
• Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
• A cutting plane method from analytic centers for stochastic programming (Q1922690) (← links)
• A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function (Q2053077) (← links)
• On the convergence of the method of analytic centers when applied to convex quadratic programs (Q2277366) (← links)
• Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization (Q2340161) (← links)
• Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)
• (Q6191375) (← links)