Discrete minimax problem: Algorithms and numerical comparisons

DOI10.1007/BF02241819MaRDI QIDQ1157881zbMATH OpenOpenAlexFDO

Authors 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

nonsmooth optimizationNewton methodminimax optimization

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3557086 (Why is no real title available?)
• scientific article; zbMATH DE number 3561062 (Why is no real title available?)
• scientific article; zbMATH DE number 3568377 (Why is no real title available?)
• scientific article; zbMATH DE number 3595804 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• Acceleration of the leastpth algorithm for minimax optimization with engineering applications
• An Algorithm for Constrained Optimization with Semismooth Functions
• An Efficient Method to Solve the Minimax Problem Directly
• An interior point method for nonlinear programming
• Constrained Optimization Using a Nondifferentiable Penalty Function
• Discrete, non-linear approximation problems in polyhedral norms
• Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm
• Linearly constrained minimax optimization
• Nonlinear programming using minimax techniques
• On convergence rates of subgradient optimization methods
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• Steplength algorithms for minimizing a class of nondifferentiable functions

This page was built for publication: Discrete minimax problem: Algorithms and numerical comparisons

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