Research Reports from the Department of Operations

Document Type

Report

Publication Date

5-1-1977

Abstract

This article considers a smoothing or data fitting problem involving minimization of the distance from a function f to a convex cone of functions. A weighted uniform norm is considered as a measure of the distance. The domain of functions is a partially ordered set, and the convex cone is defined by isotonicity and nonnegativity conditions on functions. The problem has a linear programming formulation, however, explicit expressions for optimal solutions have been obtained directly, thereby eliminating the necessity of using linear programming techniques. The results are applied to approximation by starshaped functions.

Keywords

Operations research, Approximation theory, Convex functions, Linear programming, Mathematical optimization, Functional analysis

Publication Title

Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University

Issue

Technical memorandum no. 422

Rights

This work is in the public domain and may be freely downloaded for personal or academic use

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.