Pages that link to "Item:Q4291492"

The following pages link to Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art (Q4291492):

Displaying 50 items.

• The practical behavior of the homogeneous self-dual formulations in interior point methods (Q302143) (← links)
• On sparse matrix orderings in interior point methods (Q402236) (← links)
• Regularization techniques in interior point methods (Q432801) (← links)
• Interior point methods 25 years later (Q439546) (← links)
• Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
• Fast \(L_1^kC^k\) polynomial spline interpolation algorithm with shape-preserving properties (Q631064) (← links)
• The double pivot simplex method (Q684156) (← links)
• Shrinkage estimation of varying covariate effects based on quantile regression (Q746335) (← links)
• Computational experience with a primal-dual interior point method for linear programming (Q808184) (← links)
• A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines (Q869526) (← links)
• An improving procedure of the interior projective method for linear programming (Q928104) (← links)
• Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (Q1029621) (← links)
• HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method (Q1127255) (← links)
• Strategic financial risk management and operations research (Q1278574) (← links)
• Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← 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)
• The role of the augmented system in interior point methods (Q1296137) (← links)
• \(k\)-violation linear programming (Q1336744) (← links)
• Potential-reduction methods in mathematical programming (Q1361104) (← links)
• Fast Cholesky factorization for interior point methods of linear programming (Q1361270) (← links)
• Interactions between nonlinear programming and modeling systems (Q1365050) (← links)
• Symbiosis between linear algebra and optimization (Q1591197) (← links)
• The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators. With comments by Ronald A. Thisted and M. R. Osborne and a rejoinder by the authors (Q1596137) (← links)
• Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
• Advances in design and implementation of optimization software (Q1598765) (← links)
• Augmented sparse reconstruction of protein signaling networks (Q1798095) (← links)
• On the choice of parameters for power-series interior point algorithms in linear programming (Q1804368) (← links)
• Global optimal image reconstruction from blurred noisy data by a Bayesian approach (Q1810924) (← links)
• An interior point potential reduction method for constrained equations (Q1814789) (← links)
• Multiple centrality corrections in a primal-dual method for linear programming (Q1816400) (← links)
• Differential-algebraic approach to linear programming (Q1862190) (← links)
• Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure. (Q1872636) (← links)
• The convergence of an interior-point method using modified search directions in final iterations (Q1886472) (← links)
• Presolving in linear programming (Q1914076) (← links)
• Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
• Gigaflops in linear programming (Q1919182) (← links)
• New infeasible interior-point algorithm based on monomial method (Q1919774) (← links)
• Testing heuristics: We have it all wrong (Q1922626) (← links)
• Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (Q1947198) (← links)
• Application of a GPU-accelerated hybrid preconditioned conjugate gradient approach for large 3D problems in computational geomechanics (Q2006121) (← links)
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
• On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods (Q2227537) (← links)
• Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
• On the convergence of a predictor-corrector variant algorithm (Q2355008) (← links)
• Maximum contrast analysis for nonnegative blind source separation (Q2429043) (← links)
• On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems (Q2457946) (← links)
• An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming (Q2477012) (← links)
• A Frisch-Newton algorithm for sparse quantile regression (Q2508013) (← links)