Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems

DOI10.1007/BF00939216zbMath0595.90069MaRDI QIDQ1078076

B. George

Publication date: 1987

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

computational results; strongly convex; convergence proofs; dual gradient method; linearly constrained; separable mathematical programming

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

90C55: Methods of successive quadratic programming type