Primal-dual first-order methods with $${\mathcal {O}(1/\epsilon)}$$ iteration-complexity for cone programming - Concepedia

Concepedia

Publication | Closed Access

Primal-dual first-order methods with $${\mathcal {O}(1/\epsilon)}$$ iteration-complexity for cone programming

152

Citations

12

References

2009

Year

Guanghui Lan, Zhaosong Lu, Renato D. C. Monteiro

Mathematical Programming

Mathematical ProgrammingNumerical AnalysisEngineeringConvex OptimizationComputational ComplexityComputer ScienceLinear ProgrammingCone Programming

References

	Year	Citations

Page 1