The University of Southampton
University of Southampton Institutional Repository

Regularity and well-posedness of a dual program for convex best C1-spline interpolation

Regularity and well-posedness of a dual program for convex best C1-spline interpolation
Regularity and well-posedness of a dual program for convex best C1-spline interpolation
An efficient approach to computing the convex best C1-spline interpolant to a given set of data is to solve an associated dual program by standard numerical methods (e.g., Newton’s method). We study regularity and well-posedness of the dual program: two important issues that have been not yet well-addressed in the literature. Our regularity results characterize the case when the generalized Hessian of the objective function is positive definite. We also give sufficient conditions for the coerciveness of the objective function. These results together specify conditions when the dual program is well-posed and hence justify why Newton’s method is likely to be successful in practice. Examples are given to illustrate the obtained results.
0926-6003
409-425
Qi, Hou-Duo
e9789eb9-c2bc-4b63-9acb-c7e753cc9a85
Yang, Xiaoqi.Q.
ad7438ea-b82f-4b7f-bba4-67bcb49f0050
Qi, Hou-Duo
e9789eb9-c2bc-4b63-9acb-c7e753cc9a85
Yang, Xiaoqi.Q.
ad7438ea-b82f-4b7f-bba4-67bcb49f0050

Qi, Hou-Duo and Yang, Xiaoqi.Q. (2007) Regularity and well-posedness of a dual program for convex best C1-spline interpolation. Computational Optimization and Applications, 37, 409-425. (doi:10.1007/s10589-007-9027-y).

Record type: Article

Abstract

An efficient approach to computing the convex best C1-spline interpolant to a given set of data is to solve an associated dual program by standard numerical methods (e.g., Newton’s method). We study regularity and well-posedness of the dual program: two important issues that have been not yet well-addressed in the literature. Our regularity results characterize the case when the generalized Hessian of the objective function is positive definite. We also give sufficient conditions for the coerciveness of the objective function. These results together specify conditions when the dual program is well-posed and hence justify why Newton’s method is likely to be successful in practice. Examples are given to illustrate the obtained results.

This record has no associated files available for download.

More information

Published date: August 2007
Organisations: Operational Research

Identifiers

Local EPrints ID: 54537
URI: http://eprints.soton.ac.uk/id/eprint/54537
ISSN: 0926-6003
PURE UUID: d9ebc75c-9250-443b-9a2e-f1e8df5e577b
ORCID for Hou-Duo Qi: ORCID iD orcid.org/0000-0003-3481-4814

Catalogue record

Date deposited: 28 Jul 2008
Last modified: 16 Mar 2024 03:41

Export record

Altmetrics

Contributors

Author: Hou-Duo Qi ORCID iD
Author: Xiaoqi.Q. Yang

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×