Pages that link to "Item:Q4895611"
From MaRDI portal
The following pages link to A New Finite Continuation Algorithm for Linear Programming (Q4895611):
Displaying 9 items.
- On Newton's method for Huber's robust M-estimation problems in linear regression (Q1279695) (← links)
- Piecewise-linear pathways to the optimal solution set in linear programming (Q1357530) (← links)
- A penalty continuation method for the \(\ell_\infty\) solution of overdetermined linear systems (Q1387246) (← links)
- An \(L_{1}\) estimation algorithm with degeneracy and linear constraints. (Q1608621) (← links)
- Solving linear programs with finite precision. II: Algorithms (Q2496177) (← links)
- Huber approximation for the non-linear \(l_{1}\) problem (Q2572881) (← links)
- A recursive decision method for termination of linear programs (Q2819718) (← links)
- (Q3750517) (← links)
- A characterization of the optimal set of linear programs based on the augmented lagrangian (Q4264505) (← links)