Skip to main content
SpringerLink
Log in
Book cover

Nonlinear Programming and Variational Inequality Problems

A Unified Approach

  • Book
  • © 1999

Overview

Authors:
  1. Michael Patriksson

    1. Chalmers University of Technology, Gothenburg, Sweden

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Applied Optimization (APOP, volume 23)

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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 (9 chapters)

  1. Front Matter

    Pages i-xiv
    Download chapter PDF

  2. Introduction

    • Michael Patriksson
    Pages 1-38

  3. Technical preliminaries

    • Michael Patriksson
    Pages 39-56

  4. Instances of the cost approximation algorithm

    • Michael Patriksson
    Pages 57-93

  5. Merit functions for variational inequality problems

    • Michael Patriksson
    Pages 95-133

  6. Convergence of the CA algorithm for nonlinear programs

    • Michael Patriksson
    Pages 135-168

  7. Convergence of the CA algorithm for variational inequality problems

    • Michael Patriksson
    Pages 169-189

  8. Finite identification of active constraints and of solutions

    • Michael Patriksson
    Pages 191-209

  9. Parallel and sequential decomposition CA algorithms

    • Michael Patriksson
    Pages 211-251

  10. A column generation / simplicial decomposition algorithm

    • Michael Patriksson
    Pages 253-276

  11. Back Matter

    Pages 277-336
    Download chapter PDF
Back to top

Keywords

About this book

Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather differently, are closely related to each other. This book is meant to help the reader understand and relate algorithms to each other in some intuitive fashion, and represents, in this respect, a consolidation of the field. The framework of algorithms presented in this book is called Cost Approxi­ mation. (The preface of the Ph.D. thesis [Pat93d] explains the background to the work that lead to the thesis, and ultimately to this book.) It describes, for a given formulation of a variational inequality or nonlinear programming problem, an algorithm by means of approximating mappings and problems, a principle for the update of the iteration points, and a merit function which guides and monitors the convergence of the algorithm. One purpose of this book is to offer this framework as an intuitively appeal­ ing tool for describing an algorithm. One of the advantages of the framework, or any reasonable framework for that matter, is that two algorithms may be easily related and compared through its use. This framework is particular in that it covers a vast number of methods, while still being fairly detailed; the level of abstraction is in fact the same as that of the original problem statement.

Authors and Affiliations

  • Chalmers University of Technology, Gothenburg, Sweden

    Michael Patriksson

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation