The primal-dual algorithm as a constraint-set-manipulation device

DOI10.1007/BF01594943zbMATH Open0734.90066OpenAlexW1986802959MaRDI QIDQ811396FDOQ811396

Authors: Arnold Lent, Yair Censor 

Publication date: 1991

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01594943

Recommendations

• A primal dual integer programming algorithm
• Primal and dual algorithms for optimization over the efficient set
• Primal-dual algorithms for the assignment problem
• The primal-dual method for approximation algorithms
• A primal-dual proximal point algorithm for constrained convex programs
• Parametric programming and the primal-dual algorithm
• Primal-dual method for optimization problems with changing constraints
• Primal-dual proximal point algorithm for linearly constrained convex programming problems
• A unified primal-dual algorithm framework for inequality constrained problems
• A primal-dual simplex method for linear programs

zbMATH Keywords

linearly constrained optimizationprimal-dual algorithmimage reconstruction from projectionsasymptotic feasibilityconstrained entropy maximizationconstraint-set-manipulationcontinuity of value functionaldual algorithmic operator

Mathematics Subject Classification ID

Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Title not available (Why is that?)
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• An iterative row-action method for interval convex programming
• Generalized Iterative Scaling for Log-Linear Models
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Entropy in linear programs
• Title not available (Why is that?)
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• A relaxed version of Bregman's method for convex programming
• On the continuity of the minimum set of a continuous function
• On the Convergence of Sequences of Convex Sets in Finite Dimensions
• Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
• On Perturbations in Systems of Linear Inequalities
• Title not available (Why is that?)
• Title not available (Why is that?)
• On some methods for entropy maximization and matrix scaling
• Mathematical optimization versus practical performance: A case study based on the maximum entropy criterion in image reconstruction
• Title not available (Why is that?)
• Optimization of “$\log x$” Entropy over Linear Equality Constraints
• A Comparative Assessment of Various Measures of Entropy
• Optimization of Burg's entropy over linear constraints
• On Block-Iterative Entropy Maximization

Cited In (8)

• An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
• Analogy and duality of texture analysis by harmonics or indicators
• Proximal minimization algorithm with \(D\)-functions
• An algebraic theory for primal and dual substructuring methods by constraints
• Limits of eventual families of sets with application to algorithms for the common fixed point problem
• A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils
• Determination and interpretation of preferred orientation with texture goniometry: An application of indicators to maximum entropy pole- to orientation-density inversion
• A primal-dual method for large-scale image reconstruction in emission tomography

This page was built for publication: The primal-dual algorithm as a constraint-set-manipulation device

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