Answers are grounded in this paper and cite their sources.
This paper is concerned with the problem min \ f(x) x ∈ X\ where X is a convex subset of a linear space H, and f is a smooth real-valued function on H. We propose the class of methods xk + 1 = P(xₖ - α ₖ gₖ ), where P denotes projection on X with respect to a Hilbert space norm \| · \| , gₖ denotes the Frechet derivative of f at xₖ with respect to another Hilbert space norm \| · \|ₖ on H, and α ₖ is a positive scalar stepsize. We thus remove an important restriction in the original proposal of Goldstein [1] and Levitin and Poljak [2], where the norms \| · \| and \| · \|ₖ must be the same. It is therefore possible to match the norm \| · \| with the structure of X so that the projection operation is simplified while at the same time reserving the option to choose \| · \|ₖon the basis of approximations to the Hessian of f so as to attain a typically superlinear rate of convergence. The resulting methods are particularly attractive for large-scale problems with specially structured constraint sets such as optimal control and nonlinear multi-commodity network flow problems. The latter class of problems is discussed in some detail.
No takes yet. Share an insight, caveat, or question.
Gafni et al. (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: