Nonlinear Programming - 1st Edition - ISBN: 9780125970501, 9781483272467

Nonlinear Programming

1st Edition

Proceedings of a Symposium Conducted by the Mathematics Research Center, the University of Wisconsin, Madison, May 4-6, 1970

Editors: J. B. Rosen O. L. Mangasarian K. Ritter
eBook ISBN: 9781483272467
Imprint: Academic Press
Published Date: 28th January 1970
Page Count: 502
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
93.95
65.77
65.77
65.77
65.77
65.77
75.16
75.16
70.95
49.66
49.66
49.66
49.66
49.66
56.76
56.76
56.99
39.89
39.89
39.89
39.89
39.89
45.59
45.59
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

Nonlinear Programming contains the proceedings of a Symposium on Nonlinear Programming held in Madison, Wisconsin on May 4-6, 1970.

This book emphasizes algorithms and related theories that lead to efficient computational methods for solving nonlinear programming problems. This compilation consists of 17 chapters. Chapters 1 to 9 are concerned primarily with computational algorithms, while Chapters 10 to 13 are devoted to theoretical aspects of nonlinear programming. Certain applications of nonlinear programming are considered in Chapters 14 to 17. The algorithms for nonlinear constraint problems, investigation of convergence rates, and use of nonlinear programming for approximation are also covered in this text.

This publication is a good source for students and researchers concerned with nonlinear programming.

Table of Contents


Foreword

Preface

A Method of Centers by Upper-Bounding Functions with Applications

A New Algorithm for Unconstrained Optimization

A Class of Methods for Nonlinear Programming II Computational Experience

Some Algorithms Based on the Principle of Feasible Directions

Numerical Techniques in Mathematical Programming

A Superlinearly Convergent Method for Unconstrained Minimization

A Second Order Method for the Linearly Constrained Nonlinear Programming Problem

Convergent Step-Sizes for Gradient-Like Feasible Direction Algorithms for Constrained Optimization

On the Implementation of Conceptual Algorithms

Some Convex Programs Whose Duals Are Linearly Constrained

Sufficiency Conditions and a Duality Theory for Mathematical Programming Problems in Arbitrary Linear Spaces

Recent Results on Complementarity Problems

Nonlinear Nondifferentiable Programming in Complex Space

Duality Inequalities of Mathematics and Science

Programming Methods in Statistics and Probability Theory

Applications of Mathematical Programming to ℓp Approximation

Theoretical and Computational Aspects of Nonlinear Regression

Index

Details

No. of pages:
502
Language:
English
Copyright:
© Academic Press 1970
Published:
Imprint:
Academic Press
eBook ISBN:
9781483272467

About the Editor

J. B. Rosen

O. L. Mangasarian

K. Ritter