Based on the covariant density functional theory,by employing the core–quasiparticle coupling(CQC)model,the nuclear level density of odd-A nuclei at the saddle point is achieved.The total level density is calculated ...Based on the covariant density functional theory,by employing the core–quasiparticle coupling(CQC)model,the nuclear level density of odd-A nuclei at the saddle point is achieved.The total level density is calculated via the convolution of the intrinsic level density and the collective level density.The intrinsic level densities are obtained in the finite-temperature covariant density functional theory,which takes into account the nuclear deformation and pairing self-consistently.For saddle points on the free energy surface in the(β_(2),γ)plane,the entropy and the associated intrinsic level density are compared with those of the global minima.By introducing a quasiparticle to the two neighboring even–even core nuclei,whose properties are determined by the five-dimensional collective Hamiltonian model,the collective levels of the odd-A nuclei are obtained via the CQC model.The total level densities of the^(234-240)U agree well with the available experimental data and Hilaire’s result.Furthermore,the ratio of the total level densities at the saddle points to those at the global minima and the ratio of the total level densities to the intrinsic level densities are discussed separately.展开更多
The purpose of this paper is to define the concept of mixed saddle point for a vector-valued Lagrangian of the non-smooth multiobjective vector-valued constrained optimization problem and establish the equivalence of ...The purpose of this paper is to define the concept of mixed saddle point for a vector-valued Lagrangian of the non-smooth multiobjective vector-valued constrained optimization problem and establish the equivalence of the mixed saddle point and an efficient solution under generalized (V, p)-invexity assumptions.展开更多
In this article, we focus to study about modified objective function approach for multiobjective optimization problem with vanishing constraints. An equivalent η-approximated multiobjective optimization problem is co...In this article, we focus to study about modified objective function approach for multiobjective optimization problem with vanishing constraints. An equivalent η-approximated multiobjective optimization problem is constructed by a modification of the objective function in the original considered optimization problem. Furthermore, we discuss saddle point criteria for the aforesaid problem. Moreover, we present some examples to verify the established results.展开更多
The present paper aims to develop the Kuhn-Tucker and Fritz John criteria for saddle point optimality of interval-valued nonlinear programming problem.To achieve the study objective,we have proposed the definition of ...The present paper aims to develop the Kuhn-Tucker and Fritz John criteria for saddle point optimality of interval-valued nonlinear programming problem.To achieve the study objective,we have proposed the definition of minimizer and maximizer of an interval-valued non-linear programming problem.Also,we have introduced the interval-valued Fritz-John and Kuhn Tucker saddle point problems.After that,we have established both the necessary and sufficient optimality conditions of an interval-valued non-linear minimization problem.Next,we have shown that both the saddle point conditions(Fritz-John and Kuhn-Tucker)are sufficient without any convexity requirements.Then with the convexity requirements,we have established that these saddle point optimality criteria are the necessary conditions for optimality of an interval-valued non-linear programming with real-valued constraints.Here,all the results are derived with the help of interval order relations.Finally,we illustrate all the results with the help of a numerical example.展开更多
In this paper, optimality conditions for multiobjective programming problems having V-invex objective and constraint functions are considered. An equivalent multiobjective programming problem is constructed by a modif...In this paper, optimality conditions for multiobjective programming problems having V-invex objective and constraint functions are considered. An equivalent multiobjective programming problem is constructed by a modification of the objective function.Furthermore, a (α, η)-Lagrange function is introduced for a constructed multiobjective programming problem, and a new type of saddle point is introduced. Some results for the new type of saddle point are given.展开更多
In this paper, a new augmented Lagrangian penalty function for constrained optimization problems is studied. The dual properties of the augmented Lagrangian objective penalty function for constrained optimization prob...In this paper, a new augmented Lagrangian penalty function for constrained optimization problems is studied. The dual properties of the augmented Lagrangian objective penalty function for constrained optimization problems are proved. Under some conditions, the saddle point of the augmented Lagrangian objective penalty function satisfies the first-order Karush-Kuhn-Tucker (KKT) condition. Especially, when the KKT condition holds for convex programming its saddle point exists. Based on the augmented Lagrangian objective penalty function, an algorithm is developed for finding a global solution to an inequality constrained optimization problem and its global convergence is also proved under some conditions.展开更多
基金supported by the China Institute of Atomic Energy(No.401Y-FW-GKXJ-21-1496)the Natural Science Foundation of Henan Province(No.202300410480 and 202300410479)+1 种基金the Open Project of Guangxi Key Laboratory of Nuclear Physics and Nuclear Technology(No.NLK2021-01)the National Natural Science Foundation of China(No.U2032141).
文摘Based on the covariant density functional theory,by employing the core–quasiparticle coupling(CQC)model,the nuclear level density of odd-A nuclei at the saddle point is achieved.The total level density is calculated via the convolution of the intrinsic level density and the collective level density.The intrinsic level densities are obtained in the finite-temperature covariant density functional theory,which takes into account the nuclear deformation and pairing self-consistently.For saddle points on the free energy surface in the(β_(2),γ)plane,the entropy and the associated intrinsic level density are compared with those of the global minima.By introducing a quasiparticle to the two neighboring even–even core nuclei,whose properties are determined by the five-dimensional collective Hamiltonian model,the collective levels of the odd-A nuclei are obtained via the CQC model.The total level densities of the^(234-240)U agree well with the available experimental data and Hilaire’s result.Furthermore,the ratio of the total level densities at the saddle points to those at the global minima and the ratio of the total level densities to the intrinsic level densities are discussed separately.
文摘The purpose of this paper is to define the concept of mixed saddle point for a vector-valued Lagrangian of the non-smooth multiobjective vector-valued constrained optimization problem and establish the equivalence of the mixed saddle point and an efficient solution under generalized (V, p)-invexity assumptions.
基金financially supported by the CSIR,New Delhi,India through Grant no.:25(0266)/17/EMR-II
文摘In this article, we focus to study about modified objective function approach for multiobjective optimization problem with vanishing constraints. An equivalent η-approximated multiobjective optimization problem is constructed by a modification of the objective function in the original considered optimization problem. Furthermore, we discuss saddle point criteria for the aforesaid problem. Moreover, we present some examples to verify the established results.
基金Taif University Researchers Supporting Project number(TURSP-2020/20),Taif University,Taif,Saudi Arabia。
文摘The present paper aims to develop the Kuhn-Tucker and Fritz John criteria for saddle point optimality of interval-valued nonlinear programming problem.To achieve the study objective,we have proposed the definition of minimizer and maximizer of an interval-valued non-linear programming problem.Also,we have introduced the interval-valued Fritz-John and Kuhn Tucker saddle point problems.After that,we have established both the necessary and sufficient optimality conditions of an interval-valued non-linear minimization problem.Next,we have shown that both the saddle point conditions(Fritz-John and Kuhn-Tucker)are sufficient without any convexity requirements.Then with the convexity requirements,we have established that these saddle point optimality criteria are the necessary conditions for optimality of an interval-valued non-linear programming with real-valued constraints.Here,all the results are derived with the help of interval order relations.Finally,we illustrate all the results with the help of a numerical example.
基金Supported by the National Natural Science Foundation of China(19871009)
文摘In this paper, optimality conditions for multiobjective programming problems having V-invex objective and constraint functions are considered. An equivalent multiobjective programming problem is constructed by a modification of the objective function.Furthermore, a (α, η)-Lagrange function is introduced for a constructed multiobjective programming problem, and a new type of saddle point is introduced. Some results for the new type of saddle point are given.
文摘In this paper, a new augmented Lagrangian penalty function for constrained optimization problems is studied. The dual properties of the augmented Lagrangian objective penalty function for constrained optimization problems are proved. Under some conditions, the saddle point of the augmented Lagrangian objective penalty function satisfies the first-order Karush-Kuhn-Tucker (KKT) condition. Especially, when the KKT condition holds for convex programming its saddle point exists. Based on the augmented Lagrangian objective penalty function, an algorithm is developed for finding a global solution to an inequality constrained optimization problem and its global convergence is also proved under some conditions.
