共查询到20条相似文献,搜索用时 453 毫秒
1.
Using the fixed point alternative theorem we establish the orthogonal stability of the quadratic functional equation of Pexider
type f (x+y)+g(x−y) = h(x)+k(y), where f, g, h, k are mappings from a symmetric orthogonality space to a Banach space, by orthogonal additive mappings under a necessary and
sufficient condition on f. 相似文献
2.
The functional equation f(xy)=f(x)g(y)+g(x)f(y)+h(x)h(y) is solved where f, g, h are complex functions defined on a group. 相似文献
3.
JAEYOUNG CHUNG HEATHER HUNT ALLISON PERKINS PRASANNA K SAHOO 《Proceedings Mathematical Sciences》2014,124(3):365-381
In this paper, we study the Hyers–Ulam stability of a simple Levi–Civitá functional equation f(x+y)=f(x)h(y)+f(y) and its pexiderization f(x+y)= g(x) h(y)+k(y) on non-unital commutative semigroups by investigating the functional inequalities |f(x+y)?f(x)h(y)?f(y)|≤?? and |f(x+y)?g(x)h(y)?k(y)|≤??, respectively. We also study the bounded solutions of the simple Levi–Civitá functional inequality. 相似文献
4.
Tim Stokes 《Semigroup Forum》2010,81(2):325-334
We characterize algebras of transformations on a set under the operations of composition and the pointwise switching function
defined as follows: (f,g)[h,k](x)=h(x) if f(x)=g(x), and k(x) otherwise. The resulting algebras are both semigroups and comparison algebras in the sense of Kennison. The same characterization
holds for partial transformations under composition and a suitable generalisation of the quaternary operation in which agreement
of f,g includes cases where neither is defined. When a zero element is added (modelling the empty function), the resulting signature
is rich enough to encompass many operations on semigroups of partial transformations previously considered, including set
difference and intersection, restrictive product, and a functional analog of union. When an identity element is also added
(modelling the identity function), further domain-related operations can be captured. 相似文献
5.
Simple graphs are considered. Let G be a graph andg(x) andf(x) integer-valued functions defined on V(G) withg(x)⩽f(x) for everyxɛV(G). For a subgraphH ofG and a factorizationF=|F
1,F
2,⃛,F
1| ofG, if |E(H)∩E(F
1)|=1,1⩽i⩽j, then we say thatF orthogonal toH. It is proved that for an (mg(x)+k,mf(x) -k)-graphG, there exists a subgraphR ofG such that for any subgraphH ofG with |E(H)|=k,R has a (g,f)-factorization orthogonal toH, where 1⩽k<m andg(x)⩾1 orf(x)⩾5 for everyxɛV(G).
Project supported by the Chitia Postdoctoral Science Foundation and Chuang Xin Foundation of the Chinese Academy of Sciences. 相似文献
6.
Since Dantzig—Wolfe's pioneering contribution, the decomposition approach using a pricing mechanism has been developed for a wide class of mathematical programs. For convex programs a linear space of Lagrangean multipliers is enough to define price functions. For general mathematical programs the price functions could be defined by using a subclass of nondecreasing functions. However the space of nondecreasing functions is no longer finite dimensional. In this paper we consider a specific nonconvex optimization problem min {f(x):h
j
(x)g(x),j=1, ,m, xX}, wheref(·),h
j
(·) andg(·) are finite convex functions andX is a closed convex set. We generalize optimal price functions for this problem in such a way that the parameters of generalized price functions are defined in a finite dimensional space. Combining convex duality and a nonconvex duality we can develop a decomposition method to find a globally optimal solution.This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday. 相似文献
7.
We determine the general solution of the functional equation f(x + ky) + f(x-ky) = g(x + y) + g(x-y) + h(x) + h(y) for fixed integers with k ≠ 0; ±1 without assuming any regularity conditions for the unknown functions f, g, h, and0020[(h)\tilde] \tilde{h} . The method used for solving these functional equations is elementary but it exploits an important result due to Hosszú.
The solution of this functional equation can also be obtained in groups of certain type by using two important results due
to Székelyhidi. 相似文献
8.
Convex programs with an additional reverse convex constraint 总被引:2,自引:0,他引:2
H. Tuy 《Journal of Optimization Theory and Applications》1987,52(3):463-486
A method is presented for solving a class of global optimization problems of the form (P): minimizef(x), subject toxD,g(x)0, whereD is a closed convex subset ofR
n
andf,g are convex finite functionsR
n
. Under suitable stability hypotheses, it is shown that a feasible point
is optimal if and only if 0=max{g(x):xD,f(x)f(
)}. On the basis of this optimality criterion, the problem is reduced to a sequence of subproblemsQ
k
,k=1, 2, ..., each of which consists in maximizing the convex functiong(x) over some polyhedronS
k
. The method is similar to the outer approximation method for maximizing a convex function over a compact convex set. 相似文献
9.
M. Eshaghi Gordji H. Khodaei 《Nonlinear Analysis: Theory, Methods & Applications》2009,71(11):5629-5643
In this paper, we achieve the general solution and the generalized Hyers–Ulam–Rassias stability of the following functional equation
f(x+ky)+f(x−ky)=k2f(x+y)+k2f(x−y)+2(1−k2)f(x)