A note on a nonlocal nonlinear reaction–diffusion model

We give an application of the Crandall–Rabinowitz theorem on local bifurcation to a system of nonlinear parabolic equations with nonlocal reaction and cross-diffusion terms as well as nonlocal initial conditions. The system arises as steady-state equations of two interacting age-structured populations.     

A Lyapunov functional for a stage-structured predator–prey model with nonlinear predation rate

We consider the dynamics of a general stage-structured predator–prey model which generalizes several known predator–prey, SEIR, and virus dynamics models, assuming that the intrinsic growth rate of the prey, the predation rate, and the removal functions are given in an unspecified form. Using the Lyapunov method, we derive sufficient conditions for the local stability of the equilibria together with estimations of their respective domains of attraction, while observing that in several particular but important situations these conditions yield global stability results. The biological significance of these conditions is discussed and the existence of the positive steady state is also investigated.     

A mixed integer nonlinear programming model for the optimal repair–replacement in the firm

Optimal repair–replacement problem is an important aspect of economic decision making at the firm and aggregate levels. In this paper, we extend the continuous time optimal replacement model in the firm under technological progress by considering the possibility of repairing/replacing the machines during their lifetime period. In our model, two possible decisions can be recognized by the managers in which the machines are repaired under the efficiency condition or replaced under the availability of technological progress in the firm. As a special case, we restrict the model to the more real case in which all the growth, purchase price and repair cost functions are assumed to be in the exponential form. The solvability of the model in this case is also discussed.     

A kinetic model for coagulation–fragmentation

The aim of this paper is to show an existence theorem for a kinetic model of coagulation–fragmentation with initial data satisfying the natural physical bounds, and assumptions of finite number of particles and finite Lp$L^p$-norm. We use the notion of renormalized solutions introduced by DiPerna and Lions (1989) [3], because of the lack of a priori   estimates. The proof is based on weak-compactness methods in L¹$L^1$, allowed by Lp$L^p$-norms propagation.     

A nonlinear Klein–Gordon equation on Kerr metrics

We consider the nonlinear Klein–Gordon equation □u+m²u+λ|u|²u=0, with λ⩾0, outside a Kerr black hole. We solve the global Cauchy problem for large data with minimum regularity. Then, using a Penrose compactification, we prove, in the massless case, the existence of smooth asymptotic profiles and Sommerfeld radiation conditions, at the horizon and at null infinity, for smooth solutions.     

A remark on “A nonlinear mathematical model of the corneal shape”

An analytical method using Taylor series is proposed to solve a nonlinear two-point boundary problem arising in corneal shape. The solution process makes it extremely easy to obtain a relatively accurate solution. The pencil-and-paper solution procedure can be extended to other boundary value problems.     

A Lagrange–Newton algorithm for sparse nonlinear programming

Mathematical Programming - The sparse nonlinear programming (SNP) problem has wide applications in signal and image processing, machine learning and finance, etc. However, the computational...     

A Jacobi–Davidson like method for nonlinear eigenvalue problems based on singularity theory

We present a Jacobi–Davidson like correction formula for left and right eigenvector approximations for non-Hermitian nonlinear eigenvalue problems. It exploits techniques from singularity theory for characterizing singular points of nonlinear equations. Unlike standard nonlinear Jacobi-Davidson, the correction formula does not contain derivative information and works with orthogonal projectors only. Moreover, the basic method is modified in that the new eigenvalue approximation is taken as a nonlinear Rayleigh functional obtained as root of a certain scalar nonlinear equation the existence of which – as well as a first order perturbation expansion – is shown. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Soliton perturbation theory for phi-four model and nonlinear Klein–Gordon equations

This paper obtains the adiabatic variation of the soliton velocity, in presence of perturbation terms, of the phi-four model and the nonlinear Klein–Gordon equations. There are three types of models of the nonlinear Klein–Gordon equation, with power law nonlinearity, that are studied in this paper. The soliton perturbation theory is utilized to carry out this investigation.     

A bioeconomic differential algebraic predator–prey model with nonlinear prey harvesting

In this paper, we propose a bioeconomic differential algebraic predator–prey model with Holling type II functional response and nonlinear prey harvesting. As the nonlinear prey harvesting is introduced, the proposed model displays a complex dynamics in the predator–prey plane. Taking into account of the economic factor, our predator–prey system is established by bioeconomic differential algebraic equations. The effect of economic profit on the proposed model is analyzed by viewing it as a bifurcation parameter. By jointly using the normal form of differential algebraic models and the bifurcation theory, the stability and bifurcations (singularity induced bifurcation, Hopf bifurcation) are discussed. These results obtained here reveal richer dynamics of the bioeconomic differential algebraic predator–prey model with nonlinear prey harvesting, and suggest a guidance for harvesting in the practical word. Finally, numerical simulations are given to demonstrate the results.     

A constrained nonlinear 0–1 program for data allocation

This paper analyzes the problem of allocating copies of relations from a global database to the sites of a geographically distributed communication network. The objective of the allocation is to minimize the total cost due to transmissions generated by queries from the various sites, including queries that access multiple relations. This allocation problem is modeled as a constrained nonlinear 0–1 subproblems generated during subgradient optimization are solved as optimization. Some of the unconstrained quadratic 0–1 subproblems generated during subgradient optimization are solved as maximum flow problems, while the others require implicit enumeration, depending on the nature of the objective function coefficients of the subproblems. Our solution approach is tested extensively on data allocation problems with as many as 100 sites and 20 relations. On a set of randomly generated test problems our approach was close to two orders of magnitude faster than the general purpose integer programming code OSL.     

A multistage algorithm for best-subset model selection based on the Kullback–Leibler discrepancy

The selection of a best-subset regression model from a candidate family is a common problem that arises in many analyses. The Akaike information criterion (AIC) and the corrected AIC (\(\text {AIC}_c\)) are frequently used for this purpose. AIC and \(\text {AIC}_c\) are designed to estimate the expected Kullback–Leibler discrepancy. For best-subset selection, both AIC and \(\text {AIC}_c\) are negatively biased, and the use of either criterion will lead to the selection of overfitted models. To correct for this bias, we introduce an “improved” AIC variant, \(\text {AIC}_i\), which has a penalty term evaluated using Monte Carlo simulation. A multistage model selection procedure \(\text {AIC}_{\text {aps}}\), which utilizes \(\text {AIC}_i\), is proposed for best-subset selection. Simulation studies are compiled to compare the performances of the different model selection methods.     

A continuous model for production–distribution system design

The production–distribution system design problem (PDSDP) involves decisions concerning the structure of a firm's supply chain. An overwhelming majority of the literature uses mixed integer programming formulations in representing such facility design decisions. In this paper, we present an alternative modeling framework, which is based on the use of continuous functions to represent spatial distributions of cost and customer demand. The proposed continuous model allows the derivation of a number of insights about the impact of problem parameters on facility design decisions. It is proposed that discrete and continuous modeling approaches complement each other.     

Fast calculation based on a spatial two-grid finite element algorithm for a nonlinear space–time fractional diffusion model

In this article, a spatial two-grid finite element (TGFE) algorithm is used to solve a two-dimensional nonlinear space–time fractional diffusion model and improve the computational efficiency. First, the second-order backward difference scheme is used to formulate the time approximation, where the time-fractional derivative is approximated by the weighted and shifted Grünwald difference operator. In order to reduce the computation time of the standard FE method, a TGFE algorithm is developed. The specific algorithm is to iteratively solve a nonlinear system on the coarse grid and then to solve a linear system on the fine grid. We prove the scheme stability of the TGFE algorithm and derive a priori error estimate with the convergence result O(Δt² + h^{r + 1 − η} + H^{2r + 2 − 2η}) . Finally, through a two-dimensional numerical calculation, we improve the computational efficiency and reduce the computation time by the TGFE algorithm.     

A primal–dual interior point method for nonlinear semidefinite programming

This paper is concerned with a primal–dual interior point method for solving nonlinear semidefinite programming problems. The method consists of the outer iteration (SDPIP) that finds a KKT point and the inner iteration (SDPLS) that calculates an approximate barrier KKT point. Algorithm SDPLS uses a commutative class of Newton-like directions for the generation of line search directions. By combining the primal barrier penalty function and the primal–dual barrier function, a new primal–dual merit function is proposed. We prove the global convergence property of our method. Finally some numerical experiments are given.     

Levenberg–Marquardt method based on probabilistic Jacobian models for nonlinear equations

In this paper, we propose a Levenberg–Marquardt method based on probabilistic models for nonlinear equations for which the Jacobian cannot be computed accurately or the computation is very expensive. We introduce the definition of the first-order accurate probabilistic Jacobian model, and show how to construct such a model with sample points generated by standard Gaussian distribution. Under certain conditions, we prove that the proposed method converges to a first order stationary point with probability one. Numerical results show the efficiency of the method.

     

Study on existence of solutions for some nonlinear functional–integral equations

Using the technique of measures of noncompactness in Banach algebra, we employ abstract fixed point theorems such as Darbo’s theorem to study the existence solution in Banach algebra C[0,a]$C[0,a]$ for some functional–integral equations which include many key integral and functional equations that arise in nonlinear analysis.