COVID-19 Update: We are currently shipping orders daily. However, due to transit disruptions in some geographies, deliveries may be delayed. To provide all customers with timely access to content, we are offering 50% off Science and Technology Print & eBook bundle options. Terms & conditions.
Nonsmooth Optimization - 1st Edition - ISBN: 9780080234281, 9781483188768

Nonsmooth Optimization

1st Edition

Proceedings of a IIASA Workshop, March 28 - April 8, 1977

Editors: Claude Lemarechal Robert Mifflin
eBook ISBN: 9781483188768
Imprint: Pergamon
Published Date: 1st January 1978
Page Count: 194
Sales tax will be calculated at check-out Price includes VAT/GST
Price includes VAT/GST

Institutional Subscription

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free global shipping
No minimum order.


Nonsmooth Optimization contains the proceedings of a workshop on non-smooth optimization (NSO) held from March 28 to April 8,1977 in Austria under the auspices of the International Institute for Applied Systems Analysis. The papers explore the techniques and theory of NSO and cover topics ranging from systems of inequalities to smooth approximation of non-smooth functions, as well as quadratic programming and line searches. Comprised of nine chapters, this volume begins with a survey of Soviet research on subgradient optimization carried out since 1962, followed by a discussion on rates of convergence in subgradient optimization. The reader is then introduced to the method of subgradient optimization in an abstract setting and the minimal hypotheses required to ensure convergence; NSO and nonlinear programming; and bundle methods in NSO. A feasible descent algorithm for linearly constrained least squares problems is described. The book also considers sufficient minimization of piecewise-linear univariate functions before concluding with a description of the method of parametric decomposition in mathematical programming. This monograph will be of interest to mathematicians and mathematics students.

Table of Contents



Subgradient Methods: A Survey of Soviet Research

Nondifferentiable Optimization and the Relaxation Method

An Extension of the Method of Subgradients

Nonsmooth Optimization and Nonlinear Programming

Bundle Methods in Nonsmooth Optimization

A Feasible Descent Algorithm for Linearly Constrained Least Squares Problems

Sufficient Minimization of Piecewise-Linear Univanate Functions

The Method of Parametric Decomposition in Mathematical Programming: The Nonconvex Case

A Set of Nonsmooth Optimization Test Problems


Appendix: List of Participants


No. of pages:
© Pergamon 1978
1st January 1978
eBook ISBN:

About the Editors

Claude Lemarechal

Robert Mifflin

Ratings and Reviews