Discrete minimax problem: Algorithms and numerical comparisons

DOI10.1007/BF02241819zbMath0472.65058OpenAlexW387808109MaRDI QIDQ1157881

S. H. Smith

Publication date: 1982

Published in: Computing (Search for Journal in Brave)

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

zbMATH Keywords

minimax optimizationnonsmooth optimizationNewton method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Existence of solutions for minimax problems (49J35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steplength algorithms for minimizing a class of nondifferentiable functions
• Discrete, non-linear approximation problems in polyhedral norms
• Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm
• Nonlinear programming using minimax techniques
• Acceleration of the leastpth algorithm for minimax optimization with engineering applications
• On convergence rates of subgradient optimization methods
• Linearly constrained minimax optimization
• An Efficient Method to Solve the Minimax Problem Directly
• An Algorithm for Constrained Optimization with Semismooth Functions
• An interior point method for nonlinear programming
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• Constrained Optimization Using a Nondifferentiable Penalty Function