PCx

swMATH4721MaRDI QIDQ16889FDOQ16889

Author name not available (Why is that?)

Described by source

• PCx: an interior-point code for linear programming

Cited In (49)

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

This page was built for software: PCx