Nondifferentiable optimization via approximation

This paper presents a systematic approach for minimization of a wide class of non-differentiable functions. The technique is based on approximation of the nondifferentiable function by a smooth function and is related to penalty and multiplier methods for constrained minimization. Some convergence results are given and the method is illustrated by means of examples from nonlinear programming.

[1]  Allen A. Goldstein,et al.  Constructive Real Analysis , 1967 .

[2]  M. J. D. Powell,et al.  Nonlinear Programming—Sequential Unconstrained Minimization Techniques , 1969 .

[3]  M. Powell.  A method for nonlinear constraints in minimization problems , 1969 .

[4]  Boris Polyak.  Minimization of unsmooth functionals , 1969 .

[5]  M. Hestenes.  Multiplier and gradient methods , 1969 .

[6]  D. Bertsekas,et al.  Steepest Descent for Optimization Problems with Nondifferentiable Cost Functionals , 1971 .

[7]  D. Bertsekas,et al.  A DESCENT NUMERICAL METHOD FOR OPTIMIZATION PROBLEMS WITH NONDIFFERENTIABLE COST FUNCTIONALS , 1973 .

[8]  R. Rockafellar.  The multiplier method of Hestenes and Powell applied to convex programming , 1973 .

[9]  D. Bertsekas,et al.  Multiplier methods for convex programming , 1973, CDC 1973.

[10]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[11]  Philip Wolfe,et al.  Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974, Math. Program..

[12]  Claude Lemaréchal,et al.  An Algorithm for Minimizing Convex Functions , 1974, IFIP Congress.

[13]  P. Wolfe.  Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974 .

[14]  D. Bertsekas.  ON PENALTY AND MULTIPLIER METHODS FOR CONSTRAINED MINIMIZATION , 1976 .

[15]  D. Bertsekas.  COMBINED PRIMAL-DUAL AND PENALTY METHODS FOR CONSTRAINED MINIMIZATION* , 1975 .

[16]  D. Bertsekas,et al.  Combined Primal–Dual and Penalty Methods for Convex Programming , 1976 .