AN ELLIPSOID ALGORITHM FOR THE OPTIMUM DESIGN OF MAGNETOSTATIC PROBLEMS

An ellipsoid algorithm for solving nonlinear programming problems is described, whose objective and constraints functions are convex and are not assumed to be differentiable. The original ellipsoid algorithm was suggested by ludin and Nemirovskii and used by Shor for solving convex nonlinear programming problems. This paper suggests some modifications to the basic ellipsoid algorithm to adapt it to magnetostatic applications. One way to do this is to control the new ellipsoid at each iteration to generate smaller ellipsoids and to speedup the basic algorithm. Finally, illustrative examples show the applicability of the method to solving constrained nonlinear optimization problems in magnetostatic.