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.

The Convergence Rate of Fréchet Distribution under the Second-Order Regular Variation Condition

In this article we consider the asymptotic behavior of extreme distribution with the extreme value index γ>0 . The rates of uniform convergence for Fréchet distribution are constructed under the second-order regular variation condition.

On Second-order Sufficient Conditions in Constrained Nonsmooth Optimization

In this paper, we establish a second-order sufficient condition for constrained optimization problems of a class of so called t-stable functions in terms of the first-order and the second-order Dini type directional derivatives. The result extends the corresponding result of [D. Bednarik and K. Pastor, Math. Program. Ser. A, 113（2008）, 283-298] to constrained optimization problems.

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.

Optimization of Generator Based on Gaussian Process Regression Model with Conditional Likelihood Lower Bound Search

The noise that comes from finite element simulation often causes the model to fall into the local optimal solution and over fitting during optimization of generator.Thus,this paper proposes a Gaussian Process Regression(GPR)model based on Conditional Likelihood Lower Bound Search(CLLBS)to optimize the design of the generator,which can filter the noise in the data and search for global optimization by combining the Conditional Likelihood Lower Bound Search method.Taking the efficiency optimization of 15 kW Permanent Magnet Synchronous Motor as an example.Firstly,this method uses the elementary effect analysis to choose the sensitive variables,combining the evolutionary algorithm to design the super Latin cube sampling plan;Then the generator-converter system is simulated by establishing a co-simulation platform to obtain data.A Gaussian process regression model combing the method of the conditional likelihood lower bound search is established,which combined the chi-square test to optimize the accuracy of the model globally.Secondly,after the model reaches the accuracy,the Pareto frontier is obtained through the NSGA-II algorithm by considering the maximum output torque as a constraint.Last,the constrained optimization is transformed into an unconstrained optimizing problem by introducing maximum constrained improvement expectation(CEI)optimization method based on the re-interpolation model,which cross-validated the optimization results of the Gaussian process regression model.The above method increase the efficiency of generator by 0.76%and 0.5%respectively;And this method can be used for rapid modeling and multi-objective optimization of generator systems.

Data-Driven Structural Topology Optimization Method Using Conditional Wasserstein Generative Adversarial Networks with Gradient Penalty

Traditional topology optimization methods often suffer from the“dimension curse”problem,wherein the com-putation time increases exponentially with the degrees of freedom in the background grid.Overcoming this challenge,we introduce a real-time topology optimization approach leveraging Conditional Generative Adversarial Networks with Gradient Penalty(CGAN-GP).This innovative method allows for nearly instantaneous prediction of optimized structures.Given a specific boundary condition,the network can produce a unique optimized structure in a one-to-one manner.The process begins by establishing a dataset using simulation data generated through the Solid Isotropic Material with Penalization(SIMP)method.Subsequently,we design a conditional generative adversarial network and train it to generate optimized structures.To further enhance the quality of the optimized structures produced by CGAN-GP,we incorporate Pix2pixGAN.This augmentation results in sharper topologies,yielding structures with enhanced clarity,de-blurring,and edge smoothing.Our proposed method yields a significant reduction in computational time when compared to traditional topology optimization algorithms,all while maintaining an impressive accuracy rate of up to 85%,as demonstrated through numerical examples.

Ensemble Forecasts of Tropical Cyclone Track with Orthogonal Conditional Nonlinear Optimal Perturbations

This paper preliminarily investigates the application of the orthogonal conditional nonlinear optimal perturbations(CNOPs)–based ensemble forecast technique in MM5(Fifth-generation Pennsylvania State University–National Center for Atmospheric Research Mesoscale Model). The results show that the ensemble forecast members generated by the orthogonal CNOPs present large spreads but tend to be located on the two sides of real tropical cyclone(TC) tracks and have good agreements between ensemble spreads and ensemble-mean forecast errors for TC tracks. Subsequently, these members reflect more reasonable forecast uncertainties and enhance the orthogonal CNOPs–based ensemble-mean forecasts to obtain higher skill for TC tracks than the orthogonal SVs(singular vectors)–, BVs(bred vectors)– and RPs(random perturbations)–based ones. The results indicate that orthogonal CNOPs of smaller magnitudes should be adopted to construct the initial ensemble perturbations for short lead–time forecasts, but those of larger magnitudes should be used for longer lead–time forecasts due to the effects of nonlinearities. The performance of the orthogonal CNOPs–based ensemble-mean forecasts is case-dependent,which encourages evaluating statistically the forecast skill with more TC cases. Finally, the results show that the ensemble forecasts with only initial perturbations in this work do not increase the forecast skill of TC intensity, which may be related with both the coarse model horizontal resolution and the model error.

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.

OPTIMAL INTERIOR PARTIAL REGULARITY FOR NONLINEAR ELLIPTIC SYSTEMS UNDER THE NATURAL GROWTH CONDITION:THE METHOD OF A-HARMONIC APPROXIMATION

In this article, the authors consider the nonlinear elliptic systems under the natural growth condition. They use a new method introduced by Duzaar and Grotowski, for proving partial regularity for weak solutions, based on a generalization of the technique of harmonic approximation. And directly establish the optimal Holder exponent for the derivative of a weak solution.

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.

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.

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.

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.

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.

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.

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.

Weak optimal inverse problems of interval linear programming based on KKT conditions

In this paper,weak optimal inverse problems of interval linear programming(IvLP)are studied based on KKT conditions.Firstly,the problem is precisely defined.Specifically,by adjusting the minimum change of the current cost coefficient,a given weak solution can become optimal.Then,an equivalent characterization of weak optimal inverse IvLP problems is obtained.Finally,the problem is simplified without adjusting the cost coefficient of null variable.

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.

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.