Pages that link to "Item:Q3026741"
From MaRDI portal
The following pages link to On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method (Q3026741):
Displayed 50 items.
- OSQP: An Operator Splitting Solver for Quadratic Programs (Q78613) (← links)
- Active-set prediction for interior point methods using controlled perturbations (Q263153) (← links)
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- Interior point methods 25 years later (Q439546) (← links)
- The steepest descent gravitational method for linear programming (Q583105) (← links)
- On the finite convergence of interior-point algorithms for linear programming (Q687096) (← links)
- Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints (Q727385) (← links)
- Barrier function method and correction algorithms for improper convex programming problems (Q735654) (← links)
- On the asymptotic behavior of the projective rescaling algorithm for linear programming (Q750290) (← links)
- Vector processing in simplex and interior methods for linear programming (Q751499) (← links)
- Parallel processors for planning under uncertainty (Q751510) (← links)
- A unified view of interior point methods for linear programming (Q803041) (← links)
- Feasibility issues in a primal-dual interior-point method for linear programming (Q803044) (← links)
- Splitting dense columns in sparse linear systems (Q803727) (← links)
- A quadratically convergent method for linear programming (Q808185) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- An interior-point algorithm for computing equilibria in economies with incomplete asset markets (Q844604) (← links)
- On the complexity of a combined homotopy interior method for convex programming (Q859861) (← links)
- Asymptotic behaviour of Karmarkar's method for linear programming (Q911987) (← links)
- A ``build-down'' scheme for linear programming (Q912758) (← links)
- A geometric property of the least squares solution of linear equations (Q916747) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- On the improvement per iteration in Karmarkar's algorithm for linear programming (Q918862) (← links)
- George B. Dantzig and systems optimization (Q951088) (← links)
- Sparse QR factorization on a massively parallel computer (Q973426) (← links)
- A reduced-gradient variant of Karmarkar's algorithm and null-space projections (Q1090599) (← links)
- Computational experience with a dual affine variant of Karmarkar's method for linear programming (Q1092808) (← links)
- Convergence results and numerical experiments on a linear programming hybrid algorithm (Q1095026) (← links)
- Exploiting special structure in Karmarkar's linear programming algorithm (Q1106098) (← links)
- Computing Karmarkar projections quickly (Q1107438) (← links)
- A relaxed version of Karmarkar's method (Q1108926) (← links)
- Linear programming and the Newton barrier flow (Q1111465) (← links)
- Recent developments in constrained optimization (Q1112728) (← links)
- Conical projection algorithms for linear programming (Q1117835) (← links)
- Interior path following primal-dual algorithms. I: Linear programming (Q1123121) (← links)
- A polynomial-time algorithm for a class of linear complementarity problems (Q1123139) (← links)
- Solving a class of LP problems with a primal-dual logarithmic barrier method (Q1129972) (← links)
- On finding a vertex solution using interior point methods (Q1174841) (← links)
- Karmarkar's linear programming algorithm and Newton's method (Q1176568) (← links)
- A hybrid method for the nonlinear least squares problem with simple bounds (Q1177199) (← links)
- On the convex programming approach to linear programming (Q1180836) (← links)
- Interior point algorithms for linear programming with inequality constraints (Q1181732) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- Computational results of an interior point algorithm for large scale linear programming (Q1181915) (← links)
- Complexity analysis of a linear complementarity algorithm based on a Lyapunov function (Q1184351) (← links)
- Modified barrier functions (theory and methods) (Q1186277) (← links)
- A polynomial method of approximate centers for linear programming (Q1196720) (← links)
- Todd's low-complexity algorithm is a predictor-corrector path-following method (Q1197903) (← links)
- Projection algorithms for linear programming (Q1199509) (← links)