Loading AI tools
Found in articles
Algorithme du gradient stochastique
lire en ligne) Krzysztof C. Kiwiel, « Convergence and efficiency of subgradient methods for quasiconvex minimization », Mathematical Programming (Series
Philadelphia. (en) K. C. Kiwiel (2001), « Convergence and efficiency of subgradient methods for quasiconvex minimization », Mathematical Programming (Series
Dualité (optimisation)
Larsson et P. O. Lindberg, « Lagrangian relaxation via ballstep subgradient methods », Mathematics of Operations Research, vol. 32, no 3, août 2007
Mathematics » (no 16), SIAM, Philadelphie, 1974, vi+74 p. (en) The Theory of Subgradients and its Applications to Problems of Optimization. Convex and Nonconvex
Philip Wolfe
« Validation of subgradient optimization », Mathematical Programming, vol. 6, 1974, p. 62 (DOI 10.1007/BF01580223) P. Wolfe, « The Simplex Method for Quadratic