A modified steepest descent method with applications to maximizing likelihood functions

In maximizing a non-linear function G(), it is well known that the steepest descent method has a slow convergence rate. Here we propose a systematic procedure to obtain a 1–1 transformation on the variables , so that in the space of the transformed variables, the steepest descent method produces the solution faster. The final solution in the original space is obtained by taking the inverse transformation. We apply the procedure in maximizing the likelihood functions of some generalized distributions which are widely used in modeling count data. It was shown that for these distributions, the steepest descent method via transformations produced the solutions very fast. It is also observed that the proposed procedure can be used to expedite the convergence rate of the first derivative based algorithms, such as Polak-Ribiere, Fletcher and Reeves conjugate gradient methods as well.     

Convexifactors,generalized convexity and vector optimization

In this article we study a recently introduced notion of non-smooth analysis, namely convexifactors. We study some properties of the convexifactors and introduce two new chain rules. A new notion of non-smooth pseudoconvex function is introduced and its properties are studied in terms of convexifactors. We also present some optimality conditions for vector minimization in terms of convexifactors.     

Existence and regularity of solution to the generalized Tricomi equation with a singular initial datum at a point

In this paper, we study the existence and regularity of a solution to the initial datum problem of a semilinear generalized Tricomi equation in mixed-type domain. We suppose that an initial datum on the degenerate plane is smooth away from the origin, and has a conormal singularity at this point, then we show that in some mixed-type domain, the solution exists and is conormal with respect to the characteristic conic surface which is issued from the origin and has a cusp singularity.     

Impulsive generalized function synchronization of complex dynamical networks

This Letter investigates generalized function synchronization of continuous and discrete complex networks by impulsive control. By constructing the reasonable corresponding impulsively controlled response networks, some criteria and corollaries are derived for the generalized function synchronization between the impulsively controlled complex networks, continuous and discrete networks are both included. Furthermore, the generalized linear synchronization and nonlinear synchronization are respectively illustrated by several examples. All the numerical simulations demonstrate the correctness of the theoretical results.     

What is quasiconvex analysis?

We endeavour to answer the question of the title, or rather the question of how much one can extend convex analysis to a wider framework in which some convexity features remain. Subdifferential calculus and duality are the main directions we consider     

On the Pseudoconvexity of a Quadratic Fractional Function

In this paper we give a necessary and sufficient condition for the pseudoconvexity of a function f which is the ratio of a quadratic function over an affine function. The obtained results allow to suggest a simple algorithm to test the pseudoconvexity of f and also to characterize the pseudoconvexity of the sum of a linear and a linear fractional function.     

Generalized Levitin-Polyak Well-Posedness for Generalized Semi-Infinite Programs

In this article, we study the generalized Levitin-Polyak well-posedness of generalized semi-infinite programs. We first give the criteria and characterizations for two types of well-posedness. We then establish the convergence of a class of penalty methods under the assumption of generalized type I Levitin-Polyak well-posedness.     

Finite tchebycheff transformations of generalized functions

By using Hilbert space techniques, the finite Tchebycheff transformations of the first and the second kind are defined on appropriate spaces of generalized functions. The inversion theorems are established and some operation transform formulas are obtained. These results are applied in solving certain distributional differential equations.     

Krull property of generalized power series rings

Let D be an integral domain and let $(S,\le )$ be a torsion-free, ≤-cancellative, subtotally ordered monoid. We show that the generalized power series ring $?D^{S,\le }?$ is a Krull domain if and only if D is a Krull domain and S is a Krull monoid.