AN OPTIMAL CONTROL PROBLEM FOR A LOTKA-VOLTERRA COMPETITION MODEL WITH CHEMO-REPULSION

In this paper we study a bilinear optimal control problem for a diffusive Lotka-Volterra competition model with chemo-repulsion in a bounded domain of ℝ^(ℕ),N=2,3.This model describes the competition of two species in which one of them avoid encounters with rivals through a chemo-repulsion mechanism.We prove the existence and uniqueness of weak-strong solutions,and then we analyze the existence of a global optimal solution for a related bilinear optimal control problem,where the control is acting on the chemical signal.Posteriorly,we derive first-order optimality conditions for local optimal solutions using the Lagrange multipliers theory.Finally,we propose a discrete approximation scheme of the optimality system based on the gradient method,which is validated with some computational experiments.

GLOBAL CONVERGENCE OF A CLASS OF OPTIMALLY CONDITIONED SSVM METHODS

This paper explores the convergence of a class of optimally conditioned self scaling variable metric (OCSSVM) methods for unconstrained optimization. We show that this class of methods with Wolfe line search are globally convergent for general convex functions.

Application of the Conditional Nonlinear Optimal Perturbation Method to the Predictability Study of the Kuroshio Large Meander

A reduced-gravity barotropic shallow-water model was used to simulate the Kuroshio path variations. The results show that the model was able to capture the essential features of these path variations. We used one simulation of the model as the reference state and investigated the effects of errors in model parameters on the prediction of the transition to the Kuroshio large meander （KLM） state using the conditional nonlinear optimal parameter perturbation （CNOP-P） method. Because of their relatively large uncertainties, three model parameters were considered： the interracial friction coefficient, the wind-stress amplitude, and the lateral friction coefficient. We determined the CNOP-Ps optimized for each of these three parameters independently, and we optimized all three parameters simultaneously using the Spectral Projected Gradient 2 （SPG2） algorithm. Similarly, the impacts caused by errors in initial conditions were examined using the conditional nonlinear optimal initial perturbation （CNOP-I） method. Both the CNOP-I and CNOP-Ps can result in significant prediction errors of the KLM over a lead time of 240 days. But the prediction error caused by CNOP-I is greater than that caused by CNOP-P. The results of this study indicate not only that initial condition errors have greater effects on the prediction of the KLM than errors in model parameters but also that the latter cannot be ignored. Hence, to enhance the forecast skill of the KLM in this model, the initial conditions should first be improved, the model parameters should use the best possible estimates.

SECOND-ORDER OPTIMALITY CONDITIONS FOR OPTIMAL CONTROL PROBLEMS GOVERNED BY 3-DIMENSIONAL NEVIER-STOKES EQUATIONS

This article is concerned with second-order necessary and sufficient optimality conditions for optimal control problems governed by 3-dimensional Navier-Stokes equations. The periodic state constraint is considered.

OPTIMALITY CONDITIONS AND DUALITY RESULTS FOR NONSMOOTH VECTOR OPTIMIZATION PROBLEMS WITH THE MULTIPLE INTERVAL-VALUED OBJECTIVE FUNCTION

In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a （weakly） LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.

A Variant Constrained Genetic Algorithm for Solving Conditional Nonlinear Optimal Perturbations

A variant constrained genetic algorithm （VCGA） for effective tracking of conditional nonlinear optimal perturbations （CNOPs） is presented. Compared with traditional constraint handling methods, the treatment of the constraint condition in VCGA is relatively easy to implement. Moreover, it does not require adjustments to indefinite pararneters. Using a hybrid crossover operator and the newly developed multi-ply mutation operator, VCGA improves the performance of GAs. To demonstrate the capability of VCGA to catch CNOPS in non-smooth cases, a partial differential equation, which has ＂on off＂ switches in its forcing term, is employed as the nonlinear model. To search global CNOPs of the nonlinear model, numerical experiments using VCGA, the traditional gradient descent algorithm based on the adjoint method （ADJ）, and a GA using tournament selection operation and the niching technique （GA-DEB） were performed. The results with various initial reference states showed that, in smooth cases, all three optimization methods are able to catch global CNOPs. Nevertheless, in non-smooth situations, a large proportion of CNOPs captured by the ADJ are local. Compared with ADJ, the performance of GA-DEB shows considerable improvement, but it is far below VCGA. Further, the impacts of population sizes on both VCGA and GA-DEB were investigated. The results were used to estimate the computation time of ~CGA and GA-DEB in obtaining CNOPs. The computational costs for VCGA, GA-DEB and ADJ to catch CNOPs of the nonlinear model are also compared.

Optimal reaction conditions for pyridine synthesis in riser reactor

Pjridine has been generally synthesized by aldehydes and ammonia in a turbulent fluidized-bed reactor. In this paper, a novel riser reactor was proposed for pyridine synthesis. Experiment result showed that the yield of pyridine and 3-picoline decreased, but the selectivity of pyridine over 3-picoline increased compared to turbulent fluidized-bed reactor. Based on experimental data, a modified kinetic model was used for the determination of optimal operating condition for riser reactor. The optimal operating condition of riser reactor given by this modified model was as follows： The reaction temperature of 755 K, catalyst to feedstock ratio （CTFR） of 87, residence timeof3.8sandinitialacetaldehydesconcentrationof0.0029mol.L-1 （acetaldehydes to formaldehydes ratio by mole （ATFR） of 0.65 and ammonia to aldehydes ratio by mole （ATAR） of 0.9, water contention of 63wt% （formaldehyde solution））.

Sufficient Optimality Conditions for Multiobjective Programming Involving (V, ρ)h,ψ-type Ⅰ Functions

New classes of functions namely (V, ρ)_(h,φ)-type I, quasi (V, ρ)_(h,φ)-type I and pseudo (V, ρ)_(h,φ)-type I functions are defined for multiobjective programming problem by using BenTal's generalized algebraic operation. The examples of (V, ρ)_(h,φ)-type I functions are given. The sufficient optimality conditions are obtained for multi-objective programming problem involving above new generalized convexity.

THE OPTIMALITY CONDITIONS OF NONCONVEXSET-VALUED VECTOR OPTIMIZATION

The concepts of alpha-order Clarke's derivative, alpha-order Adjacent derivative and alpha-order G.Bouligand derivative of set-valued mappings are introduced, their properties are studied, with which the Fritz John optimality condition of set-valued vector optimization is established. Finally, under the assumption of pseudoconvexity, the optimality condition is proved to be sufficient.

Algorithm Studies on How to Obtain a Conditional Nonlinear Optimal Perturbation (CNOP)

The conditional nonlinear optimal perturbation （CNOP）, which is a nonlinear generalization of the linear singular vector （LSV）, is applied in important problems of atmospheric and oceanic sciences, including ENSO predictability, targeted observations, and ensemble forecast. In this study, we investigate the computational cost of obtaining the CNOP by several methods. Differences and similarities, in terms of the computational error and cost in obtaining the CNOP, are compared among the sequential quadratic programming （SQP） algorithm, the limited memory Broyden-Fletcher-Goldfarb-Shanno （L-BFGS） algorithm, and the spectral projected gradients （SPG2） algorithm. A theoretical grassland ecosystem model and the classical Lorenz model are used as examples. Numerical results demonstrate that the computational error is acceptable with all three algorithms. The computational cost to obtain the CNOP is reduced by using the SQP algorithm. The experimental results also reveal that the L-BFGS algorithm is the most effective algorithm among the three optimization algorithms for obtaining the CNOP. The numerical results suggest a new approach and algorithm for obtaining the CNOP for a large-scale optimization problem.

Global optimality conditions for quadratic 0-1 programming with inequality constraints

Quadratic 0-1 problems with linear inequality constraints are briefly considered in this paper.Global optimality conditions for these problems,including a necessary condition and some sufficient conditions,are presented.The necessary condition is expressed without dual variables.The relations between the global optimal solutions of nonconvex quadratic 0-1 problems and the associated relaxed convex problems are also studied.

Application of the Conditional Nonlinear Optimal Perturbations Method in a Theoretical Grassland Ecosystem

Using a simplified nonlinearly theoretical grassland ecosystem proposed by Zeng et al.,we study the sensitivity and nonlinear instability of the grassland ecosystem to finiteamplitude initial perturbations with the approach of conditional nonlinear optimal perturbation （CNOP）.The results show that the linearly stable grassland （desert or latent desert） states can turn to be nonlinearly unstable with finite amplitude initial perturbations.When the precipitation is between the two bifurcation points,a large enough finite amplitude initial perturbation can induce a transition between the grassland statethe desert state or the latent desert.

Optimality conditions and duality for a class of nondifferentiable multiobjective generalized fractional programming problems

This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators are the difference of differentiable function and convex function. Under the assumption of Calmness Constraint Qualification the Kuhn-Tucker type necessary conditions for efficient solution are given, and the Kuhn-Tucker type sufficient conditions for efficient solution are presented under the assumptions of （F, α, ρ, d）-V-convexity. Subsequently, the optimality conditions for two kinds of duality models are formulated and duality theorems are proved.

Applications of Conditional Nonlinear Optimal Perturbation to the Study of the Stability and Sensitivity of the Jovian Atmosphere

A two-layer quasi-geostrophic model is used to study the stability and sensitivity of motions on smallscale vortices in Jupiter＇s atmosphere. Conditional nonlinear optimal perturbations （CNOPs） and linear singular vectors （LSVs） are both obtained numerically and compared in this paper. The results show that CNOPs can capture the nonlinear characteristics of motions in small-scale vortices in Jupiter＇s atmosphere and show great difference from LSVs under the condition that the initial constraint condition is large or the optimization time is not very short or both. Besides, in some basic states, local CNOPs are found. The pattern of LSV is more similar to local CNOP than global CNOP in some cases. The elementary application of the method of CNOP to the Jovian atmosphere helps us to explore the stability of variousscale motions of Jupiter＇s atmosphere and to compare the stability of motions in Jupiter＇s atmosphere and Earth＇s atmosphere further.

Optimality Conditions and Duality for Nonsmooth Multiobjective Programms with Generalized Essential Convexity

In this paper, we introduce generalized essentially pseudoconvex function and generalized essentially quasiconvex function, and give sufficient optimality conditions of the nonsmooth generalized convex multi-objective programming and its saddle point theorem about cone efficient solution. We set up Mond-Weir type duality and Craven type duality for nonsmooth multiobjective programming with generalized essentially convex functions, and prove them.

THE EFFECTIVENESS OF GENETIC ALGORITHM IN CAPTURING CONDITIONAL NONLINEAR OPTIMAL PERTURBATION WITH PARAMETERIZATION “ON-OFF” SWITCHES INCLUDED BY A MODEL

In the typhoon adaptive observation based on conditional nonlinear optimal perturbation (CNOP), the ‘on-off’ switch caused by moist physical parameterization in prediction models prevents the conventional adjoint method from providing correct gradient during the optimization process. To address this problem, the capture of CNOP, when the "on-off" switches are included in models, is treated as non-smooth optimization in this study, and the genetic algorithm (GA) is introduced. After detailed algorithm procedures are formulated using an idealized model with parameterization "on-off" switches in the forcing term, the impacts of "on-off" switches on the capture of CNOP are analyzed, and three numerical experiments are conducted to check the effectiveness of GA in capturing CNOP and to analyze the impacts of different initial populations on the optimization result. The result shows that GA is competent for the capture of CNOP in the context of the idealized model with parameterization ‘on-off’ switches in this study. Finally, the advantages and disadvantages of GA in capturing CNOP are analyzed in detail.

Necessary Optimality Conditions for Multi-Objective Semi-Infinite Variational Problem

In this paper, necessary optimality conditions for a class of Semi-infinite Variational Problems are established which are further generalized to a class of Multi-objective Semi-Infinite Variational Problems. These conditions are responsible for the development of duality theory which is an extremely important feature for any class of problems, but the literature available so far lacks these necessary optimality conditions for the stated problem. A lemma is also proved to find the topological dual of as it is required to prove the desired result.

Axisymmetric Powell-Eyring fluid flow with convective boundary condition: optimal analysis

The effects of axisymmetric flow of a Powell-Eyring fluid over an impermeable radially stretching surface are presented. Characteristics of the heat transfer process are analyzed with a more realistic condition named the convective boundary condition. Governing equations for the flow problem are derived by the boundary layer approximations. The modeled highly coupled partial differential system is converted into a system of ordinary differential equations with acceptable similarity transformations. The convergent series solutions for the resulting system are constructed and analyzed. Optimal values are obtained and presented in a numerical form using an optimal homotopy analysis method （OHAM）. The rheological characteristics of different parameters of the velocity and temperature profiles are presented graphically. Tabular variations of the skin friction coefficient and the Nusselt number are also calculated. It is observed that the temperature distribution shows opposite behavior for Prandtl and Biot numbers. Furthermore, the rate of heating/cooling is higher for both the Prandtl and Biot numbers.

Optimality conditions in set optimization employing higher-order radial derivatives

There are two approaches of defining the solutions of a set-valued optimization problem： vector criterion and set criterion. This note is devoted to higher-order optimality conditions using both criteria of solutions for a constrained set-valued optimization problem in terms of higher-order radial derivatives. In the case of vector criterion, some optimality conditions are derived for isolated （weak） minimizers. With set criterion, necessary and sufficient optimality conditions are established for minimal solutions relative to lower set-order relation.

The Optimality Conditions for Multiobjective Semi-infinite Programming Involving Generalized Unified （C, α, p, d）-convexity

The definition of generalized unified (C, α, ρ, d)-convex function is given. The concepts of generalized unified (C, α, ρ, d)-quasiconvexity, generalized unified (C, α, ρ, d)-pseudoconvexity and generalized unified (C, α, ρ, d)-strictly pseudoconvex functions are presented. The sufficient optimality conditions for multiobjective nonsmooth semi-infinite programming are obtained involving these generalized convexity lastly.