HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
From MaRDI portal
Publication:1127255
DOI10.1016/0377-2217(95)00163-KzbMath0925.90284OpenAlexW2039400631MaRDI QIDQ1127255
Publication date: 5 November 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00163-k
Related Items
HyKKT: a hybrid direct-iterative method for solving KKT linear systems, On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods, A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming, Inexact constraint preconditioners for linear systems arising in interior point methods, 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, Using the primal-dual interior point algorithm within the branch-price-and-cut method, A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition, Preconditioning indefinite systems in interior point methods for large scale linear optimisation, Packing congruent hyperspheres into a hypersphere, Topology optimization of trusses with stress and local constraints on nodal stability and member intersection, A preconditioning technique for Schur complement systems arising in stochastic optimization, Failure modes and effective strength of two-phase materials determined by means of numerical limit analysis, 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, A new warmstarting strategy for the primal-dual column generation method, Optimized packing multidimensional hyperspheres: a unified approach, Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems, Hedging options under transaction costs and stochastic volatility, Exploiting separability in large-scale linear support vector machine training, Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming, Two direct methods in linear programming, Enhancing the behavior of interior-point methods via identification of variables, Stabilization of Mehrotra's primal-dual algorithm and its implementation, Scenario generation and stochastic programming models for asset liability management, A primal-dual interior-point algorithm for quadratic programming, Symbolic implementation of interior point method for linear programming problem, Some insights into the solution algorithms for SLP problems, Convergence analysis of the inexact infeasible interior-point method for linear optimization, Further development of multiple centrality correctors for interior point methods, Asymmetric multipartite Greenberger-Horne-Zeilinger states and Bell inequalities, A predictor-corrector affine scaling method to train optimized extreme learning machine, Quasi-Newton approaches to interior point methods for quadratic problems, Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning, A note on the primal-dual column generation method for combinatorial optimization, Warm start of the primal-dual method applied in the cutting-plane scheme, Block preconditioners for linear systems in interior point methods for convex constrained optimization, A coherent approach to Bayesian data envelopment analysis, Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
Uses Software
Cites Work
- HOPDM - a higher order primal-dual method for large scale linear programming
- QHOPDM -- a higher order primal-dual method for large scale convex quadratic programming
- Primal-dual target-following algorithms for linear programming
- Implementing cholesky factorization for interior point methods of linear programming
- On the Implementation of a Primal-Dual Interior Point Method
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Commentary—Progress in Linear Programming
- Splitting dense columns of constraint matrix in interior point methods for large scale linear programming11The results discussed in the paper have been obtained when the author was staying at LAMSADE, University of Paris Dauphine, Place du Marechal de Lattre de Tassigny, 75775 Paris Cedex 16, France$ef:22A preliminary version of the paper has been presented at the Applied Mathematical Programming and Modelling Symposium APMOD’91 in London, January 14-…
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
