A systematic treatment of well-known optimization problems in which an active set strategy leads to a finite algorithm. Applies techniques of convex analysis to problems in convex and nonconvex programming involving polyhedral functions. An important contribution of this work is the derivation of a compactly parametrized representation of the subdifferential of a polyhedral convex function. Develops finite algorithms for robust statistical estimators, nonparametric estimators based on rank, and errors in variables problems. ...
Read More
A systematic treatment of well-known optimization problems in which an active set strategy leads to a finite algorithm. Applies techniques of convex analysis to problems in convex and nonconvex programming involving polyhedral functions. An important contribution of this work is the derivation of a compactly parametrized representation of the subdifferential of a polyhedral convex function. Develops finite algorithms for robust statistical estimators, nonparametric estimators based on rank, and errors in variables problems. Gives a detailed discussion of the basic solution procedures for the simplest case (the linear programming problem) and includes a treatment of degeneracy. Provides a model for subsequent developments such as quadratic programming, M-estimation, and total approximation.
Read Less
Add this copy of Finite Algorithms in Optimization and Data Analysis to cart. $32.82, good condition, Sold by Anybook rated 5.0 out of 5 stars, ships from Lincoln, UNITED KINGDOM, published 1985 by John Wiley and Sons.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
This is an ex-library book and may have the usual library/used-book markings inside. This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item, 800grams, ISBN: 0471905399.
