![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Valkonen Tuomo
Publisher: Taylor & Francis Ltd
ISSN: 0233-1934
Source: Optimization, Vol.62, Iss.3, 2013-03, pp. : 345-377
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Primal-dual subgradient methods for convex problems
Mathematical Programming, Vol. 120, Iss. 1, 2009-08 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Dual versus primal-dual interior-point methods for linear and conic programming
By Todd M.
Mathematical Programming, Vol. 111, Iss. 1-2, 2008-01 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Primal-dual interior-point methods for PDE-constrained optimization
Mathematical Programming, Vol. 117, Iss. 1-2, 2009-03 ,pp. :