Skip to main content
SpringerLink
Log in

The Linearization Method for Constrained Optimization

  • Book
  • © 1994

Overview

Authors:
  1. Boris N. Pshenichnyj

    1. Institute of Cybernetics of the Academy of the Ukrainian SSR, Kiev - 207, Ukraina, CIS

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Springer Series in Computational Mathematics (SSCM, volume 22)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (3 chapters)

  1. Front Matter

    Pages i-viii
    Download chapter PDF

  2. Convex and Quadratic Programming

    • Boris N. Pshenichnyj
    Pages 1-42

  3. The Linearization Method

    • Boris N. Pshenichnyj
    Pages 43-97

  4. The Discrete Minimax Problem and Algorithms

    • Boris N. Pshenichnyj
    Pages 99-141

  5. Back Matter

    Pages 143-150
    Download chapter PDF
Back to top

Keywords

About this book

Techniques of optimization are applied in many problems in economics, automatic control, engineering, etc. and a wealth of literature is devoted to this subject. The first computer applications involved linear programming problems with simp- le structure and comparatively uncomplicated nonlinear pro- blems: These could be solved readily with the computational power of existing machines, more than 20 years ago. Problems of increasing size and nonlinear complexity made it necessa- ry to develop a complete new arsenal of methods for obtai- ning numerical results in a reasonable time. The lineariza- tion method is one of the fruits of this research of the last 20 years. It is closely related to Newton's method for solving systems of linear equations, to penalty function me- thods and to methods of nondifferentiable optimization. It requires the efficient solution of quadratic programming problems and this leads to a connection with conjugate gra- dient methods and variable metrics. This book, written by one of the leading specialists of optimization theory, sets out to provide - for a wide readership including engineers, economists and optimization specialists, from graduate student level on - a brief yet quite complete exposition of this most effective method of solution of optimization problems.

Authors and Affiliations

  • Institute of Cybernetics of the Academy of the Ukrainian SSR, Kiev - 207, Ukraina, CIS

    Boris N. Pshenichnyj

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation