Complexity of smooth convex programming and its applications

MaRDI QIDQ2743966zbMATH OpenFDO

Authors Osman Güler

Publication date 18 September 2001

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)

Cited in

(2)

• Projected subgradient minimization versus superiorization
• Newton method for solving a class of smooth convex programming

This page was built for publication: Complexity of smooth convex programming and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2743966)