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 ...
Read More
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.
Read Less
Add this copy of Simplicial Algorithms for Minimizing Polyhedral to cart. $9.50, like new condition, Sold by Bingo Used Books rated 5.0 out of 5 stars, ships from Vancouver, WA, UNITED STATES, published 2001 by West Nyack, New York, U.S.A. : Cambridge Univ Pr.
Add this copy of Simplicial Algorithms for Minimizing Polyhedral to cart. $23.96, new condition, Sold by Books International rated 4.0 out of 5 stars, ships from Toronto, ON, CANADA, published 2011 by Cambridge University Press.
Add this copy of Simplicial Algorithms for Minimizing Polyhedral to cart. $36.95, new condition, Sold by Poverty Hill Books rated 5.0 out of 5 stars, ships from Mt. Prospect, IL, UNITED STATES, published 2001 by Cambridge University Press.
Add this copy of Simplicial Algorithms for Minimizing Polyhedral to cart. $41.19, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 2001 by Cambridge University Press.
Add this copy of Simplicial Algorithms for Minimizing Polyhedral to cart. $42.88, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2011 by Cambridge University Press.
Add this copy of Simplicial Algorithms for Minimizing Polyhedral to cart. $51.30, new condition, Sold by Ria Christie Books rated 5.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 2011 by Cambridge University Press.
Add this copy of Simplicial Algorithms for Minimizing Polyhedral to cart. $59.36, new condition, Sold by Booksplease rated 4.0 out of 5 stars, ships from Southport, MERSEYSIDE, UNITED KINGDOM, published 2011 by Cambridge University Press.
Add this copy of Simplicial Algorithms for Minimizing Polyhedral to cart. $67.00, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 2011 by Cambridge University Press.
Add this copy of Simplicial Algorithms for Minimizing Polyhedral to cart. $84.11, new condition, Sold by GridFreed rated 4.0 out of 5 stars, ships from North Las Vegas, NV, UNITED STATES, published 2001 by Cambridge University Press.
Add this copy of Simplicial Algorithms for Minimizing Polyhedral to cart. $93.09, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2001 by Cambridge University Press.
