A HYBRID ADAPTIVE ALGORITHM FOR LINEAR OPTIMIZATION

DOI10.1142/S0217595909002183zbMath1168.90616OpenAlexW2066307871MaRDI QIDQ3636502

Tamás Terlaky, Maziar Salahi

Publication date: 30 June 2009

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595909002183

zbMATH Keywords

Linear optimizationinterior point methodspolynomial complexityself-regular functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Fractional programming (90C32) Linear programming (90C05)

Related Items (1)

Unnamed Item

Uses Software

• Mosek
• LIPSOL

Cites Work

• A new polynomial-time algorithm for linear programming
• On the Implementation of a Primal-Dual Interior Point Method
• Solving large-scale linear programs by interior-point methods under the Matlab^∗Environment^†
• A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
• Unnamed Item

This page was built for publication: A HYBRID ADAPTIVE ALGORITHM FOR LINEAR OPTIMIZATION