A class of algorithms for large scale nonlinear minimax optimization

DOI10.1016/0096-3003(86)90004-4zbMath0595.65069OpenAlexW1975460412MaRDI QIDQ1077884

Suvrajeet Sen

Publication date: 1986

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(86)90004-4

zbMATH Keywords

global convergencesequential quadratic programmingnonlinear minimax problemSequential linear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites Work

• An Efficient Method to Solve the Minimax Problem Directly
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A class of algorithms for large scale nonlinear minimax optimization