Subproblem and Overall Convergence for a Method-of-Centers Algorithm

DOI10.1287/opre.23.4.796zbMath0322.90050OpenAlexW2138835480MaRDI QIDQ4085501

Robert Mifflin

Publication date: 1975

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.23.4.796

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items

Algorithms for a class of nondifferentiable problems, On complexity of the translational-cut algorithm for convex minimax problems, Rates of convergence for a method of centers algorithm, Linearly constrained minimax optimization