Hybrid methods for approximating Hankel matrix

Suliman Al-Homidan

doi:10.1023/A:1022202125077

Hybrid methods for approximating Hankel matrix

Suliman Al-Homidan^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

10 Scopus citations

Abstract

Hybrid methods for minimizing least distance functions with Hankel positive semi-definite matrix constraints are considered. Our approach is based on (i) a projection algorithm which converges globally but slowly; and (ii) the Newton method which is faster. Hybrid methods that attempt to combine the best features of both methods are then considered. Comparative numerical results are reported.

Original language	English
Pages (from-to)	57-66
Number of pages	10
Journal	Numerical Algorithms
Volume	32
Issue number	1
DOIs	https://doi.org/10.1023/A:1022202125077
State	Published - Jan 2003

Keywords

Alternating projections
Hankel matrix
Least distance functions
Newton method
Non-smooth optimization
Positive semi-definite matrix

ASJC Scopus subject areas

Applied Mathematics

Access to Document

10.1023/A:1022202125077

Cite this

@article{88adaa3e23f8430586deaa81f81c12d2,

title = "Hybrid methods for approximating Hankel matrix",

abstract = "Hybrid methods for minimizing least distance functions with Hankel positive semi-definite matrix constraints are considered. Our approach is based on (i) a projection algorithm which converges globally but slowly; and (ii) the Newton method which is faster. Hybrid methods that attempt to combine the best features of both methods are then considered. Comparative numerical results are reported.",

keywords = "Alternating projections, Hankel matrix, Least distance functions, Newton method, Non-smooth optimization, Positive semi-definite matrix",

author = "Suliman Al-Homidan",

year = "2003",

month = jan,

doi = "10.1023/A:1022202125077",

language = "English",

volume = "32",

pages = "57--66",

journal = "Numerical Algorithms",

issn = "1017-1398",

number = "1",

}

TY - JOUR

T1 - Hybrid methods for approximating Hankel matrix

AU - Al-Homidan, Suliman

PY - 2003/1

Y1 - 2003/1

N2 - Hybrid methods for minimizing least distance functions with Hankel positive semi-definite matrix constraints are considered. Our approach is based on (i) a projection algorithm which converges globally but slowly; and (ii) the Newton method which is faster. Hybrid methods that attempt to combine the best features of both methods are then considered. Comparative numerical results are reported.

AB - Hybrid methods for minimizing least distance functions with Hankel positive semi-definite matrix constraints are considered. Our approach is based on (i) a projection algorithm which converges globally but slowly; and (ii) the Newton method which is faster. Hybrid methods that attempt to combine the best features of both methods are then considered. Comparative numerical results are reported.

KW - Alternating projections

KW - Hankel matrix

KW - Least distance functions

KW - Newton method

KW - Non-smooth optimization

KW - Positive semi-definite matrix

UR - http://www.scopus.com/inward/record.url?scp=0037277382&partnerID=8YFLogxK

U2 - 10.1023/A:1022202125077

DO - 10.1023/A:1022202125077

M3 - Article

AN - SCOPUS:0037277382

SN - 1017-1398

VL - 32

SP - 57

EP - 66

JO - Numerical Algorithms

JF - Numerical Algorithms

IS - 1

ER -

Hybrid methods for approximating Hankel matrix

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this