PCx
From MaRDI portal
Software:16889
No author found.
Related Items (49)
The convergence of an interior-point method using modified search directions in final iterations ⋮ Infeasible interior-point methods for linear optimization based on large neighborhood ⋮ Strict quasi-concavity and the differential barrier property of gauges in linear programming ⋮ Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number ⋮ On central-path proximity measures in interior-point methods ⋮ A finite termination Mehrotra-type predictor-corrector algorithm ⋮ Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking ⋮ Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming ⋮ Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods ⋮ Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming ⋮ Convergence Conditions and Krylov Subspace--Based Corrections for Primal-Dual Interior-Point Method ⋮ Polynomial time second order mehrotra-type predictor--corrector algorithms ⋮ A polynomial arc-search interior-point algorithm for linear programming ⋮ A new proposal to improve the early iterations in the interior point method ⋮ A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization ⋮ Optimized choice of parameters in interior-point methods for linear programming ⋮ Using the analytic center in the feasibility pump ⋮ A preconditioning technique for Schur complement systems arising in stochastic optimization ⋮ Quadratic regularizations in an interior-point method for primal block-angular problems ⋮ Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming ⋮ Optimal call admission and call dropping control in links with variable capacity ⋮ An optimization approach to multiple sequence alignment ⋮ Effects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming ⋮ On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems ⋮ A homogeneous model for monotone mixed horizontal linear complementarity problems ⋮ Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods ⋮ A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods ⋮ Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming ⋮ Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method ⋮ Unnamed Item ⋮ Interior point methods in DEA to determine non-zero multiplier weights ⋮ A primal-dual regularized interior-point method for convex quadratic programs ⋮ Large-scale linear programming techniques for the design of protein folding potentials ⋮ Two direct methods in linear programming ⋮ A new class of preconditioners for large-scale linear systems from interior point methods for linear programming ⋮ Stabilization of Mehrotra's primal-dual algorithm and its implementation ⋮ A Mehrotra type predictor-corrector interior-point algorithm for linear programming ⋮ Computing the Splitting Preconditioner for Interior Point Method Using an Incomplete Factorization Approach ⋮ The parallel solution of dense saddle-point linear systems arising in stochastic programming ⋮ Computational experience with a modified potential reduction algorithm for linear programming ⋮ Unnamed Item ⋮ Object-oriented software for quadratic programming ⋮ The other side of ranking schemes: generating weights for specified outcomes ⋮ Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension ⋮ Further development of multiple centrality correctors for interior point methods ⋮ On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems ⋮ Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning ⋮ Predictor-corrector smoothing methods for linear programs with a more flexible update of the smoothing parameter ⋮ The Cholesky factorization in interior point methods
This page was built for software: PCx
