Kontakt
Ako nakupovať
Doručenie
Nákupný poradca
Simplicial Algorithms for Minimizing Polyhedral Functions
Angličtina
248 b
30 dní na vrátenie tovaru
Zákazníci tiež kúpili
/
Brožovaná
41.61
€
/
Brožovaná
30.77
€
/
Brožovaná
24.39
€
Polyhedral functions provide a model for an important class of problems that includes both linear programming and applications in data analysis. General methods for minimizing such functions using the polyhedral geometry explicitly are developed. Such methods approach a minimum by moving from extreme point to extreme point along descending edges and are described generically as simplicial. The best-known member of this class is the simplex method of linear programming, but simplicial methods have found important applications in discrete approximation and statistics. The general approach considered in this text, first published in 2001, has permitted the development of finite algorithms for the rank regression problem. The key ideas are those of developing a general format for specifying the polyhedral function and the application of this to derive multiplier conditions to characterize optimality. Also considered is the application of the general approach to the development of active set algorithms for polyhedral function constrained problems and associated Lagrangian forms.
Informácie o knihe
Angličtina
Darujte túto knihu ešte dnes
Je to jednoduché
1 Pridajte knihu do košíka a vyberte možnosť doručiť ako darček 2 Obratom Vám zašleme poukaz 3 Knihu zašleme na adresu obdarovanéhoMohlo by vás tiež zaujímať
/
Pevná
41.81
€
/
Brožovaná
47.79
€
Ahoj! Som Libroamiko, tvoj knižný radca.
Ako ti môžem pomôcť?