Arc-Search Techniques for Interior-Point Methods (PDF)
(Sprache: Englisch)
This book discusses one of the most recent developments in interior-point methods, the arc-search techniques. Introducing these techniques result in an efficient interior-point algorithm with the lowest polynomial bound, which solves a long-standing issue...
Leider schon ausverkauft
eBook (pdf)
74.60 €
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „Arc-Search Techniques for Interior-Point Methods (PDF)“
This book discusses one of the most recent developments in interior-point methods, the arc-search techniques. Introducing these techniques result in an efficient interior-point algorithm with the lowest polynomial bound, which solves a long-standing issue of the interior-point methods in linear programming.
Autoren-Porträt von Yaguang Yang
Yaguang Yang received a BSc (1982) and a MSc (1985) from Huazhong University of Science and Technology, China. From 1985 to 1990, he was a lecturer at Zhejiang University in China. In 1996, he received his PhD from the Department of Electrical and Computer Engineering at the University of Maryland, College Park. He proposed and developed arc-search techniques for interior-point methods. He is currently with the US Nuclear Regulatory Commission.
Bibliographische Angaben
- Autor: Yaguang Yang
- 2020, 1. Auflage, 316 Seiten, Englisch
- Verlag: Taylor & Francis
- ISBN-10: 1000220133
- ISBN-13: 9781000220131
- Erscheinungsdatum: 26.11.2020
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Größe: 6.09 MB
- Ohne Kopierschutz
- Vorlesefunktion
Sprache:
Englisch
Kommentar zu "Arc-Search Techniques for Interior-Point Methods"
Schreiben Sie einen Kommentar zu "Arc-Search Techniques for Interior-Point Methods".
Kommentar verfassen