The University of Southampton
University of Southampton Institutional Repository

Some theoretical aspects of Newton's method for constrained best interpolation

Some theoretical aspects of Newton's method for constrained best interpolation
Some theoretical aspects of Newton's method for constrained best interpolation
The paper contains new results as well as surveys on recent developments on the constrained best interpolation problem, and in particular on the convex best interpolation problem. Issues addressed include theoretical reduction of the problem to a system of nonsmooth equations, nonsmooth analysis of those equations and development of Newton's method, convergence analysis and globalization.
We frequently use the convex best interpolation to illustrate the seemingly complex theory. Important techniques such as splitting are introduced and interesting links between approaches from approximation and optimization are also established. Open problems related to polyhedral constraints and strips may be tackled by the tools introduced and developed in this paper.
9780387267
253-270
Cambridge University Press
Qi, Houduo
e9789eb9-c2bc-4b63-9acb-c7e753cc9a85
Jeyakumar, Vaithilingam
Rubinov, Alexander
Qi, Houduo
e9789eb9-c2bc-4b63-9acb-c7e753cc9a85
Jeyakumar, Vaithilingam
Rubinov, Alexander

Qi, Houduo (2005) Some theoretical aspects of Newton's method for constrained best interpolation. In, Jeyakumar, Vaithilingam and Rubinov, Alexander (eds.) Continuous Optimization: Current Trends and Modern Applications. Cambridge, UK, New York, USA. Cambridge University Press, pp. 253-270.

Record type: Book Section

Abstract

The paper contains new results as well as surveys on recent developments on the constrained best interpolation problem, and in particular on the convex best interpolation problem. Issues addressed include theoretical reduction of the problem to a system of nonsmooth equations, nonsmooth analysis of those equations and development of Newton's method, convergence analysis and globalization.
We frequently use the convex best interpolation to illustrate the seemingly complex theory. Important techniques such as splitting are introduced and interesting links between approaches from approximation and optimization are also established. Open problems related to polyhedral constraints and strips may be tackled by the tools introduced and developed in this paper.

This record has no associated files available for download.

More information

Published date: 2005
Organisations: Operational Research

Identifiers

Local EPrints ID: 29651
URI: http://eprints.soton.ac.uk/id/eprint/29651
ISBN: 9780387267
PURE UUID: 9d9a5565-bc6b-4b37-8e42-b9be710a2e89
ORCID for Houduo Qi: ORCID iD orcid.org/0000-0003-3481-4814

Catalogue record

Date deposited: 15 May 2006
Last modified: 12 Dec 2021 03:28

Export record

Contributors

Author: Houduo Qi ORCID iD
Editor: Vaithilingam Jeyakumar
Editor: Alexander Rubinov

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.

×