Optimality Conditions and Duality for a Class of Nonlinear Fractional Programming Problems

In this paper, we present sufficient optimality conditions and duality results for a class of nonlinear fractional programming problems. Our results are based on the properties of sublinear functionals and generalized convex functions.     

Solvability results for sublinear functions and operators

In this paper there are stated asymptotic solvability results which yield a Farkas' lemma for sublinear functions and operators. Applications to duality for homogeneous programming and to necessary optimality conditions for nonlinear programming are given. Some closedness conditions used in the paper are also discussed.

---

Zusammenfassung In dieser Arbeit werden asymptotische Lösbarkeitsresultate angegeben, die ein Farkas-Lemma für sublineare Funktionen und Operatoren liefern. Es werden Anwendungen auf die Dualitätstheorie homogener Programme und auf notwendige Optimalitätsbedingungen der nichtlinearen Programmierung angegeben. Einige Abgeschlossenheitsvoraussetzungen, die in der Arbeit benutzt werden, werden diskutiert.

     

Approximating average parameters of graphs

Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average degree of a graph and the average distance between pairs of vertices in a graph. Since our focus is on sublinear algorithms, these algorithms access the input graph via queries to an adequate oracle. We consider two types of queries. The first type is standard neighborhood queries (i.e., what is the ith neighbor of vertex v?), whereas the second type are queries regarding the quantities that we need to find the average of (i.e., what is the degree of vertex v? and what is the distance between u and v?, respectively). Loosely speaking, our results indicate a difference between the two problems: For approximating the average degree, the standard neighbor queries suffice and in fact are preferable to degree queries. In contrast, for approximating average distances, the standard neighbor queries are of little help whereas distance queries are crucial. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

具有(F,α,ρ,d)—凸的分式规划问题的最优性条件和对偶性

给出了一类非线性分式规划问题的参数形式和非参数形式的最优性条件,在此基础上,构造出了一个参数对偶模型和一个非参数对偶模型,并分别证明了其相应的对偶定理,这些结果是建立在次线性函数和广义凸函数的基础上的.     

一类次线性算子在齐型广义Orlicz-Campanato空间上的加权有界性

设X是齐型空间,Φ为Young函数,并设次线性算子T是从L^Φ（X,ω）到L^Φ（X^＋,β）有界的.建立了算子T从广义Orlicz-Campanato空间L^Φ,φ（X,ω）到L^Φ,φ（X^＋,β）的加权有界性,并特别建立了广义极大算子M的有界性.     

Maximal function characterizations of Hardy spaces on RD-spaces and their applications

Let X be an RD-space, i.e., a space of homogeneous type in the sense of Coifman and Weiss, which has the reverse doubling property. Assume that X has a dimension n. For α∈ (0, ∞) denote by Hαp(X ), Hdp(X ), and H?,p(X ) the corresponding Hardy spaces on X defined by the nontangential maximal function, the dyadic maximal function and the grand maximal function, respectively. Using a new inhomogeneous Calder′on reproducing formula, it is shown that all these Hardy spaces coincide with Lp(X ) when p ∈ (1, ∞] a...     

次线性算子在Herz-Morrey空间上的有界性

引进了一类被称为Herz-Morrey空间的函数空间,并给出了关于次线性算子在较弱的局部尺寸条件下在这类空间上有界性的一些一般性的结果．     

On the Representation of Approximate Subdifferentials for a Class of Generalized Convex Functions

Given a family of real-valued functions defined in a normed vector space X, we study a class of -convex functions having a simpler representation for the --subdifferential. The case =X^* with X being a Banach space (the Fenchel case) is particularly analysed, and we find that the sublinear lower semicontinuous functions satisfy the simpler representation with respect to X^*. As a side result, we provide various new subdifferential-type charaterizations of positively homogeneous functions among those which are lower semicontinuous and convex. In addition, we also discuss that family related to the the so-called prox-bounded functions. In this more general framework our simpler representation may give rise to a new notion of enlargement of the subdifferential.Mathematics Subject Classifications (2000) 47H05, 46B99, 47H17.This work is based on research material supported in part by CONICYT-Chile through FONDECYT 101-0116 and FONDAP-Matemáticas Aplicadas II.     

EXISTENCE OF POSITIVE SOLUTIONS TO(n-1,1)CONJUGATE BOUNDARY VALUE PROBLEMS

1IntroductionInarecentpaper[fi,P.W.EloeandJ.Hendersonstudiedtheexistenceofpositivesolutionsofthefollowingnonlinear(n--l,l)conjugateboundaryvalueproblem'TheworkwassupportedbyNSFofHeilonaiiangandNNSFofChinawheref:[0,co)-[0,co),a:[0,l]-[0,co)arecontinuousand…     

OSCILLATION CRITERIA FOR STRONGLY SUPERLINEAR AND STRONGLY SUBLINEAR HIGHER ORDER DYNAMIC EQUATIONS ON TIME SCALES

We establish some new criteria for the oscillation of even order nonlinear dynamic equation. We study the case of strongly super-linear and the case of strongly sub-linear subject to various conditions.