Dualität und Approximation bei konvexen Optimierungsproblemen

DOI10.1002/ZAMM.19780581007MaRDI QIDQ4180171zbMATH OpenOpenAlexFDO

Authors Uwe Mackenroth

Publication date 1978

Published in ZAMM - Zeitschrift für Angewandte Mathematik und Mechanik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/zamm.19780581007

zbMATH Keywords

Banach SpacesConvex Programming in Abstract SpacesDuality

Mathematics Subject Classification ID

Convex programming (90C25) Mathematical programming (90C99)

Cited in

(3)

• Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems
• Easy transportation-like problems on K-dimensional arrays
• Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm

This page was built for publication: Dualität und Approximation bei konvexen Optimierungsproblemen

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4180171)