Edge convex smooth interpolation curve networks with minimum L_∞-norm of the second derivative

12/22/2022
by   Krassimira Vlachkova, et al.
0

We consider the extremal problem of interpolation of convex scattered data in ℝ^3 by smooth edge convex curve networks with minimal L_p-norm of the second derivative for 1<p≤∞. The problem for p=2 was set and solved by Andersson et al. (1995). Vlachkova (2019) extended the results in (Andersson et al., 1995) and solved the problem for 1<p<∞. The minimum edge convex L_p-norm network for 1<p<∞ is obtained from the solution to a system of nonlinear equations with coefficients determined by the data. The solution in the case 1<p<∞ is unique for strictly convex data. The corresponding extremal problem for p=∞ remained open. Here we show that the extremal interpolation problem for p=∞ always has a solution. We give a characterization of this solution. We show that a solution to the problem for p=∞ can be found by solving a system of nonlinear equations in the case where it exists.

READ FULL TEXT
research
02/19/2019

Interpolation of scattered data in R^3 using minimum L_p-norm networks, 1<p<∞

We consider the extremal problem of interpolation of scattered data in R...
research
07/15/2020

Convexifying Sparse Interpolation with Infinitely Wide Neural Networks: An Atomic Norm Approach

This work examines the problem of exact data interpolation via sparse (n...
research
06/04/2021

An Even More Optimal Stochastic Optimization Algorithm: Minibatching and Interpolation Learning

We present and analyze an algorithm for optimizing smooth and convex or ...
research
06/23/2022

Change of Optimal Values: A Pre-calculated Metric

A variety of optimization problems takes the form of a minimum norm opti...
research
12/14/2017

Linear time Minimum Area All-flush Triangles Circumscribing a Convex Polygon

We study the problem of computing the minimum area triangle that circums...
research
11/11/2019

Revisiting the Approximate Carathéodory Problem via the Frank-Wolfe Algorithm

The approximate Carathéodory theorem states that given a polytope P, eac...
research
04/19/2011

A sufficient condition on monotonic increase of the number of nonzero entry in the optimizer of L1 norm penalized least-square problem

The ℓ-1 norm based optimization is widely used in signal processing, esp...

Please sign up or login with your details

Forgot password? Click here to reset