On complexity of the translational-cut algorithm for convex minimax problems

DOI10.1023/A:1026422013954zbMath0969.90092OpenAlexW1795420581MaRDI QIDQ5925720

Ariyawansa, K. A., Jiang, P. L.

Publication date: 19 February 2001

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1026422013954

zbMATH Keywords

complexityanalytic centersglobal Newton methodinterprior-point methodsminimax optimization

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (1)

On solving large-scale finite minimax problems using exponential smoothing

Cites Work

• Rates of convergence for a method of centers algorithm
• A global Newton method. II: Analytic centers
• A new algorithm for minimizing convex functions over convex sets
• A cutting plane algorithm for convex programming that uses analytic centers
• Feature Article—The Ellipsoid Method: A Survey
• A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
• Subproblem and Overall Convergence for a Method-of-Centers Algorithm
• On Vaidya's Volumetric Cutting Plane Method for Convex Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On complexity of the translational-cut algorithm for convex minimax problems