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
Tax/VAT will be calculated at check-out Price includes VAT (GST)
30% off
30% off
30% off
30% off
30% off
20% off
20% off
30% off
30% off
30% off
30% off
30% off
20% off
20% off
30% off
30% off
30% off
30% off
30% off
20% off
20% off
19.99
13.99
13.99
13.99
13.99
13.99
15.99
15.99
31.95
22.36
22.36
22.36
22.36
22.36
25.56
25.56
24.95
17.46
17.46
17.46
17.46
17.46
19.96
19.96
Unavailable
Price includes VAT (GST)
× DRM-Free

Easy - Download and start reading immediately. There’s no activation process to access eBooks; all eBooks are fully searchable, and enabled for copying, pasting, and printing.

Flexible - Read on multiple operating systems and devices. Easily read eBooks on smart phones, computers, or any eBook readers, including Kindle.

Open - Buy once, receive and download all available eBook formats, including PDF, EPUB, and Mobi (for Kindle).

Institutional Access

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free global shipping
No minimum order.

Description

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


Preface

Introduction

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

Bibliography

Appendix: List of Participants

Details

No. of pages:
194
Language:
English
Copyright:
© Pergamon 1978
Published:
Imprint:
Pergamon
eBook ISBN:
9781483188768

About the Editor

Claude Lemarechal

Robert Mifflin