Solving nonlinear programming problems with very many constraints

For solving the smooth constrained nonlinear programming problem, sequential quadratic programming (SQP) methods are considered to be the standard tool, as long as they are applicable. However one possible situation preventing the successful solution by a standard SQP-technique, arises if problems with a very large number of constraints are to be solved. Typical applications are semi-infinite or min-max optimization, optimal control or mechanical structural optimization. The proposed technique proceeds from a user defined number of linearized constraints, that is to be used internally to determine the size of the quadratic programming subproblem. Significant constraints are then selected automatically by the algorithm. Details of the numerical implementation and some experimental results are presented

[1]  Shih-Ping Han.  A globally convergent method for nonlinear programming , 1975 .

[2]  Shih-Ping Han,et al.  Superlinearly convergent variable metric algorithms for general nonlinear programming problems , 1976, Math. Program..

[3]  M. J. D. Powell,et al.  A fast algorithm for nonlinearly constrained optimization calculations , 1978 .

[4]  M. J. D. Powell,et al.  THE CONVERGENCE OF VARIABLE METRIC METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION CALCULATIONS , 1978 .

[5]  Klaus Schittkowski,et al.  Nonlinear programming codes , 1980 .

[6]  Kaj Madsen,et al.  Combined lp and quasi-Newton methods for minimax optimization , 1981, Math. Program..

[7]  Philip E. Gill,et al.  Practical optimization , 1981 .

[8]  K. Schittkowski.  On the Convergence of a Sequential Quadratic Programming Method with an Augmented Lagrangian Line Search Functions. , 1982 .

[9]  Donald Goldfarb,et al.  A numerically stable dual method for solving strictly convex quadratic programs , 1983, Math. Program..

[10]  Michael A. Saunders,et al.  User''s guide for NPSOL (Ver-sion 4.0): A FORTRAN package for nonlinear programming , 1984 .

[11]  M. Powell.  On the quadratic programming algorithm of Goldfarb and Idnani , 1985 .

[12]  K. Schittkowski.  NLPQL: A fortran subroutine solving constrained nonlinear programming problems , 1986 .

[13]  P. Gill,et al.  Fortran package for nonlinear programming. User's Guide for NPSOL (Version 4. 0) , 1986 .

[14]  M. Fukushima,et al.  A comparative study of several semi-infinite nonlinear programming algorithms , 1988 .