Show simple item record

Best interpolation in a strip II: Reduction to unconstrained convex optimization

dc.contributor.authorDontchev, Asen L.en_US
dc.contributor.authorKolmanovsky, Ilya V.en_US
dc.date.accessioned2006-09-11T15:15:25Z
dc.date.available2006-09-11T15:15:25Z
dc.date.issued1996-05en_US
dc.identifier.citationDontchev, 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.issn0926-6003en_US
dc.identifier.issn1573-2894en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/44775
dc.description.abstractIn 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.extent987195 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherKluwer Academic Publishers; Springer Science+Business Mediaen_US
dc.subject.otherMathematicsen_US
dc.subject.otherConvex and Discrete Geometryen_US
dc.subject.otherOptimizationen_US
dc.subject.otherOperations Research, Mathematical Programmingen_US
dc.subject.otherStatistics, Generalen_US
dc.subject.otherOperation Research/Decision Theoryen_US
dc.subject.otherConstrained Best Approximationen_US
dc.subject.otherSplinesen_US
dc.subject.otherInterpolationen_US
dc.subject.otherConvex Programmingen_US
dc.titleBest interpolation in a strip II: Reduction to unconstrained convex optimizationen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Aerospace Engineering, The University of Michigan, 48109-2118, Ann Arbor, MI, USAen_US
dc.contributor.affiliationotherMathematical Review, 416 Fourth Street, 48107, Ann Arbor, MI, USAen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/44775/1/10589_2004_Article_BF00248266.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/BF00248266en_US
dc.identifier.sourceComputational Optimization and Applicationsen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

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.