Pages that link to "Item:Q1321268"
From MaRDI portal
The following pages link to Augmented Lagrangian algorithms for linear programming (Q1321268):
Displaying 10 items.
- Further study on augmented Lagrangian duality theory (Q1781963) (← links)
- A global error bound for quadratic perturbation of linear programs (Q1861772) (← links)
- The adventures of a simple algorithm (Q1863543) (← links)
- Characterizations of stability of error bounds for convex inequality constraint systems (Q2165598) (← links)
- Towards an efficient augmented Lagrangian method for convex quadratic programming (Q2191789) (← links)
- Convergence analysis on an accelerated proximal point algorithm for linearly constrained optimization problems (Q2214872) (← links)
- A characterization of the optimal set of linear programs based on the augmented lagrangian (Q4264505) (← links)
- The ‘Idiot’ crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems (Q5113712) (← links)
- Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm (Q6160427) (← links)
- Primal characterizations of stability of error bounds for semi-infinite convex constraint systems in Banach spaces (Q6648852) (← links)
