Arc-Search Techniques for Interior-Point Methods - Yang, Yaguang
178,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in über 4 Wochen
payback
89 °P sammeln
  • Gebundenes Buch

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.

Andere Kunden interessierten sich auch für
Produktbeschreibung
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.
Autorenporträt
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.