The following pages link to PCx (Q16889):
Displaying 49 items.
- Infeasible interior-point methods for linear optimization based on large neighborhood (Q306402) (← links)
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization (Q394386) (← links)
- Using the analytic center in the feasibility pump (Q408384) (← links)
- A preconditioning technique for Schur complement systems arising in stochastic optimization (Q453622) (← links)
- Optimal call admission and call dropping control in links with variable capacity (Q468286) (← links)
- Quadratic regularizations in an interior-point method for primal block-angular problems (Q652285) (← links)
- Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods (Q665950) (← links)
- The Cholesky factorization in interior point methods (Q815247) (← links)
- On central-path proximity measures in interior-point methods (Q850820) (← links)
- Polynomial time second order mehrotra-type predictor--corrector algorithms (Q864824) (← 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)
- An optimization approach to multiple sequence alignment (Q1431885) (← links)
- A homogeneous model for monotone mixed horizontal linear complementarity problems (Q1734775) (← links)
- Interior point methods in DEA to determine non-zero multiplier weights (Q1762028) (← links)
- A primal-dual regularized interior-point method for convex quadratic programs (Q1762462) (← links)
- Large-scale linear programming techniques for the design of protein folding potentials (Q1764228) (← links)
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming (Q1765884) (← links)
- Stabilization of Mehrotra's primal-dual algorithm and its implementation (Q1771347) (← links)
- Predictor-corrector smoothing methods for linear programs with a more flexible update of the smoothing parameter (Q1856363) (← links)
- The convergence of an interior-point method using modified search directions in final iterations (Q1886472) (← links)
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (Q1989949) (← links)
- On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems (Q2067705) (← 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)
- Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming (Q2219452) (← links)
- Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method (Q2244972) (← links)
- A Mehrotra type predictor-corrector interior-point algorithm for linear programming (Q2273110) (← links)
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
- A finite termination Mehrotra-type predictor-corrector algorithm (Q2383922) (← links)
- Optimized choice of parameters in interior-point methods for linear programming (Q2419556) (← links)
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems (Q2457946) (← links)
- Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking (Q2642898) (← links)
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming (Q2643618) (← links)
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods (Q2643622) (← links)
- Effects of finite-precision arithmetic on interior-point methods for nonlinear programming (Q2719248) (← links)
- The other side of ranking schemes: generating weights for specified outcomes (Q2816367) (← links)
- Strict quasi-concavity and the differential barrier property of gauges in linear programming (Q3453425) (← links)
- A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods (Q3562405) (← links)
- Computing the Splitting Preconditioner for Interior Point Method Using an Incomplete Factorization Approach (Q4685741) (← links)
- (Q4796190) (← links)
- Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number (Q5058377) (← links)
- The parallel solution of dense saddle-point linear systems arising in stochastic programming (Q5200564) (← links)
- Computational experience with a modified potential reduction algorithm for linear programming (Q5200565) (← links)
- Convergence Conditions and Krylov Subspace--Based Corrections for Primal-Dual Interior-Point Method (Q5317516) (← links)
- (Q5358292) (← links)
- Object-oriented software for quadratic programming (Q5461049) (← links)
- Two direct methods in linear programming (Q5935423) (← links)
