Skip to content

A subgradient method based on gradient sampling for solving convex optimization problems

Research output: Contribution to journalArticle

Based on the gradient sampling technique, we present a subgradient algorithm to solve the nondifferentiable convex optimization problem with an extended real-valued objective function. A feature of our algorithm is the approximation of subgradient at a point via random sampling of (relative) gradients at nearby points, and then taking convex combinations of these (relative) gradients. We prove that our algorithm converges to an optimal solution with probability 1. Numerical results demonstrate that our algorithm performs favourably compared with existing subgradient algorithms on applications considered.
Original languageEnglish
Pages (from-to)1559-1584
Number of pages35
JournalNumerical Functional Analysis and Optimization
Volume36
Issue number12
DOIs
Publication statusPublished - 1 Dec 2015

Documents

  • NFAOacceptedpaper

    Rights statement: This is an Accepted Manuscript of an article published by Taylor & Francis in Numerical Functional Analysis and Optimization Vol.36, Issue 12, available online: http://wwww.tandfonline.com/10.1080/01630563.2015.1086788.

    Accepted author manuscript (Post-print), 1.46 MB, PDF document

Related information

Relations Get citation (various referencing formats)

ID: 2848050