有界线性算子空间中最佳逼近的强惟一性

研究有界线性算子空间中非线性最佳逼近的强惟一性和惟一性元的特征问题. 给出了算子空间中关于RS集最佳逼近的强惟一性定理, 并在c₀到c₀的紧算子空间中通过严格Kolmogorov条件建立了关于太阳集的惟一性元的特征定理, 从而改进和推广了Lewicki等人的近期工作.     

一类对称正交反对称矩阵反问题的最佳逼近

讨论了一类对称正交反对称反问题的最佳逼近.利用对称正交反对称矩阵的特殊性质,给出了矩阵方程AX=B有对称正交反对称解的充要条件以及解的一般表达式;证明最佳逼近解的存在惟一性并给出其表达式;最后给出计算任意矩阵的最佳逼近解的数值方法及算例.     

线性流形上反埃尔米特广义汉密尔顿矩阵的最小二乘问题与最佳逼近问题

利用反埃尔米特广义汉密尔顿矩阵的表示定理,得到了线性流形上反埃尔米特广义汉密尔顿矩阵反问题的最小二乘解的一般表达式,建立了线性矩阵方程在线性流形上可解的充分必要条件．对于任意给定的n阶复矩阵,证明了相关最佳逼近问题解的存在性与惟一性,并推得了最佳逼近解的表达式．     

Banach 空间中非线性最佳逼近的广义强唯一性

设X是一致凸空间,G为X中太阳集,R．Smarzewski[1]证明了g∈G对x∈的最佳逼近具有广义强唯一性,本文讨论其逆,在最佳逼近是广义强唯一的条件下,研究了空间的凸性和逼近集的太阳性．     

复赋范空间中复RS集的最佳同时逼近

研究了复赋范空间中具限制系数的广义多项式集G对无穷序列的最佳同时逼近问题,得到了特征定理;当G是复RS集时还得到了惟一性定理．     

Bergman空间的插值多项式逼近

本文在1相似文献   

索伯列夫空间中的有界线性算子的最佳逼近

讨论索伯列夫空间H0^2[a，b]中的有界线性算子的最佳逼近问题，利用此空间中的再生核给出了最佳逼近算子的具体表达形式，并且给出了最佳逼近算子的收敛性的结论．     

Orlicz-Sobolev空间单调性及其在最佳逼近中的应用

改进了Hudzik,Kurc关于最佳逼近中的结果,给出了赋Orlicz范数的Orlicz- Sobolev空间具有一致单调性、局部一致单调性和严格单调性的充要条件、单调系数的数值,以及在最佳逼近中的应用.     

赋Luxemburg范数的Musielak-Orlicz-Sobolev空间单调性在最佳逼近中的应用

借鉴Orlicz-Sobolev空间的单调性在最佳逼近中一些应用,利用Musielak-Orlicz-Sobolev空间的构成特点,给出了赋Luxemburg范数的Musielak-Orlicz-Sobolev空间的单调性在最佳逼近中一些应用的充分性定理.     

最佳联合逼近的Dunham型相依性

C.B.Dunham在[1—8]中研究了最佳切比雪夫逼近对于被逼近函数、逼近函数类和逼近域的相依性。因为我们经常用离散化的方法决定最佳逼近,所以,这个问题具有实际意义。本文在联合逼近意义下,考虑同一类相依性问题。 设W是紧距离空间,两点间的距离用ρ(x,y)表示。对于W的任一紧子集Y和任一函数g∈C(W),定义切比雪夫范数如下:     

Strong unicity and alternation for linear optimization

We consider linear semi-infinite optimization problems and prove characterizations for strong unicity. One of these is a weak alternation property. This result suggests the introduction of the property of regular strong unicity, which is equivalent to a stronger alternation property. The theorems are used in order to prove a Haar-type theorem for linear optimization problems. An application to best Chebyshev approximation is given.Communicated by A. V. Fiacco     

The almost chebyshev property in linear semi-infinite programming

We consider a linear semi-infinite programming problem where the index set of the constraints is compact and the constraint functions are continuous on it. The set of all continuous functions on this index set as right hand sides are the parameter set. We investigate how large various unicity sets are.We state a condition on the objective function vector and the “matrix” of the problem which characterizes when the set of a parameters with a non-unique optimal point is a set of the first Baire category in the solvability set. This is the case if and only if the unicity set is a dense subset of the solvability set. Under the same assumptions it is even true that the interior of the strong unicity set is I also dense. If the index set of the constraints contains a dense subset with the property that each point1 is a G ₈-set, then the parameters of the strong unicity set, such that the optimal point satisfies the linear independence constraint qualification, are also dense.

We apply our results to a characterization of a unique continuous selection for the optimal set I mapping and to a one-sided L ₁-approximation problem     

带约束导数值域的L逼近

1972年J.A.Roulier和G.D.Taylor研究了带约束导数值域的一致逼近,在文章最后,他们提出了一个未解决的问题,就是关于带约束导数值域的L逼近问题.本文研究了这个问题,得到与[1]平行的结果.这个结果同时也推广了 R.A.Lorentz的工作. 第一节给出存在定理,第二节证明若干特征定理,第三节给出一个唯一性定理.     

VARIATIONAL L~q-APPROXIMATION BY VARISOLVENT FAMILY UNDER THE YOUNG'S CONDITION

1PreliminariesandExistenceForfEC[0,1],A.PinkusandO.Shi.h.[l]introducedthefollowingmeasures,'Thesupremaareattainable,andqE[1,co)Inthecaseq=1,wesimplyletWiththismeasurestA.PinkusandO.ShishahavestudiedbestapproximationbyalgebraicpolynondaISofdegree5n.Later,MaandShi[2]11avestudiedthecaseofbestapproximationfromratiollalpolyllollilalsR:,usingthesamegaugeill'JI1.TheyallgetthesimilarresultsforChebyshevapproximation,includingalternatiolltheoremascharacterisatiollforthebestappro~swhichisthegeom…     

Generalized rational approximation in interpolating subspaces of Lp(μ)

We extend the geometric approach of Cheney and Loeb in [2] to the problem of approximation in L_p(μ) by “admissable” generalized rational functions. We obtain a characterization for locally best approximations and find the interpolating condition sufficient for their local unicity. Our results are comparable to those for the linear approximation problem as investigated by Singer and Ault, Deutsch, Morris, and Olson.     

Strong unicity of best approximations : A numerical aspect

The set of functions in C(T) which have a strongly unique best approximation from a given finite-dimensional subspace is denoted by SU(G). Since strong unicity plays an important role in numerical computations and since there the functions are only known up to some error, it is natural to ask what are the functions from the interior of SU(G). A complete characterization of those functions is given and the result is applied to weak Chebyshev and spline subspaces.     

Unicity in linear optimization

This paper deals with the conditions for the uniqueness of the optimal solution of an optimization problem for which the objective function is linear and the feasible set is a closed convex set in a finite-dimensional space. Some of these conditions, such as strong unicity andw-unicity (a new transition concept), involve only the feasible set. Others are related to the properties of the chosen linear representation. To some extent, the paper surveys the literature about unicity and strong unicity in linear semi-infinite programming.This work was partially supported by the DGICYT of Spain, Grant PS90-0158, by the Bulgarian Ministry of Education and Science, Grant MM-408/94, and by the EC Commission, Grant CIPA-3510PL929132.     

ON THE HYPERBOLIC OBSTACLE PROBLEM OF FIRST ORDER

InroductlonThe classical obstacle problem canbe formulated as the