Nonlinear programming : sequential unconstrained minimization techniques /

Saved in:
Bibliographic Details
Author / Creator:Fiacco, Anthony V.
Imprint:Philadelphia, Pa. : Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), 1990.
Description:1 online resource (xvi, 210 pages) : illustrations.
Language:English
Series:Classics in applied mathematics ; 4
Classics in applied mathematics ; 4.
Subject:
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/12577414
Hidden Bibliographic Details
Other authors / contributors:McCormick, Garth P.
Society for Industrial and Applied Mathematics.
ISBN:9781611971316
1611971314
0898712548
9780898712544
Notes:Title from title screen, viewed 04/05/2011.
"This SIAM edition is an unabridged, corrected republication of the work first published by Research Analysis Corporation, McLean, Virginia"--Title page verso.
Includes bibliographical references (pages 196-201) and indexes.
Summary:Recent interest in interior point methods generated by Karmarkar's Projective Scaling Algorithm has created a new demand for this book because the methods that have followed from Karmarkar's bear a close resemblance to those described. There is no other source for the theoretical background of the logarithmic barrier function and other classical penalty functions. Analyzes in detail the "central" or "dual" trajectory used by modern path following and primal/dual methods for convex and general linear programming. As researchers begin to extend these methods to convex and general nonlinear programming problems, this book will become indispensable to them.
Other form:Print version: 0898712548 9780898712544

MARC

LEADER 00000cam a2200000Ia 4500
001 12577414
006 m eo d
007 cr bn||||m|||a
008 110511s1990 paua ob 001 0 eng d
005 20250128143455.6
020 |a 9781611971316  |q (electronic bk.) 
020 |a 1611971314  |q (electronic bk.) 
020 |z 0898712548  |q (pbk.) 
020 |z 9780898712544  |q (pbk.) 
035 9 |a (OCLCCM-CC)722473121 
035 |a (OCoLC)722473121 
040 |a CaBNvSL  |b eng  |c J2I  |d CUS  |d OCLCQ  |d OCLCO  |d OCLCF  |d UIU  |d OCLCQ  |d AU@  |d TKN  |d LEAUB  |d OCLCQ  |d LIP  |d OCLCO  |d OCLCQ  |d UIU  |d OCLCO 
049 |a MAIN 
050 4 |a T57.8  |b .F54 1990eb 
100 1 |a Fiacco, Anthony V.  |0 http://id.loc.gov/authorities/names/n79145550 
245 1 0 |a Nonlinear programming :  |b sequential unconstrained minimization techniques /  |c Anthony V. Fiacco, Garth P. McCormick. 
260 |a Philadelphia, Pa. :  |b Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104),  |c 1990. 
300 |a 1 online resource (xvi, 210 pages) :  |b illustrations. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a Classics in applied mathematics ;  |v 4 
500 |a Title from title screen, viewed 04/05/2011. 
500 |a "This SIAM edition is an unabridged, corrected republication of the work first published by Research Analysis Corporation, McLean, Virginia"--Title page verso. 
504 |a Includes bibliographical references (pages 196-201) and indexes. 
505 0 |a Chapter 1. Introduction -- Chapter 2. Mathematical programming theory -- Chapter 3. Interior point unconstrained minimization techniques -- Chapter 4. Exterior point unconstrained minimization techniques -- Chapter 5. Extrapolation in unconstrained minimization techniques -- Chapter 6. Convex programming -- Chapter 7. Other unconstrained minimization techniques -- Chapter 8. Computational aspects of unconstrained minimization algorithms -- Author index -- Subject index. 
520 3 |a Recent interest in interior point methods generated by Karmarkar's Projective Scaling Algorithm has created a new demand for this book because the methods that have followed from Karmarkar's bear a close resemblance to those described. There is no other source for the theoretical background of the logarithmic barrier function and other classical penalty functions. Analyzes in detail the "central" or "dual" trajectory used by modern path following and primal/dual methods for convex and general linear programming. As researchers begin to extend these methods to convex and general nonlinear programming problems, this book will become indispensable to them. 
650 0 |a Nonlinear programming.  |0 http://id.loc.gov/authorities/subjects/sh85092331 
650 0 |a Mathematical optimization.  |0 http://id.loc.gov/authorities/subjects/sh85082127 
650 0 |a Algorithms.  |0 http://id.loc.gov/authorities/subjects/sh85003487 
650 2 |a Algorithms  |0 https://id.nlm.nih.gov/mesh/D000465 
650 6 |a Programmation non linéaire. 
650 6 |a Optimisation mathématique. 
650 6 |a Algorithmes. 
650 7 |a algorithms.  |2 aat 
650 7 |a Algorithms  |2 fast 
650 7 |a Mathematical optimization  |2 fast 
650 7 |a Nonlinear programming  |2 fast 
653 |a Nonlinear 
653 |a Programming 
653 |a Convex 
653 |a Courant function 
653 |a Inverse penalty function 
653 |a Global minimum 
700 1 |a McCormick, Garth P.  |0 http://id.loc.gov/authorities/names/n82115688 
710 2 |a Society for Industrial and Applied Mathematics.  |0 http://id.loc.gov/authorities/names/n79053057 
776 0 8 |i Print version:  |z 0898712548  |z 9780898712544  |w (DLC) 90009658 
830 0 |a Classics in applied mathematics ;  |v 4.  |0 http://id.loc.gov/authorities/names/n89666203 
856 4 0 |u https://epubs.siam.org/doi/book/10.1137/1.9781611971316  |y Society for Industrial and Applied Mathematics 
903 |a HeVa 
929 |a oclccm 
999 f f |i 5b3533e4-b18b-5c35-aca8-4102ab6b4f26  |s f0e6c14b-c3be-5bbe-b37b-b551b20f658a 
928 |t Library of Congress classification  |a T57.8.F54 1990eb  |l Online  |c UC-FullText  |u https://epubs.siam.org/doi/book/10.1137/1.9781611971316  |z Society for Industrial and Applied Mathematics  |g ebooks  |i 12568798