User'S guide To Lipsol linear-programming interior point solvers V0.4

DOI10.1080/10556789908805756zbMath0970.90119OpenAlexW2095475147MaRDI QIDQ4504786

Yin Zhang

Publication date: 14 September 2000

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556789908805756

zbMATH Keywords

softwarematlablinear programminginterior point methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Packaged methods for numerical algorithms (65Y15)

Related Items

Three nearly scaling-invariant versions of an exterior point algorithm for linear programming, A stable primal-dual approach for linear programming under nondegeneracy assumptions, Status determination by interior-point methods for convex optimization problems in domain-driven form, Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming, An adaptive self-regular proximity-based large-update IPM for LO, A self-adjusting primal–dual interior point method for linear programs, On self-regular IPMs (with comments and rejoinder), A dynamic large-update primal‐dual interior-point method for linear optimization, Robust preliminary analysis of large-scale linear model for optimal industrial investments, Primal-Dual Interior-Point Methods for Domain-Driven Formulations, A semidefinite programming based polyhedral cut and price approach for the maxcut problem, The complexity of self-regular proximity based infeasible IPMs, A predictor-corrector algorithm for linear optimization based on a modified Newton direction, Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming, A self-adjusting interior point algorithm for linear complementarity problems

Uses Software

• Matlab
• LIPSOL

Cites Work

• Unnamed Item
• On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
• On the Implementation of a Primal-Dual Interior Point Method
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• Solving large-scale linear programs by interior-point methods under the Matlab^∗Environment^†