Pages that link to "Item:Q593978"
From MaRDI portal
The following pages link to Least-norm linear programming solution as an unconstrained minimization problem (Q593978):
Displayed 8 items.
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming (Q1085068) (← links)
- On piecewise quadratic Newton and trust region problems (Q1356055) (← links)
- Linearly constrained convex programming as unconstrained differentiable concave programming (Q1897463) (← links)
- Unconstrained convex programming approach to linear programming (Q1905944) (← links)
- A Gauss-Newton method for convex composite optimization (Q1914073) (← links)
- On the Lipschitz behavior of optimal solutions in parametric problems of quadratic optimization and linear complementarity (Q3725891) (← links)
- A dual differentiable exact penalty function (Q3959752) (← links)
- An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions (Q4859453) (← links)