The following pages link to (Q3793938):
Displaying 11 items.
- Finite perturbation of convex programs (Q810372) (← links)
- A hybrid algorithm for solving linear inequalities in a least squares sense (Q1014358) (← links)
- Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem (Q1116899) (← links)
- Finite termination of the proximal point algorithm (Q1176570) (← links)
- Newton's method for linear inequality systems (Q1296136) (← links)
- Error bounds and strong upper semicontinuity for monotone affine variational inequalities (Q1312768) (← links)
- Augmented Lagrangian algorithms for linear programming (Q1321268) (← links)
- The adventures of a simple algorithm (Q1863543) (← links)
- A continuation method for monotone variational inequalities (Q1908015) (← links)
- A Gauss-Newton method for convex composite optimization (Q1914073) (← links)
- Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs (Q2366829) (← links)
