An algorithm for minimum L-infinity solution of under-determined linear systems

DOI10.1007/s10957-017-1151-yzbMath1383.90024OpenAlexW2742745810WikidataQ57931853 ScholiaQ57931853MaRDI QIDQ1686671

Dario Fannuchi, M. Montaz Ali, Adam Christopher Earle

Publication date: 15 December 2017

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-017-1151-y

zbMATH Keywords

primal methodminimizationpath following methodL-infinity normline search procedureunder-determined system

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• Minimum \(L_\infty\) solution of unerdetermined systems of linear equations
• Approximation in normed linear spaces
• An Efficient Algorithmic Procedure for Obtaining a Minimum $L_\infty $-Norm Solution to a System of Consistent Linear Equations

This page was built for publication: An algorithm for minimum L-infinity solution of under-determined linear systems