Pages that link to "Item:Q1816400"

The following pages link to Multiple centrality corrections in a primal-dual method for linear programming (Q1816400):

Displaying 50 items.

• The practical behavior of the homogeneous self-dual formulations in interior point methods (Q302143) (← links)
• Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
• A numerical framework for diffusion-controlled bimolecular-reactive systems to enforce maximum principles and the non-negative constraint (Q348130) (← links)
• A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
• A polynomial arc-search interior-point algorithm for convex quadratic programming (Q421610) (← links)
• Interior point methods 25 years later (Q439546) (← links)
• A predictor-corrector algorithm with multiple corrections for convex quadratic programming (Q453603) (← links)
• A variation on the interior point method for linear programming using the continued iteration (Q522093) (← 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 cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method (Q526844) (← links)
• A warm-start approach for large-scale stochastic linear programs (Q535016) (← links)
• Exploiting separability in large-scale linear support vector machine training (Q540649) (← links)
• An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming (Q644523) (← links)
• Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods (Q665950) (← links)
• A subzone reconstruction algorithm for efficient staggered compatible remapping (Q727747) (← links)
• Matrix-free interior point method for compressed sensing problems (Q744215) (← links)
• Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms (Q881509) (← links)
• Efficient robust optimization for robust control with constraints (Q925268) (← links)
• Warmstarting for interior point methods applied to the long-term power planning problem (Q1011271) (← links)
• Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming (Q1012253) (← links)
• Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (Q1029621) (← links)
• Further development of multiple centrality correctors for interior point methods (Q1029632) (← links)
• The augmented system variant of IPMs in two-stage stochastic linear programming computation (Q1278963) (← links)
• Using an interior point method for the master problem in a decomposition approach (Q1278995) (← links)
• Warm start of the primal-dual method applied in the cutting-plane scheme (Q1290656) (← links)
• Higher-order derivatives in linear and quadratic programming (Q1592581) (← links)
• Interior-point methods (Q1593831) (← links)
• An interior-point implementation developed and tuned for radiation therapy treatment planning (Q1687310) (← links)
• A new efficient primal dual simplex algorithm (Q1868820) (← links)
• Numerical aspects in developing LP softwares, LPAKO and LPABO (Q1872947) (← links)
• Solving \( L_1\)-CTA in 3D tables by an interior-point method for primal block-angular problems (Q1948525) (← links)
• Application of a GPU-accelerated hybrid preconditioned conjugate gradient approach for large 3D problems in computational geomechanics (Q2006121) (← links)
• An interior point-proximal method of multipliers for convex quadratic programming (Q2028483) (← links)
• Design and implementation of a modular interior-point solver for linear optimization (Q2062319) (← links)
• Koopman operator method for solution of generalized aggregate data inverse problems (Q2128367) (← links)
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
• A new proposal to improve the early iterations in the interior point method (Q2178307) (← links)
• Implementation of an interior point method with basis preconditioning (Q2220915) (← links)
• Quasi-Newton approaches to interior point methods for quadratic problems (Q2322554) (← links)
• Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
• On enforcing maximum principles and achieving element-wise species balance for advection-diffusion-reaction equations under the finite element method (Q2374942) (← links)
• Trajectory-following methods for large-scale degenerate convex quadratic programming (Q2392932) (← links)
• An empirical evaluation of walk-and-round heuristics for mixed integer linear programs (Q2393650) (← links)
• Optimized choice of parameters in interior-point methods for linear programming (Q2419556) (← links)
• Parallel interior-point solver for structured quadratic programs: Application to financial planning problems (Q2480251) (← links)
• Detecting ``dense'' columns in interior point methods for linear programs (Q2643620) (← links)
• Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods (Q2643622) (← links)
• Exploiting hardware capabilities in interior point methods (Q2815515) (← links)
• An experimental investigation of a primal–dual exterior point simplexalgorithm (Q2868925) (← links)
• Interactive dynamic optimization server – connecting one modelling language with many solvers (Q2926076) (← links)