BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Nonlinear Programming and Variational Inequality Problems

Nonlinear Programming and Variational Inequality Problems

Nonlinear Programming and Variational Inequality Problems
Stock photo: cover may vary

Nonlinear Programming and Variational Inequality Problems Hardback - 1998 - 1999th Edition

by Patriksson, Michael,

Add to wish list
  • New
New

Description

new.
Ask the seller a question Add to wish list
A$249.22
A$5.82 Delivery within USA
Standard delivery: 2 to 14 days
More delivery options
Ships from GreatBookPrices (Maryland, United States)
The BIBLIO Guarantee

Details

  • Title Nonlinear Programming and Variational Inequality Problems
  • Author Patriksson, Michael,
  • Binding Hardback
  • Edition number 1999th
  • Edition 1999
  • Condition New
  • Pages 336
  • Volumes 1
  • Language ENG
  • Publisher Springer
  • Publication date 1998-11-30
  • Illustrated Yes
  • Features Bibliography, Illustrated, Index
  • Bookseller's Inventory # 756092-n
  • ISBN 9780792354550 / 0792354559
  • Weight 1.48 lbs (0.67 kg)
  • Dimensions 9.21 x 6.14 x 0.81 in (23.39 x 15.60 x 2.06 cm)
  • Category Mathematics
  • Library of Congress subjects Nonlinear programming, Variational inequalities (Mathematics)
  • Library of Congress Catalogue Number 98045184
  • Dewey Decimal Code 515.64
  • Quantity available 5

About GreatBookPrices Maryland, United States

Biblio member since 2024

Since 1991, we have worked every day to serve our customers with state-of-the-art technology and world class service. We are dedicated to providing customers around the world with the widest selection of books, DVDs, and CDs at the absolute lowest price.

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from GreatBookPrices

Reader reviews for Nonlinear Programming and Variational Inequality Problems

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

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.

First line

The variational inequality problem

Please wait a moment while we load the requested page.

tracking-