Pages that link to "Item:Q1123124"
From MaRDI portal
The following pages link to Implementing proximal point methods for linear programming (Q1123124):
Displayed 10 items.
- Primal-dual proximal point algorithm for linearly constrained convex programming problems (Q1203067) (← links)
- Augmented Lagrangian algorithms for linear programming (Q1321268) (← links)
- A primal-dual proximal point algorithm for constrained convex programs (Q1763276) (← links)
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming (Q1770257) (← links)
- Further study on augmented Lagrangian duality theory (Q1781963) (← links)
- The adventures of a simple algorithm (Q1863543) (← links)
- A continuation method for monotone variational inequalities (Q1908015) (← links)
- Generalized proximal point algorithm for convex optimization (Q1908641) (← links)
- Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs (Q2366829) (← links)
- A characterization of the optimal set of linear programs based on the augmented lagrangian (Q4264505) (← links)