Regularity and well-posedness of a dual program for convex best C1-spline interpolation
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).
Full text not available from this repository.
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.
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||University Structure - Pre August 2011 > School of Mathematics > Operational Research
|Date Deposited:||28 Jul 2008|
|Last Modified:||06 Aug 2015 02:43|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)