Polyhedral function constrained optimization problems

M. R. Osborne

Abstract


Recently polyhedral functions have proved distinctly useful in expressing selection criteria in various model building techniques. Here they play the role of a constraint on an estimation problem. Whereas they can always be replaced by an appropriate family of linear constraints, the resulting set can be a very large. Compact representations are available and their use is illustrated by developing both active set and homotopy algorithms for the general polyhedral constrained problem. These are illustrated using some well known data sets.

Full Text:

PDF BibTeX


DOI: http://dx.doi.org/10.21914/anziamj.v46i0.956



Remember, for most actions you have to record/upload into this online system
and then inform the editor/author via clicking on an email icon or Completion button.
ANZIAM Journal, ISSN 1446-8735, copyright Australian Mathematical Society.