The primal-dual algorithm as a constraint-set-manipulation device
From MaRDI portal
Publication:811396
DOI10.1007/BF01594943zbMath0734.90066MaRDI QIDQ811396
Publication date: 1991
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
primal-dual algorithm; linearly constrained optimization; image reconstruction from projections; asymptotic feasibility; constrained entropy maximization; constraint-set-manipulation; continuity of value functional; dual algorithmic operator
90C25: Convex programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Determination and interpretation of preferred orientation with texture goniometry: An application of indicators to maximum entropy pole- to orientation-density inversion, An interior point method with Bregman functions for the variational inequality problem with paramonotone operators, Proximal minimization algorithm with \(D\)-functions, Analogy and duality of texture analysis by harmonics or indicators