Tribute to Endre Csáki and Pál Révész

Summary This article provides a glimpse of some of the highlights of the joint work of Endre Csáki and Pál Révész since 1979. The topics of this short exploration of the rich stochastic milieu of this inspiring collaboration revolve around Brownian motion, random walks and their long excursions, local times and additive functionals, iterated processes, almost sure local and global central limit theorems, integral functionals of geometric stochastic processes, favourite sites--favourite values and jump sizes for random walk and Brownian motion, random walking in a random scenery, and large void zones and occupation times for coalescing random walks.     

A non‐linear and non‐local boundary condition for a diffusion equation in petroleum engineering

This article deals with a boundary value problem for Laplace equation with a non‐linear and non‐local boundary condition. This problem comes from petroleum engineering and is used to obtain an estimation of well productivity. The non‐linear and non‐local boundary condition is written on the well boundary. On the outer reservoir boundaries, we have both Dirichlet and Neumann conditions. In this paper, we prove the existence and uniqueness of a solution to this problem. The existence is proved by Schauder theorem and the uniqueness is obtained under more restricted conditions, when the involved operator is a contraction. Copyright © 2005 John Wiley & Sons, Ltd.     

On Constraint Qualifications in Nonsmooth Optimization

We introduce extensions of the Mangasarian-Fromovitz and Abadie constraint qualifications to nonsmooth optimization problems with feasibility given by means of lower-level sets. We do not assume directional differentiability, but only upper semicontinuity of the defining functions. By deriving and reviewing primal first-order optimality conditions for nonsmooth problems, we motivate the formulations of the constraint qualifications. Then, we study their interrelation, and we show how they are related to the Slater condition for nonsmooth convex problems, to nonsmooth reverse-convex problems, to the stability of parametric feasible set mappings, and to alternative theorems for the derivation of dual first-order optimality conditions.In the literature on general semi-infinite programming problems, a number of formally different extensions of the Mangasarian-Fromovitz constraint qualification have been introduced recently under different structural assumptions. We show that all these extensions are unified by the constraint qualification presented here.     

A greedy algorithm for multicut and integral multiflow in rooted trees

We present an O(min(Kn,n²)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality.     

Fixed point theorems in metric spaces

In this paper, we establish two general theorems for equivalence between the Meir–Keeler type contractive conditions and the contractive definitions involving gauge functions. One of these theorems is an extension of a recent result of Lim (On characterization of Meir–Keeler contractive maps, Nonlinear Anal. 46 (2001) 113–120).     

Dual Characterizations of Set Containments with Strict Convex Inequalities

Characterizations of the containment of a convex set either in an arbitrary convex set or in the complement of a finite union of convex sets (i.e., the set, described by reverse-convex inequalities) are given. These characterizations provide ways of verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated systems. The convex sets considered in this paper are the solution sets of an arbitrary number of convex inequalities, which can be either weak or strict inequalities. Particular cases of dual characterizations of set containments have played key roles in solving large scale knowledge-based data classification problems where they are used to describe the containments as inequality constraints in optimization problems. The idea of evenly convex set (intersection of open half spaces), which was introduced by W. Fenchel in 1952, is used to derive the dual conditions, characterizing the set containments.     

Minimax Results and Finite-Dimensional Separation

In this paper, we review and unify some classes of generalized convex functions introduced by different authors to prove minimax results in infinite-dimensional spaces and show the relations between these classes. We list also for the most general class already introduced by Jeyakumar (Ref. 1) an elementary proof of a minimax result. The proof of this result uses only a finite-dimensional separa- tion theorem; although this minimax result was already presented by Neumann (Ref. 2) and independently by Jeyakumar (Ref. 1), we believe that the present proof is shorter and more transparent.     

A new trigonometric method of summation and its application to the degree of approximation

The object of the present investigation is to introduce a new trigonometric method of summation which is both regular and Fourier effective and determine its status with reference to other methods of summation (see §2-§4) and also give an application of this method to determine the degree of approximation in a new Banach space of functions conceived as a generalized Holder metric (see §5).     

Conic Formulation for l p -Norm Optimization

In this paper, we formulate the l _p -norm optimization problem as a conic optimization problem, derive its duality properties (weak duality, zero duality gap, and primal attainment) using standard conic duality and show how it can be solved in polynomial time applying the framework of interior-point algorithms based on self-concordant barriers.     

凸度量空间中单值和集值映象的公共不动点定理

§ 1.　Introduction　　Anecessaryandsufficientconditionandasufficientconditiontoensurethataset valuedmappingandasingle valuedmappinginacompletemetricspaceandacompleteconvexmetricspacehavingacommonfixedpointarerespectivelygivenin [1 ] .Meanwhilethemainresultsin[2 ]— [5]areimprovedandextendedin [1 ] .Inthispaper ,theexistenceatcommonfixedpointsoftwoset valuedmappingandasing valuedmappingwerestudied ,andthecorrespond ingresultsin [1 ]— [5]wereextendedandimproved .Let(X ,d)beanon emptymetricspa…