A quadratic approximation method for minimizing a class of quasidifferentiable functions

SummaryAn unconstrained nonlinear programming problem with nondifferentiabilities is considered. The nondifferentiabilities arise from terms of the form max [f1(x), ...,fn(x)], which may enter nonlinearly in the objective function. Local convex polyhedral upper approximations to the objective function are introduced. These approximations are used in an iterative method for solving the problem. The algorithm proceeds by solving quadratic programming subproblems to generate search directions. Approximate line searches ensure global convergence of the method to stationary points. The algorithm is conceptually simple and easy to implement. It generalizes efficient variable metric methods for minimax calculations.

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

[2]  Robert Mifflin.  Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization , 1984, Math. Program..

[3]  F. Clarke.  Generalized gradients and applications , 1975 .

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

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

[6]  M. J. D. Powell,et al.  Algorithms for nonlinear constraints that use lagrangian functions , 1978, Math. Program..

[7]  S. P. Han,et al.  Variable metric methods for minimizing a class of nondifferentiable functions , 1977, Math. Program..

[8]  D. Bertsekas.  Approximation procedures based on the method of multipliers , 1977 .

[9]  C. Lemaréchal,et al.  The watchdog technique for forcing convergence in algorithms for constrained optimization , 1982 .

[10]  D. Bertsekas.  Nondifferentiable optimization via approximation , 1975 .

[11]  V. F. Demʹi︠a︡nov,et al.  Introduction to minimax , 1976 .

[12]  R. Fletcher.  A model algorithm for composite nondifferentiable optimization problems , 1982 .

[13]  A. Wierzbicki.  Lagrangian functions and nondifferentiable optimization , 1978 .

[14]  Krzysztof C. Kiwiel,et al.  A Linearization Algorithm for Nonsmooth Minimization , 1985, Math. Oper. Res..

[15]  Antony R. Unwin.  Progress in Nondifferentiable Optimisation , 1983 .

[16]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[17]  Kaj Madsen,et al.  Linearly constrained minimax optimization , 1978, Math. Program..

[18]  G. Papavassilopoulos.  Algorithms for a class of nondifferentiable problems , 1981 .

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

[20]  Claude Lemaréchal,et al.  Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions , 1982, Math. Program..

[21]  R. Mifflin.  A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization , 1982 .

[22]  A. Auslender.  MINIMISATION DE FONCTIONS LOCALEMENT LIPSCHITZIENNES: APPLICATIONS A LA PROGRAMMATION MI-CONVEXE, MI-DIFFERENTIABLE , 1978 .

[23]  G. Watson.  The Minimax Solution of an Overdetermined System of Non-linear Equations , 1979 .

[24]  A. Ben-Tal,et al.  Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems , 1982, Math. Program..

[25]  V. F. Demʹi︠a︡nov,et al.  Introduction to minimax , 1976 .

[26]  M. Vidyasagar,et al.  An Algorithm for $l_1 $-Norm Minimization with Application to Nonlinear $l_1 $-Approximation , 1979 .

[27]  E. Polak,et al.  Computational methods in optimization : a unified approach , 1972 .

[28]  B. N. Pshenichnyi,et al.  Numerical Methods in Extremal Problems. , 1978 .

[29]  Olvi L. Mangasarian,et al.  Exact penalty functions in nonlinear programming , 1979, Math. Program..