Duality in Quadratic Programming...

100 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Quantifying Learning Guarantees for Convex but Inconsistent Surrogates (2018, methodology): “The dual of Dorn is convenient for our needs because it does not require inverting the matrix defining the quadratic terms (compared to the standard Lagrangian dual).”
Gradient Episodic Memory for Continual Learning (2017, background): “(10) If (u, v) is a solution to (10), then there is a solution z to (9) satisfying Cz = Cu [Dorn, 1960].”
On Training Recurrent Neural Networks for Lifelong Learning (2018, background): “The dual problem of (2) is: If ( u (cid:63) , v (cid:63) ) is a solution to (3), then there is a solution z (cid:63) to (2) satisfying Cz (cid:63) = Cu (Dorn, 1960).”
Learning Continually from Low-shot Data Stream (2019, methodology): “The Lagrangian dual problem (Dorn 1960) of Eq.”
Optimal value bounds in nonlinear programming with interval data (2011, background): “The Dorn dual problem (Bazaraa et al. 1993; Dorn 1960; Martos 1975) is”
Toward Training Recurrent Neural Networks for Lifelong Learning (2019, background): “The projected gradient update ˜ g l can be obtained by solving the following set of equations: where (Dorn, 1960).”