Abstract
A direct search method for nonlinear optimization problems with nonlinear inequality constraints is presented. A filter based approach is used, which allows infeasible starting points. The constraints are assumed to be continuously differentiable, and approximations to the constraint gradients are used. For simplicity it is assumed that the active constraint normals are linearly independent at all points of interest on the boundary of the feasible region. An infinite sequence of iterates is generated, some of which are surrounded by sets of points called bent frames. An infinite subsequence of these iterates is identified, and its convergence properties are studied by applying Clarke's non-smooth calculus to the bent frames. It is shown that each cluster point of this subsequence is a Karush-Kuhn-Tucker point of the optimization problem under mild conditions which include strict differentiability of the objective function at each cluster point. This permits the objective function to be non-smooth, infinite, or undefined away from these cluster points. When the objective function is only locally Lipschitz at these cluster points it is shown that certain directions still have interesting properties at these cluster points.
Similar content being viewed by others
References
C. Audet and J. E. Dennis Jr, “A pattern search filter method for nonlinear programming without derivatives,” SIAM Journal on Optimization vol. 13, pp. 889–903, 2003.
F. H. Clarke, “Optimization and Non-Smooth Analysis, SIAM Classics in Applied Mathematics, 1990.
I. D. Coope and C. J. Price, “Frame based methods for unconstrained optimization,” Journal of Optimization Theory and Applications vol. 107, pp. 261–274, 2000.
C. Davis, “Theory of positive linear dependence,” American Journal of Mathematics vol. 76, pp. 733–746, 1954.
R. Fletcher, Practical Methods of Optimization,” J. Wiley and Sons, 1987.
R. Fletcher and S. Leyffer, “Nonlinear programming without a penalty function,” Math. Prog. Series A vol. 91, pp. 239–269, 2002.
R. Fletcher, S. Leyffer, and P. L. Toint, “On the global convergence of a filter-SQP algorithm,” SIAM Journal on Optimization vol. 13, pp. 44–59, 2002.
M. R. Hestenes, “Multiplier and gradient methods,” Journal of Optimization Theory and Applications vol. 4, pp. 303–320, 1969.
W. M. Jenkins, “A decimal coded evolutionary algorithm for constrained optimization,” Comput. and Structures vol. 80, pp. 471–480, 2002.
J. H. Kim and H. Myung, “A two-phase evolutionary programming for general constrained optimization problem,” in Evolutionary Programming V, MIT Press, 1996, pp. 295–304.
R. M. Lewis and V. Torczon, “Pattern search algorithms for bound constrained optimization,” SIAM Journal on Optimization vol. 9, pp. 1082–1099, 1999.
R. M. Lewis and V. Torczon, “A globally convergent augmented Lagrangian pattern search algorithm for optimization with general constraints and simple bounds,” SIAM Journal on Optimization vol. 12, pp. 1075–1089, 2002.
S. Lucidi, M. Sciandrone, and P. Tseng, “Objective-derivative-free methods for constrained optimization,” Math. Prog. Series A vol. 92, pp. 37–59, 2002.
M. J. D. Powell, “A method for nonlinear constraints in minimization problems,” in Optimization, R. Fletcher, ed., Academic Press: London.
H. Peng, Z. Z. Feng, and L. H. Yan, “A comparison of evolutionary strategies and hybrid evolutionary strategies for constrained optimization problems,” Chinese Journal of Numerical Mathematics and Applications vol. 20, pp. 55–60, 1998.
C. J. Price and I. D. Coope, “Frame based ray search algorithms in unconstrained optimization,” Journal of Optimization Theory and Applications vol. 116, pp. 359–377, 2003.
C. J. Price and I. D. Coope, “Frames and grids in unconstrained and linearly constrained optimization: A nonsmooth approach,” SIAM Journal on Optimization vol. 14, pp. 415–438, 2003.
J. van Tiel, Convex Analysis, J. Wiley and Sons, 1984.
V. Torczon, “On the convergence of pattern search algorithms,” SIAM Journal on Optimization vol. 7, pp. 1–25, 1997.
W.-C. Yu and Y.-X. Li, “A direct search method by the local positive basis for the nonlinearly constrained optimization,” Chinese Annals of Mathematics vol. 2, pp. 269–280, 1981.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dennis, J.E., Price, C.J. & Coope, I.D. Direct Search Methods for Nonlinearly Constrained Optimization Using Filters and Frames. Optimization and Engineering 5, 123–144 (2004). https://doi.org/10.1023/B:OPTE.0000033371.04406.e0
Issue Date:
DOI: https://doi.org/10.1023/B:OPTE.0000033371.04406.e0