Interior Dual Least 2-Norm Algorithm for Linear Programs

DOI10.1137/0331038zbMATH Open0791.90032OpenAlexW2074751680MaRDI QIDQ3138073FDOQ3138073

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

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

zbMATH Keywords

interior point algorithmNewton stepnonnegativity constraintsconvex quadratic problem

Mathematics Subject Classification ID

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

Cited In (7)

• An adaptation of the dual-affine interior point method for the surface flatness problem
• Title not available (Why is that?)
• Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
• A finite algorithm for the least two-norm solution of a linear program¹
• The adventures of a simple algorithm
• Locating the least 2-norm solution of linear programs via a path-following method
• A Newton method for linear programming

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)