On a feasible descent algorithm for solving min-max problems

DOI10.1007/3-540-62598-4_129MaRDI QIDQ6560297zbMATH OpenFDO

Authors Andrzej Stachurski

Publication date 21 June 2024

Full work available at URL https://doi.org/10.1007/3-540-62598-4_129

Mathematics Subject Classification ID

Optimality conditions for minimax problems (49K35) Nonlinear programming (90C30)

Recommendations

• Descent algorithm for a class of convex nondifferentiable functions
• scientific article; zbMATH DE number 67982
• scientific article; zbMATH DE number 686908
• A descent algorithm for nonsmooth convex optimization
• The method of feasible directions for minimax problems

This page was built for publication: On a feasible descent algorithm for solving min-max problems

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