Maximization for inner products under quasi-monotone constraints

Kenneth S. Berenhaut; John D. Foley; Dipankar Bandyopadhyay

Maximization for inner products under quasi-monotone constraints

Kenneth S. Berenhaut, John D. Foley, Dipankar Bandyopadhyay

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

Abstract

This paper studies optimization for inner products of real vectors assuming monotonicity properties for the entries in one of the vectors. Resulting inequalities have been useful recently in bounding reciprocals of power series with rapidly decaying coefficients and in proving that all symmetric Toeplitz matrices generated by monotone convex sequences have off-diagonal decay preserved through triangular decompositions. An example of an application of the theory to global optimization for inner products is also provided.

Original language	English (US)
Article number	158
Journal	Journal of Inequalities in Pure and Applied Mathematics
Volume	7
Issue number	5
State	Published - 2006
Externally published	Yes

Keywords

Discretization
Global optimization
Inner products
Monotonicity
Recurrence

OpenUrl availability

Full text

Cite this

@article{801173eaf5d247718fc3b9f788beb5a1,

title = "Maximization for inner products under quasi-monotone constraints",

abstract = "This paper studies optimization for inner products of real vectors assuming monotonicity properties for the entries in one of the vectors. Resulting inequalities have been useful recently in bounding reciprocals of power series with rapidly decaying coefficients and in proving that all symmetric Toeplitz matrices generated by monotone convex sequences have off-diagonal decay preserved through triangular decompositions. An example of an application of the theory to global optimization for inner products is also provided.",

keywords = "Discretization, Global optimization, Inner products, Monotonicity, Recurrence",

author = "Berenhaut, {Kenneth S.} and Foley, {John D.} and Dipankar Bandyopadhyay",

year = "2006",

language = "English (US)",

volume = "7",

journal = "Journal of Inequalities in Pure and Applied Mathematics",

issn = "1443-5756",

publisher = "Victoria University of Technology",

number = "5",

}

TY - JOUR

T1 - Maximization for inner products under quasi-monotone constraints

AU - Berenhaut, Kenneth S.

AU - Foley, John D.

AU - Bandyopadhyay, Dipankar

PY - 2006

Y1 - 2006

N2 - This paper studies optimization for inner products of real vectors assuming monotonicity properties for the entries in one of the vectors. Resulting inequalities have been useful recently in bounding reciprocals of power series with rapidly decaying coefficients and in proving that all symmetric Toeplitz matrices generated by monotone convex sequences have off-diagonal decay preserved through triangular decompositions. An example of an application of the theory to global optimization for inner products is also provided.

AB - This paper studies optimization for inner products of real vectors assuming monotonicity properties for the entries in one of the vectors. Resulting inequalities have been useful recently in bounding reciprocals of power series with rapidly decaying coefficients and in proving that all symmetric Toeplitz matrices generated by monotone convex sequences have off-diagonal decay preserved through triangular decompositions. An example of an application of the theory to global optimization for inner products is also provided.

KW - Discretization

KW - Global optimization

KW - Inner products

KW - Monotonicity

KW - Recurrence

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

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

M3 - Article

AN - SCOPUS:33845896798

SN - 1443-5756

VL - 7

JO - Journal of Inequalities in Pure and Applied Mathematics

JF - Journal of Inequalities in Pure and Applied Mathematics

IS - 5

M1 - 158

ER -

Maximization for inner products under quasi-monotone constraints

Abstract

Keywords

OpenUrl availability

Other files and links

Fingerprint

Cite this