ON A BUNDLE ALGORITHM FOR NONSMOOTH OPTIMIZATION

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

[2]  Claude Lemaréchal,et al.  A view of line-searches , 1981 .

[3]  Christakis Charalambous,et al.  Acceleration of the leastpth algorithm for minimax optimization with engineering applications , 1979, Math. Program..

[4]  Robert Mifflin,et al.  A stable method for solving certain constrained least squares problems , 1979, Math. Program..

[5]  Michael A. Saunders,et al.  Large-scale linearly constrained optimization , 1978, Math. Program..

[6]  Timothy J. Lowe,et al.  A subgradient algorithm for certain minimax and minisum problems , 1978, Math. Program..

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

[8]  C. Lemaréchal Nonsmooth Optimization and Descent Methods , 1978 .

[9]  R. Mifflin Semismooth and Semiconvex Functions in Constrained Optimization , 1977 .

[10]  Robert Mifflin,et al.  An Algorithm for Constrained Optimization with Semismooth Functions , 1977, Math. Oper. Res..

[11]  Frank H. Clarke,et al.  A New Approach to Lagrange Multipliers , 1976, Math. Oper. Res..

[12]  R. E. Marsten,et al.  The Boxstep Method for Large-Scale Optimization , 2011, Oper. Res..

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

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

[15]  Klaus Ritter,et al.  A superlinearly convergent method for minimization problems with linear inequality constraints , 1973, Math. Program..

[16]  N. Z. Shor Utilization of the operation of space dilatation in the minimization of convex functions , 1972 .

[17]  N. Z. Shor,et al.  Solution of minimax problems by the method of generalized gradient descent with dilatation of the space , 1972 .

[18]  Vladimir F. Demjanov Algorithms for Some Minimax Problems , 1968, J. Comput. Syst. Sci..

[19]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[20]  A. A. Goldstein,et al.  Newton's method for convex programming and Tchebycheff approximation , 1959, Numerische Mathematik.

[21]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .