On coderivatives and Lipschitzian properties of the dual pair in optimization

In this paper, we apply the concept of coderivative and other tools from the generalized differentiation theory for set-valued mappings to study the stability of the feasible sets of both the primal and the dual problem in infinite-dimensional linear optimization with infinitely many explicit constraints and an additional conic constraint. After providing some specific duality results for our dual pair, we study the Lipschitz-like property of both mappings and also give bounds for the associated Lipschitz moduli. The situation for the dual shows much more involved than the case of the primal problem.     

Asymptotic theory for the multidimensional random on-line nearest-neighbour graph

The on-line nearest-neighbour graph on a sequence of n$n$ uniform random points in (0,1)^d${(0,1)}^d$ (d∈N$d\in \mathbb{N}$) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this graph, with weight exponent α∈(0,d/2]$\alpha \in (0,d/2]$, we prove O(max{n^1−(2α/d),logn})$O(max\{n^{1-(2\alpha /d)},logn\})$ upper bounds on the variance. On the other hand, we give an n→∞$n\to \infty$ large-sample convergence result for the total power-weighted edge-length when α>d/2$\alpha >d/2$. We prove corresponding results when the underlying point set is a Poisson process of intensity n$n$.     

Convergence analysis of nonsmooth equations for the general nonlinear complementarity problem

This paper deals with a general nonlinear complementarity problem, where the underlying functions are assumed to be continuous. Based on a nonlinear complementarity function, it is transformed into a system of nonsmooth equations. Then, two kinds of approximate Newton methods for the nonsmooth equations are developed and their convergence are proved. Finally, numerical tests are also listed.     

A new family of conjugate gradient methods

In this paper we develop a new class of conjugate gradient methods for unconstrained optimization problems. A new nonmonotone line search technique is proposed to guarantee the global convergence of these conjugate gradient methods under some mild conditions. In particular, Polak–Ribiére–Polyak and Liu–Storey conjugate gradient methods are special cases of the new class of conjugate gradient methods. By estimating the local Lipschitz constant of the derivative of objective functions, we can find an adequate step size and substantially decrease the function evaluations at each iteration. Numerical results show that these new conjugate gradient methods are effective in minimizing large-scale non-convex non-quadratic functions.     

BFGS trust-region method for symmetric nonlinear equations

In this paper, we propose a BFGS trust-region method for solving symmetric nonlinear equations. The global convergence and the superlinear convergence of the presented method will be established under favorable conditions. Numerical results show that the new algorithm is effective.     

Necessary and sufficient conditions for Kuhn-Tucker type optimality and for weak duality of nonsmooth programming

In this paper, we are concerned with a nonsmooth programming problem with inequality constraints. We obtain an optimality condition for Kuhn-Tucker points to be minimizers. Later on, we present necessary and sufficient conditions for weak duality between the primal problem and its mixed type dual, which help us to extend some earlier work from the literature.     

Sufficient conditions for pseudo-Lipschitz property in convex semi-infinite vector optimization problems

This paper is devoted to the study of the pseudo-Lipschitz property of the efficient (Pareto) solution map for the perturbed convex semi-infinite vector optimization problem (CSVO). We establish sufficient conditions for the pseudo-Lipschitz property of the efficient solution map of (CSVO) under continuous perturbations of the right-hand side of the constraints and functional perturbations of the objective function. Examples are given to illustrate the obtained results.     

An ODE-based trust region method for unconstrained optimization problems

In this paper, a new trust region algorithm is proposed for solving unconstrained optimization problems. This method can be regarded as a combination of trust region technique, fixed step-length and ODE-based methods. A feature of this proposed method is that at each iteration, only a system of linear equations is solved to obtain a trial step. Another is that when a trial step is not accepted, the method generates an iterative point whose step-length is defined by a formula. Under some standard assumptions, it is proven that the algorithm is globally convergent and locally superlinear convergent. Preliminary numerical results are reported.     

Piecewise multiplier method and nonlinear integral inequalities for Petrowsky equation with nonlinear dissipation

This work is concerned with obtention of energy decay estimates for Petrowsky equation with a nonlinear dissipation which is active only in an interior subset of the domain. We prove that the piecewise multiplier method as introduced by [20] and [22] for the wave equation can be extended to the Petrowsky equation. Moreover, we also apply some recent results by the author to obtain precise decay rate estimates for the energy, without specifying the growth of the nonlinear dissipation close to the origin by means of convex properties and nonlinear integral inequalities for the energy of the solutions.     

Trees, wreath products and finite Gelfand pairs

We present a new construction of finite Gelfand pairs by looking at the action of the full automorphism group of a finite spherically homogeneous rooted tree of type r on the variety V(r,s) of all spherically homogeneous subtrees of type s.This generalizes well-known examples as the finite ultrametric space, the Hamming scheme and the Johnson scheme.We also present further generalizations of these classical examples. The first two are based on Harary's notions of composition and exponentiation of group actions. Finally, the generalized Johnson scheme provides the inductive step for the harmonic analysis of our main construction.