Answers are grounded in this paper and cite their sources.
In this paper we consider the numerical solution of convex optimization problems with nondifferentiable cost functionals. We propose a new algorithm, the ε-subradient method, a large step, double iterative algorithm which converges rapidly under very general assumptions. We discuss the application of the algorithm in some problems of nonlinear programming and optimal control and we show that the ε-subgradient method contains as a special case a minimax algorithm due to Pshenichnyi [5].
No takes yet. Share an insight, caveat, or question.
Bertsekas et al. (1973) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: