Pages that link to "Item:Q3211107"
From MaRDI portal
The following pages link to A Centered Projective Algorithm for Linear Programming (Q3211107):
Displaying 50 items.
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem (Q331977) (← links)
- A convergent algorithm for quantile regression with smoothing splines (Q672955) (← links)
- An active-set strategy in an interior point method for linear programming (Q687036) (← links)
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm (Q688920) (← links)
- Computing material collapse displacement fields on a Cray X-MP/48 by the LP primal affine scaling algorithm (Q752020) (← links)
- Interior-point algorithms for global optimization (Q804475) (← links)
- O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming (Q805163) (← links)
- On monotonicity in the scaled potential algorithm for linear programming (Q805164) (← links)
- Algorithms for the solution of quadratic knapsack problems (Q806968) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- A class of linear complementarity problems solvable in polynomial time (Q1174838) (← links)
- On some efficient interior point methods for nonlinear convex programming (Q1174840) (← links)
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569) (← links)
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function (Q1177228) (← links)
- A unified approach to interior point algorithms for linear complementarity problems: A summary (Q1180826) (← links)
- On lower bound updates in primal potential reduction methods for linear programming (Q1181907) (← links)
- A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start'' (Q1181909) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- A note on a potential reduction algorithm for LP with simultaneous primal-dual updating (Q1186945) (← links)
- On affine scaling algorithms for nonconvex quadratic programming (Q1196182) (← links)
- On the convergence rate of the duality gap in a symmetric primal-dual potential reduction algorithm (Q1196215) (← links)
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming (Q1196717) (← links)
- A polynomial method of approximate centers for linear programming (Q1196720) (← links)
- A new polynomial time method for a linear complementarity problem (Q1207309) (← links)
- An interior point method, based on rank-1 updates, for linear programming (Q1290600) (← links)
- Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions (Q1294553) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- An extension of the potential reduction algorithm for linear complementarity problems with some priority goals (Q1318200) (← links)
- Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming (Q1319021) (← links)
- Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited (Q1321176) (← links)
- A primal-dual affine-scaling potential-reduction algorithm for linear programming (Q1321668) (← links)
- A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
- Global convergence in infeasible-interior-point algorithms (Q1334952) (← links)
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
- Extensions of the potential reduction algorithm for linear programming (Q1336068) (← links)
- Constant potential primal-dual algorithms: A framework (Q1340053) (← links)
- Asymptotic convergence in a generalized predictor-corrector method (Q1352296) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- Long-step strategies in interior-point primal-dual methods (Q1361105) (← links)
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming (Q1803608) (← links)
- On the convergence of primal-dual interior-point methods with wide neighborhoods (Q1804577) (← links)
- Polynomial affine algorithms for linear programming (Q1814590) (← links)
- An interior point potential reduction method for constrained equations (Q1814789) (← links)
- Solving linear systems involved in constrained optimization (Q1902118) (← links)
- New complexity results for the Iri-Imai method (Q1915925) (← links)
- Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems (Q1919097) (← links)
- An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
- Tensor complementarity problems. II: Solution methods (Q2275317) (← links)
- A potential reduction method for tensor complementarity problems (Q2313741) (← links)
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
