On a class of equilibrium problems in the real axis

In a series of seminal papers, Thomas J. Stieltjes (1856-1894) gave an elegant electrostatic interpretation for the zeros of classical families of orthogonal polynomials, such as Jacobi, Hermite and Laguerre polynomials. More generally, he extended this approach to the zeros of polynomial solutions of certain second-order linear differential equations (Lamé equations), the so-called Heine-Stieltjes polynomials.In this paper, a class of electrostatic equilibrium problems in R, where the free unit charges x₁,…,x_n∈R are in presence of a finite family of “attractors” (i.e., negative charges) z₁,…,z_m∈C?R, is considered and its connection with certain class of Lamé-type equations is shown. In addition, we study the situation when both n→∞ and m→∞, by analyzing the corresponding (continuous) equilibrium problem in presence of a certain class of external fields.     

On the numerical solution of a class of Stackelberg problems

This study tries to develop two new approaches to the numerical solution of Stackelberg problems. In both of them the tools of nonsmooth analysis are extensively exploited; in particular we utilize some results concerning the differentiability of marginal functions and some stability results concerning the solutions of convex programs. The approaches are illustrated by simple examples and an optimum design problem with an elliptic variational inequality.Prepared while the author was visiting the Department of Mathematics, University of Bayreuth as a guest of the FSP Anwendungsbezogene Optimierung und Steuerung.     

A class of operator equilibrium problems

In this paper, we consider a class of operator equilibrium problems (OEP for short) with operator solutions and derive a Minty type lemma for this class of problems. Further, using this lemma and KKM theorem, we establish some existence theorems for OEP. The theorems presented in this paper generalize, improve and unify many known results.     

A predictor-corrector method for a class of equilibrium problems

We consider two classes of generalized monotone functions and generalized skew symmetric functions. By applying the method of auxiliary-principle, we propose and study a predictor-corrector algorithm for solving mixed quasiequilibrium problems involving σ -pseudomonotone functions with respect to a ξ -skew symmetric bifunction, which are concepts introduced in this paper. We prove the convergence of the iterative sequence under generalized pseudomonotonicity and skew symmetry assumptions, improving some known results in the recent literature. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

New inertial algorithm for a class of equilibrium problems

Numerical Algorithms - The article introduces a new algorithm for solving a class of equilibrium problems involving strongly pseudomonotone bifunctions with a Lipschitz-type condition. We describe...     

On a class of constrained functional minimization problems and their numerical solution

We investigate a class of functional minimization problems with constraints. By means of variational principles, optimal control theory, and numerical methods for nonlinear equations, numerical methods and the corresponding computer software are established to solve the problems. These tools can be used in fitting curves with arbitrary smoothness, different boundary conditions, and constraints. For special boundary conditions, analytical expressions of the curves are derived. Numerical examples are given to demonstrate the effectiveness of the algorithms by the means of curve fitting.     

Modified basic projection methods for a class of equilibrium problems

Projection methods are a popular class of methods for solving equilibrium problems. In this paper, we propose approximate one projection methods for solving a class of equilibrium problems, where the cost bifunctions are paramonotone, the feasible sets are defined by a continuous convex function inequality and not necessarily differentiable in the Euclidean space \(\mathcal R^{s}\). At each main iteration step in our algorithms, the usual projections onto the feasible set are replaced by computing inexact subgradients and one projection onto the intersection of two halfspaces containing the solution set of the equilibrium problems. Then, by choosing suitable parameters, we prove convergence of the whole generated sequence to a solution of the problems, under only the assumptions of continuity and paramonotonicity of the bifunctions. Finally, we present some computational examples to illustrate the assumptions of the proposed algorithms.     

On Hölder calmness of solution mappings in parametric equilibrium problems

We consider parametric equilibrium problems in metric spaces. Sufficient conditions for the Hölder calmness of solutions are established. We also study the Hölder well-posedness for equilibrium problems in metric spaces.     

Proximal methods for a class of bilevel monotone equilibrium problems

We consider a bilevel problem involving two monotone equilibrium bifunctions and we show that this problem can be solved by a simple proximal method. Under mild conditions, the weak convergence of the sequences generated by the algorithm is obtained. Using this result we obtain corollaries which improve several corresponding results in this field.     

On nonconvex equilibrium problems

In this paper, we introduce a new class of equilibrium problems, known as mixed quasi nonconvex equilibrium problems. We suggest some iterative schemes for solving nonconvex equilibrium problems by using the auxiliary principle technique. The convergence of the proposed methods either requires partially relaxed strongly monotonicity or pseudomonotonicity. As special cases, we obtain a number of known and new results for solving various classes of equilibrium and variational inequality problems.     

On a class of extremal problems

In the paper we introduce a class of trigonometrical polynomial extremal problems depending on a continuous parameter 0≤r≤1. It turns out that the two border cases r=0 and r=1 are known problems investigated earlier by Kamae, Mendes-France, Ruzsa and the present author. We also introduce another set of extremal problems for measures with similar parametrization, and prove a duality relationship between the two type of extremal quantities. The proof relies on a minimax theorem proved earlier by the author. The known duality results are proved as corollaries. 1980 MS Classification. Primary 42A05; Secondary 46B25, 46N05.     

Exact solution of a class of nonlinear knapsack problems

We consider a class of nonlinear knapsack problems with applications in service systems design and facility location problems with congestion. We provide two linearizations and their respective solution approaches. The first is solved directly using a commercial solver. The second is a piecewise linearization that is solved by a cutting plane method.     

Numerical solution of a class of bilevel programming problems

A quadratic-linear bilevel programming problem is considered. Its optimistic statement is reduced to a series of nonconvex unilevel problems. An approximate algorithm for global search in reduced problems is proposed. Numerical solutions of randomly generated test problems are given and analyzed.     

Approximate solution of a class of singular control problems

A class of singular control problems involving amplitude constraints on the controls is examined. IfL is the space of control functionsU, the control constraint setS can be identified with the unit ball inL . Now, for anyn (1, ), an analogous problem may be set up withL ⁿ forU and the unit ball inL ⁿ forS. This modified problem is necessarily nonsingular for controllable systems. It is shown that, by takingn sufficiently large, the solution to the modified problem also solves the original problem arbitrarily closely (in a sense made precise). Behavior asn is investigated.This research was supported by the Science Research Council of Great Britain and the Commonwealth Fund (Harkness Fellowship).