New minimax algorithm
From MaRDI portal
Publication:1321280
DOI10.1007/BF00940496zbMath0792.90076MaRDI QIDQ1321280
Publication date: 27 April 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items (22)
A modified SQP algorithm for minimax problems ⋮ A sequential quadratic programming algorithm for nonlinear minimax problems ⋮ On the entropic regularization method for solving min-max problems with applications ⋮ A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy ⋮ The optimization technique for solving a class of non-differentiable programming based on neural network method ⋮ A hybrid algorithm for linearly constrained minimax problems ⋮ Algorithms with adaptive smoothing for finite minimax problems ⋮ Inexact smoothing method for large scale minimax optimization ⋮ A QP-free algorithm for finite minimax problems ⋮ A smoothing trust-region Newton-CG method for minimax problem ⋮ A new objective penalty function approach for solving constrained minimax problems ⋮ A trust-region method by active-set strategy for general nonlinear optimization ⋮ A new superlinearly convergent SQP algorithm for nonlinear minimax problems ⋮ An active-set algorithm and a trust-region approach in constrained minimax problem ⋮ A hybrid algorithm for nonlinear minimax problems ⋮ A simplified recurrent neural network for pseudoconvex optimization subject to linear equality constraints ⋮ A smoothing iterative method for the finite minimax problem ⋮ An improved SQP algorithm for solving minimax problems ⋮ Solving min-max problems and linear semi-infinite programs ⋮ A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem ⋮ A proximal-projection partial bundle method for convex constrained minimax problems ⋮ Generalised monotone line search algorithm for degenerate nonlinear minimax problems
Cites Work
This page was built for publication: New minimax algorithm