Pages that link to "Item:Q761967"

The following pages link to A new polynomial-time algorithm for linear programming (Q761967):

Displaying 50 items.

• qpOASES: a parametric active-set algorithm for~quadratic programming (Q482109) (← links)
• A complexity perspective on entailment of parameterized linear constraints (Q487646) (← links)
• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming (Q493049) (← links)
• A modified infeasible-interior-point algorithm for linear optimization problems (Q493065) (← links)
• A new warmstarting strategy for the primal-dual column generation method (Q494315) (← links)
• Ragnar Frisch and interior-point methods (Q497438) (← links)
• An interior-point trust-funnel algorithm for nonlinear optimization (Q507313) (← links)
• An approach to characterize graded entailment of arguments through a label-based framework (Q511660) (← links)
• A polynomial time approximation scheme for the closest shared center problem (Q513292) (← links)
• Bayesian quantile regression for ordinal models (Q516431) (← links)
• Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming (Q522098) (← links)
• A polynomial primal-dual affine scaling algorithm for symmetric conic optimization (Q523579) (← links)
• Extending partial representations of proper and unit interval graphs (Q524367) (← links)
• A combinatorial certifying algorithm for linear feasibility in UTVPI constraints (Q527418) (← links)
• Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants (Q548599) (← links)
• Solving linear program as linear system in polynomial time (Q552124) (← links)
• Scheduling ordered open shops (Q580167) (← links)
• Towards an asymptotic analysis of Karmarkar's algorithm (Q580169) (← links)
• A monotonic projective algorithm for fractional linear programming (Q580191) (← links)
• A dual version of Tardos's algorithm for linear programming (Q581226) (← links)
• A modification of Karmarkar's linear programming algorithm (Q581231) (← links)
• The steepest descent gravitational method for linear programming (Q583105) (← links)
• Global ellipsoidal approximations and homotopy methods for solving convex analytic programs (Q583119) (← links)
• A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem (Q606335) (← links)
• A brief history of the international symposia on mathematical programming (Q607500) (← links)
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems (Q611277) (← links)
• An aggregate deformation homotopy method for min-max-min problems with max-min constraints (Q616792) (← links)
• Shortest path and maximum flow problems in networks with additive losses and gains (Q620954) (← links)
• Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
• A boundary perturbation interior point homotopy method for solving fixed point problems (Q629228) (← links)
• Positive diagonal scaling of a nonnegative tensor to one with prescribed slice sums (Q630503) (← links)
• A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← links)
• Randomized approximation of bounded multicovering problems (Q679446) (← links)
• The double pivot simplex method (Q684156) (← links)
• Using central prices in the decomposition of linear programs (Q684317) (← links)
• An active-set strategy in an interior point method for linear programming (Q687036) (← links)
• Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices (Q687079) (← links)
• Exterior point algorithms for nearest points and convex quadratic programs (Q687081) (← links)
• A scaling technique for finding the weighted analytic center of a polytope (Q687084) (← links)
• On the finite convergence of interior-point algorithms for linear programming (Q687096) (← links)
• On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm (Q688920) (← links)
• A long-step barrier method for convex quadratic programming (Q689102) (← links)
• Convergence behavior of interior-point algorithms (Q689124) (← links)
• A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio (Q689144) (← links)
• An interior multiobjective linear programming algorithm (Q690014) (← links)
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term (Q695048) (← links)
• On the equivalence of the simplex methods and a multiplier-alike method for linear programming (Q700716) (← links)
• Optimal spanners for axis-aligned rectangles (Q706725) (← links)
• Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix (Q715065) (← links)