A nonmonotone adaptive steepest descent algorithm is claimed to converge for nonconvex minimax and multiobjective problems, but the supporting proofs are invalid as written.
An efficient method to solve the minimax problem directly
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems
A nonmonotone adaptive steepest descent algorithm is claimed to converge for nonconvex minimax and multiobjective problems, but the supporting proofs are invalid as written.