Editore: Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898714338 ISBN 13: 9780898714333
Lingua: Inglese
Da: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Condizione: Very Good. 196 pp., Paperback, previous owner's name inside the front cover, else very good. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.
Editore: Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898714338 ISBN 13: 9780898714333
Lingua: Inglese
Da: thebookforest.com, San Rafael, CA, U.S.A.
Condizione: Very Good. Wraps are firm, text block clean, without highlights/underlining or markings. Some rubbing/curling to wraps. Very clean, nearly like new. Previous owners name on the inside of front endpaper. Supporting Bay Area Friends of the Library since 2010. Well packaged and promptly shipped.
Editore: Society for Industrial and Applied Mathematics, Philadelphia, 1987
ISBN 10: 0898714338 ISBN 13: 9780898714333
Lingua: Inglese
Da: Reader's Corner, Inc., Raleigh, NC, U.S.A.
Prima edizione
Soft cover. Condizione: Very Good. 1st Edition. This is a VG second printing paperback copy, blue spine.
EUR 15,00
Quantità: 1 disponibili
Aggiungi al carrelloSoftcover. Condizione: Gut. Philadelphia, Siam (1999). gr.8°. XV, 180 p. Pbck. (corners bumped).- Frontiers in Applied Mathematics.- With exercises.
Editore: Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898714338 ISBN 13: 9780898714333
Lingua: Inglese
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New.
Editore: Society for Industrial & Applied Mathematics,U.S., New York, 1987
ISBN 10: 0898714338 ISBN 13: 9780898714333
Lingua: Inglese
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Prima edizione
Paperback. Condizione: new. Paperback. Presents a selected group of methods for unconstrained and bound constrained optimization problems and analyses them in depth both theoretically and algorithmically. The text focuses on clarity in algorithmic description and analysis rather then generality, and while it provided pointers to the literature for the most general theoretical results and robust software, the author thinks it is more important that readers have a complete understanding of special cases that convey essential ideas. A companion to the author's book " Iterative Methods for Linear and Nonlinear Equations", this text contains many exercises and examples and can be uses as a text, a tutorial for self-study or a reference. a carefully selected group of methods for unconstrained and bound constrained optimization problems is analyzed in depth both theoretically and algorithmically. The book focuses on clarity in algorithmic description and analysis rather than generality, and also provides pointers to the literature for the most general theoretical results and robust software, Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Editore: Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898714338 ISBN 13: 9780898714333
Lingua: Inglese
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition.
Editore: Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898714338 ISBN 13: 9780898714333
Lingua: Inglese
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 82,05
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Editore: Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898714338 ISBN 13: 9780898714333
Lingua: Inglese
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 98,47
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New.
Editore: Society for Industrial & Applied Mathematics,U.S., New York, 1987
ISBN 10: 0898714338 ISBN 13: 9780898714333
Lingua: Inglese
Da: AussieBookSeller, Truganina, VIC, Australia
Prima edizione
EUR 85,64
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: new. Paperback. Presents a selected group of methods for unconstrained and bound constrained optimization problems and analyses them in depth both theoretically and algorithmically. The text focuses on clarity in algorithmic description and analysis rather then generality, and while it provided pointers to the literature for the most general theoretical results and robust software, the author thinks it is more important that readers have a complete understanding of special cases that convey essential ideas. A companion to the author's book " Iterative Methods for Linear and Nonlinear Equations", this text contains many exercises and examples and can be uses as a text, a tutorial for self-study or a reference. a carefully selected group of methods for unconstrained and bound constrained optimization problems is analyzed in depth both theoretically and algorithmically. The book focuses on clarity in algorithmic description and analysis rather than generality, and also provides pointers to the literature for the most general theoretical results and robust software, Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
EUR 82,35
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. Presents a carefully selected group of methods for unconstrained and bound constrained optimization problems and analyzes them in depth both theoretically and algorithmically. It focuses on clarity in algorithmic description and analysis rather than general.
EUR 52,44
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Gut. Zustand: Gut | Sprache: Englisch | Produktart: Bücher.
Editore: Society For Industrial And Applied Mathematics (SIAM) Jan 1987, 1987
ISBN 10: 0898714338 ISBN 13: 9780898714333
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 100,24
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Neuware - Presents a carefully selected group of methods for unconstrained and bound constrained optimization problems and analyzes them in depth both theoretically and algorithmically. It focuses on clarity in algorithmic description and analysis rather than generality.