⌘+K

Pulse Explore Clubs Researchers Journals

Home Clubs Explore

January 1, 2004SIAM Journal on Optimization

Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization

View Full Paper

Ask AI

Bookmark

Share

Authors

KKKrzysztof C. KiwielWarsaw School of Information Technology

Discussion

Loading...

Member takes

Implication

Key Points

Key points are not available for this paper at this time.

Cite This Study

Krzysztof C. Kiwiel (2004) studied this question.

synapsesocial.com/papers/6a13c9873a5f1273984296df https://doi.org/10.1137/s1052623400376366

View Full Paper

Ask AI

Bookmark

Share

Also Consider

Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context:

1The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions1996 · 46 citations
2Mathematical Programming: Theory and Algorithms.1987 · 571 citations
3A class of unconstrained minimization methods for neural network training1994 · 57 citations
4Analysis of an approximate gradient projection method with applications to the backpropagation algorithm1994 · 83 citations