New minimax algorithm

From MaRDI portal
Publication:1321280

DOI10.1007/BF00940496zbMath0792.90076MaRDI QIDQ1321280

V. Pereyra

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 problemsA sequential quadratic programming algorithm for nonlinear minimax problemsOn the entropic regularization method for solving min-max problems with applicationsA conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategyThe optimization technique for solving a class of non-differentiable programming based on neural network methodA hybrid algorithm for linearly constrained minimax problemsAlgorithms with adaptive smoothing for finite minimax problemsInexact smoothing method for large scale minimax optimizationA QP-free algorithm for finite minimax problemsA smoothing trust-region Newton-CG method for minimax problemA new objective penalty function approach for solving constrained minimax problemsA trust-region method by active-set strategy for general nonlinear optimizationA new superlinearly convergent SQP algorithm for nonlinear minimax problemsAn active-set algorithm and a trust-region approach in constrained minimax problemA hybrid algorithm for nonlinear minimax problemsA simplified recurrent neural network for pseudoconvex optimization subject to linear equality constraintsA smoothing iterative method for the finite minimax problemAn improved SQP algorithm for solving minimax problemsSolving min-max problems and linear semi-infinite programsA New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax ProblemA proximal-projection partial bundle method for convex constrained minimax problemsGeneralised monotone line search algorithm for degenerate nonlinear minimax problems



Cites Work


This page was built for publication: New minimax algorithm