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

DOI10.1023/A:1026422013954MaRDI QIDQ5925720zbMATH OpenOpenAlexFDO

Authors K. A. Ariyawansa, 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

analytic centerscomplexityglobal 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)

Recommendations

• scientific article; zbMATH DE number 895368
• Algorithms and Computation
• Complexity of the min-max (regret) versions of min cut problems
• The complexity of constrained min-max optimization
• Complexity of the max cut problem with the minimal domination constraint
• Complexity analysis for certain convex programming problems
• Some results of convex programming complexity
• Approximation and intractability results for the maximum cut problem and its variants
• On the approximability of Max-Cut
• scientific article; zbMATH DE number 1496855

Cites work

• A cutting plane algorithm for convex programming that uses analytic centers
• A global Newton method. II: Analytic centers
• A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
• A new algorithm for minimizing convex functions over convex sets
• Feature Article—The Ellipsoid Method: A Survey
• scientific article; zbMATH DE number 4197759 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• On Vaidya's Volumetric Cutting Plane Method for Convex Programming
• Rates of convergence for a method of centers algorithm
• Subproblem and Overall Convergence for a Method-of-Centers Algorithm
• Translational cuts for convex minimization

Cited in

(3)

• Design, implementation, and analysis of maximum transversal algorithms
• On the complexity of the exchange algorithm for minimax optimization problems
• On solving large-scale finite minimax problems using exponential smoothing

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

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