Best interpolation in a strip II: Reduction to unconstrained convex optimization
dc.contributor.author | Dontchev, Asen L. | en_US |
dc.contributor.author | Kolmanovsky, Ilya V. | en_US |
dc.date.accessioned | 2006-09-11T15:15:25Z | |
dc.date.available | 2006-09-11T15:15:25Z | |
dc.date.issued | 1996-05 | en_US |
dc.identifier.citation | Dontchev, Asen L.; Kolmanovsky, Ilya; (1996). "Best interpolation in a strip II: Reduction to unconstrained convex optimization." Computational Optimization and Applications 5(3): 233-251. <http://hdl.handle.net/2027.42/44775> | en_US |
dc.identifier.issn | 0926-6003 | en_US |
dc.identifier.issn | 1573-2894 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/44775 | |
dc.description.abstract | In this paper, we study the problem of finding a real-valued function f on the interval [0, 1] with minimal L 2 norm of the second derivative that interpolates the points ( t i , y i ) and satisfies e(t) ≤ f(t) ≤ d(t) for t ∈ [0, 1]. The functions e and d are continuous in each interval ( t i , t i +1) and at t 1 and t n but may be discontinuous at t i . Based on an earlier paper by the first author [7] we characterize the solution in the case when e and d are linear in each interval ( t i , t i +1). We present a method for the reduction of the problem to a convex finite-dimensional unconstrained minimization problem. When e and d are arbitrary continuous functions we approximate the problem by a sequence of finite-dimensional minimization problems and prove that the sequence of solutions to the approximating problems converges in the norm of W 2,2 to the solution of the original problem. Numerical examples are reported. | en_US |
dc.format.extent | 987195 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Kluwer Academic Publishers; Springer Science+Business Media | en_US |
dc.subject.other | Mathematics | en_US |
dc.subject.other | Convex and Discrete Geometry | en_US |
dc.subject.other | Optimization | en_US |
dc.subject.other | Operations Research, Mathematical Programming | en_US |
dc.subject.other | Statistics, General | en_US |
dc.subject.other | Operation Research/Decision Theory | en_US |
dc.subject.other | Constrained Best Approximation | en_US |
dc.subject.other | Splines | en_US |
dc.subject.other | Interpolation | en_US |
dc.subject.other | Convex Programming | en_US |
dc.title | Best interpolation in a strip II: Reduction to unconstrained convex optimization | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Aerospace Engineering, The University of Michigan, 48109-2118, Ann Arbor, MI, USA | en_US |
dc.contributor.affiliationother | Mathematical Review, 416 Fourth Street, 48107, Ann Arbor, MI, USA | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/44775/1/10589_2004_Article_BF00248266.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/BF00248266 | en_US |
dc.identifier.source | Computational Optimization and Applications | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.