The similarity between the best approximation and the best copositive approximation

Aref Kamal*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

In this paper the author studies the copositive approximation in C(Q) by elements of finite dimensional Chebyshev subspaces in the general case when Q is any totally ordered compact space. He studies the similarity between the behavior of the ordinary best approximation and the behavior of the copositive best approximation. At the end of this paper, the author isolates many cases at which the two behaviors are the same.

Original languageEnglish
Pages (from-to)789-803
Number of pages15
JournalNumerical Functional Analysis and Optimization
Volume18
Issue number7-8
DOIs
Publication statusPublished - 1997
Externally publishedYes

Keywords

  • Best approximation
  • Changing of sign
  • Chebyshev spaces
  • Copositive approximation

ASJC Scopus subject areas

  • Analysis
  • Signal Processing
  • Computer Science Applications
  • Control and Optimization

Fingerprint

Dive into the research topics of 'The similarity between the best approximation and the best copositive approximation'. Together they form a unique fingerprint.

Cite this