An iterative parallel method for minimax problems

MaRDI QIDQ4615936zbMATH OpenFDO

Authors José Marcos Lopes

Publication date 29 January 2019

Full work available at URL http://jaguar.fcav.unesp.br/RME/fasciculos/v21/v21_n3/A2_Jose_Marcos.pdf

zbMATH Keywords

linear systemsminimum normparallel iterative methodsrow-relaxation methodssparse matrix

Mathematics Subject Classification ID

Minimax procedures in statistical decision theory (62C20) Linear regression; mixed models (62J05)

Recommendations

• A proximal point algorithm for minimax problems
• A row relaxation method for large minimax problems
• scientific article; zbMATH DE number 871324
• scientific article; zbMATH DE number 97998
• scientific article; zbMATH DE number 1960943

Cited in

(8)

• A parallel cost-optimal algorithm to compute the supremum of max-min powers
• A proximal point algorithm for minimax problems
• A parallel minimization algorithm based on a 1 homogeneous model
• A global minimization algorithm with parallel iterations
• scientific article; zbMATH DE number 1109408 (Why is no real title available?)
• Parallel minimax search for a maximum
• Two iterative algorithms for finding minimax solutions
• Connections between Basarab and Buchsteiner loops

This page was built for publication: An iterative parallel method for minimax problems

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