Interior Dual Least 2-Norm Algorithm for Linear Programs

DOI10.1137/0331038MaRDI QIDQ3138073zbMATH OpenOpenAlexFDO

Authors Rudy Setiono

Publication date 13 July 1994

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL http://digital.library.wisc.edu/1793/59330

zbMATH Keywords

convex quadratic probleminterior point algorithmNewton stepnonnegativity constraints

Mathematics Subject Classification ID

Linear programming (90C05) Convex programming (90C25)

Recommendations

• Interior dual proximal point algorithm for linear programs
• Dual interior point algorithms
• Interior proximal point algorithm for linear programs
• A finite algorithm for the least two-norm solution of a linear program¹
• scientific article; zbMATH DE number 679874

Cited in

(9)

• Interior dual proximal point algorithm for linear programs
• The adventures of a simple algorithm
• Locating the least 2-norm solution of linear programs via a path-following method
• A finite algorithm for the least two-norm solution of a linear program¹
• Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
• scientific article; zbMATH DE number 2208705 (Why is no real title available?)
• Dual interior point algorithms
• A Newton method for linear programming
• An adaptation of the dual-affine interior point method for the surface flatness problem

Describes a project that uses

Uses Software

• KORBX
• MINOS

This page was built for publication: Interior Dual Least 2-Norm Algorithm for Linear Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138073)