论文信息 - A note on ‘new algorithms for constrained minimax optimization’

A note on ‘new algorithms for constrained minimax optimization’

An unconstrained minimax algorithm of Charalambous and Conn is easily modified to solve the constrained case. Here we present some numerical results and find that this algorithm compares favourably to those of Dutta and Vidyasagar.

T. F. Coleman

[1] C. Charalambous,et al. New Algorithms for Network Optimization , 1973 .

[2] A. Conn,et al. Optimization of Microwave Networks (Short Papers) , 1975 .

[3] T. Pietrzykowski,et al. A Penalty Function Method Converging Directly to a Constrained Optimum , 1977 .

[4] Mathukumalli Vidyasagar,et al. New algorithms for constrained minimax optimization , 1977, Math. Program..

[5] A. Conn,et al. An Efficient Method to Solve the Minimax Problem Directly , 1978 .