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

DOI10.1287/OPRE.23.4.796MaRDI QIDQ4085501zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(4)

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

This page was built for publication: Subproblem and Overall Convergence for a Method-of-Centers Algorithm

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