Chapter VII Nondifferentiable optimization

[1]  Krzysztof C. Kiwiel,et al.  Proximity control in bundle methods for convex nondifferentiable minimization , 1990, Math. Program..

[2]  C. Lemaréchal.  Nondifferentiable optimization , 1989 .

[3]  M. Overton,et al.  On minimizing the spectral radius of a nonsymmetric matrix function: optimality conditions and duality theory , 1988 .

[4]  M. Overton.  On minimizing the maximum eigenvalue of a symmetric matrix , 1988 .

[5]  Andrzej Ruszczynski,et al.  A Linearization Method for Nonsmooth Stochastic Programming Problems , 1987, Math. Oper. Res..

[6]  G. Sonnevend.  A NEW METHOD FOR SOLVING A SET OF LINEAR (CONVEX) INEQUALITIES AND ITS APPLICATIONS , 1987 .

[7]  J. Zowe,et al.  Approximation to a set-valued mapping, I: A proposal , 1986 .

[8]  C. Lemaréchal,et al.  An introduction to the theory of nonsmooth optimization , 1986 .

[9]  Alberto Seeger.  Analyse du second ordre de problèmes non différentiables , 1986 .

[10]  Jean-Baptiste Hiriart-Urruty,et al.  A new set-valued second-order derivative for convex functions , 1986 .

[11]  M. Goursat,et al.  Stochastic gradient methods for optimizing electrical transportation networks , 1986 .

[12]  P. Mahey.  Méthodes de décomposition et décentralisation en programmation linéaire , 1986 .

[13]  V. F. Dem'yanov,et al.  Nondifferentiable Optimization , 1985 .

[14]  Nondifferentiable Optimization Problems for Elliptic Systems , 1985 .

[15]  R. Fletcher.  Semi-Definite Matrix Constraints in Optimization , 1985 .

[16]  K. Kiwiel.  Methods of Descent for Nondifferentiable Optimization , 1985 .

[17]  G. Sonnevend.  A Modified Ellipsoid Method for the Minimization of Convex Functions with Superlinear Convergence (or Finite Termination) for Well-Conditioned C3 Smooth (or Piecewise Linear) Functions , 1985 .

[18]  J. J. Strodiot,et al.  Bundle Methods, Cutting-Plane Algorithms and σ-Newton Directions , 1985 .

[19]  A. Bihain.  Optimization of upper semidifferentiable functions , 1984 .

[20]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[21]  Jean-Paul Penot,et al.  Differentiability of Relations and Differential Stability of Perturbed Optimization Problems , 1984 .

[22]  P. Neittaanmäki,et al.  On the finite element approximation of the boundary control for two-phase stefan problems , 1984 .

[23]  Krzysztof C. Kiwiel,et al.  An aggregate subgradient method for nonsmooth convex minimization , 1983, Math. Program..

[24]  J. Zowe,et al.  Some remarks on the construction of higher order algorithms in convex optimization , 1983 .

[25]  Jiří V. Outrata,et al.  On a class of nonsmooth optimal control problems , 1983 .

[26]  John Darzentas,et al.  Problem Complexity and Method Efficiency in Optimization , 1983 .

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

[28]  Alfred Auslender.  On the differential properties of the support function of the∈-subdifferential of a convex function , 1982, Math. Program..

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

[30]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

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

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

[33]  D. Bertsekas,et al.  Optimal short-term scheduling of large-scale power systems , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[34]  C. Lemaréchal,et al.  ON A BUNDLE ALGORITHM FOR NONSMOOTH OPTIMIZATION , 1981 .

[35]  R. Meyer,et al.  Secant approximation methods for convex optimization , 1981 .

[36]  G. Alistair Watson,et al.  First and second order conditions for a class of nondifferentiable optimization problems , 1980, Math. Program..

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

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

[39]  E. A. Nurminskii,et al.  ∈-Quasigradient method for solving nonsmooth extremal problems , 1977, Cybernetics.

[40]  A. M. Gupal,et al.  A method for the minimization of almost-differentiable functions , 1977 .

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

[42]  P. Wolfe,et al.  The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices , 1975 .

[43]  W. D. Northup,et al.  USING DUALITY TO SOLVE DISCRETE OPTIMIZATION PROBLEMS: THEORY AND COMPUTATIONAL EXPERIENCE* , 1975 .

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

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

[46]  Albert Feuer.  An implementable mathematical programming algorithm for admissible-fundamental functions. , 1974 .

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

[48]  William Hogan,et al.  Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case , 1973, Oper. Res..

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

[50]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

[51]  Gary J. Silverman,et al.  Primal Decomposition of Mathematical Programs by Resource Allocation: I - Basic Theory and a Direction-Finding Procedure , 1972, Oper. Res..

[52]  N. Z. Shor,et al.  A minimization method using the operation of extension of the space in the direction of the difference of two successive gradients , 1971 .

[53]  A. M. Geoffrion.  Duality in Nonlinear Programming: A Simplified Applications-Oriented Development , 1971 .

[54]  Arthur M. Geoffrion,et al.  Elements of Large-Scale Mathematical Programming Part I: Concepts , 1970 .

[55]  Arthur M. Geoffrion,et al.  Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems , 1970, Oper. Res..

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

[57]  J. Danskin.  The Theory of Max-Min, with Applications , 1966 .

[58]  Bùi-Trong-Liêu,et al.  La mèthode des centres dans un espace topologique , 1966 .

[59]  Tosio Kato.  Perturbation theory for linear operators , 1966 .

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

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

[62]  S. Agmon.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

[63]  I. J. Schoenberg,et al.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.