This paper deals with extensions of higher-order optimality conditions for scalar optimization to multiobjective optimization.A type of directional derivatives for a multiobjective function is proposed,and with this n...This paper deals with extensions of higher-order optimality conditions for scalar optimization to multiobjective optimization.A type of directional derivatives for a multiobjective function is proposed,and with this notion characterizations of strict local minima of order k for a multiobjective optimization problem with a nonempty set constraint are established,generalizing the corresponding scalar case obtained by Studniarski[3].Also necessary not sufficient and sufficient not necessary optimality conditions for this minima are derived based on our directional derivatives,which are generalizations of some existing scalar results and equivalent to some existing multiobjective ones.Many examples are given to illustrate them there.展开更多
Sparse optimization has witnessed advancements in recent decades,and the step function finds extensive applications across various machine learning and signal processing domains.This paper integrates zero norm and the...Sparse optimization has witnessed advancements in recent decades,and the step function finds extensive applications across various machine learning and signal processing domains.This paper integrates zero norm and the step function to formulate a doublesparsity constrained optimization problem,wherein a linear equality constraint is also taken into consideration.By defining aτ-Lagrangian stationary point and a KKT point,we establish the first-order and second-order necessary and sufficient optimality conditions for the problem.Furthermore,we thoroughly elucidate their relationships to local and global optimal solutions.Finally,special cases and examples are presented to illustrate the obtained theorems.展开更多
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 mult...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.展开更多
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.
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 algebr...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 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 Joh...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.展开更多
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 present...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.展开更多
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 ...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.展开更多
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...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.展开更多
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 co...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.展开更多
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...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 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 unif...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.展开更多
This paper deals with higher-order optimality conditions for Henig effcient solutions of set-valued optimization problems.By virtue of the higher-order tangent sets, necessary and suffcient conditions are obtained for...This paper deals with higher-order optimality conditions for Henig effcient solutions of set-valued optimization problems.By virtue of the higher-order tangent sets, necessary and suffcient conditions are obtained for Henig effcient solutions of set-valued optimization problems whose constraint condition is determined by a fixed set.展开更多
In this paper, by using the notion of convexificator, we introduce the generalized standard Abadie constraint qualification and the generalized MPVC Abadie constraint qualification, and define the generalized stationa...In this paper, by using the notion of convexificator, we introduce the generalized standard Abadie constraint qualification and the generalized MPVC Abadie constraint qualification, and define the generalized stationary conditions for the nonsmooth mathematical program with vanishing constraints (MPVC for short). We show that the generalized strong stationary is the first order necessary optimality condition for nonsmooth MPVC under the generalized standard Abadie constraint qualification. Sufficient conditions for global or local optimality for nonsmooth MPVC are also derived under some generalized convexity assumptions.展开更多
In this paper,through the use of image space analysis,optimality conditions for a class of variational inequalities with cone constraints are proposed.By virtue of the nonlinear scalarization function,known as the Ger...In this paper,through the use of image space analysis,optimality conditions for a class of variational inequalities with cone constraints are proposed.By virtue of the nonlinear scalarization function,known as the Gerstewitz function,three nonlinear weak separation functions,two nonlinear regular weak separation functions and a nonlinear strong separation function are introduced.According to nonlinearseparation functions,some optimality conditions of the weak and strong alternative for variational inequalities with cone constraints are derived.展开更多
Bifunctional oxide-zeolite-based composites(OXZEO)have emerged as promising materials for the direct conversion of syngas to olefins.However,experimental screening and optimization of reaction parameters remain resour...Bifunctional oxide-zeolite-based composites(OXZEO)have emerged as promising materials for the direct conversion of syngas to olefins.However,experimental screening and optimization of reaction parameters remain resource-intensive.To address this challenge,we implemented a three-stage framework integrating machine learning,Bayesian optimization,and experimental validation,utilizing a carefully curated dataset from the literature.Our ensemble-tree model(R^(2)>0.87)identified Zn-Zr and Cu-Mg binary mixed oxides as the most effective OXZEO systems,with their light olefin space-time yields confirmed by physically mixing with HSAPO-34 through experimental validation.Density functional theory calculations further elucidated the activity trends between Zn-Zr and Cu-Mg mixed oxides.Among 16 catalyst and reaction condition descriptors,the oxide/zeolite ratio,reaction temperature,and pressure emerged as the most significant factors.This interpretable,data-driven framework offers a versatile approach that can be applied to other catalytic processes,providing a powerful tool for experiment design and optimization in catalysis.展开更多
The Conditional Nonlinear Optimal Perturbation(CNOP)method works essentially for conventional numerical models;however,it is not fully applicable to the commonly used deep-learning forecasting models(DLMs),which typic...The Conditional Nonlinear Optimal Perturbation(CNOP)method works essentially for conventional numerical models;however,it is not fully applicable to the commonly used deep-learning forecasting models(DLMs),which typically input multiple time slices without deterministic dependencies.In this study,the CNOP for DLMs(CNOP-DL)is proposed as an extension of the CNOP in the time dimension.This method is useful for targeted observations as it indicates not only where but also when to deploy additional observations.The CNOP-DL is calculated for a forecast case of sea surface temperature in the South China Sea with a DLM.The CNOP-DL identifies a sensitive area northwest of Palawan Island at the last input time.Sensitivity experiments demonstrate that the sensitive area identified by the CNOP-DL is effective not only for the CNOP-DL itself,but also for random perturbations.Therefore,this approach holds potential for guiding practical field campaigns.Notably,forecast errors are more sensitive to time than to location in the sensitive area.It highlights the crucial role of identifying the time of the sensitive area in targeted observations,corroborating the usefulness of extending the CNOP in the time dimension.展开更多
In this paper,we comprehensively study optimality conditions for rank-constrained matrix optimization(RCMO).By calculating the Clarke tangent and normal cones to a rank-constrained set,along with the given Fréche...In this paper,we comprehensively study optimality conditions for rank-constrained matrix optimization(RCMO).By calculating the Clarke tangent and normal cones to a rank-constrained set,along with the given Fréchet,Mordukhovich normal cones,we investigate four kinds of stationary points of the RCMO and analyze the relations between each stationary point and local/global minimizer of the RCMO.Furthermore,the second-order optimality condition of the RCMO is achieved with the help of the Clarke tangent cone.展开更多
The sparse nonlinear programming （SNP） is to minimize a general continuously differentiable func- tion subject to sparsity, nonlinear equality and inequality constraints. We first define two restricted constraint qu...The sparse nonlinear programming （SNP） is to minimize a general continuously differentiable func- tion subject to sparsity, nonlinear equality and inequality constraints. We first define two restricted constraint qualifications and show how these constraint qualifications can be applied to obtain the decomposition properties of the Frechet, Mordukhovich and Clarke normal cones to the sparsity constrained feasible set. Based on the decomposition properties of the normal cones, we then present and analyze three classes of Karush-Kuhn- Tucker （KKT） conditions for the SNP. At last, we establish the second-order necessary optimality condition and sufficient optimality condition for the SNP.展开更多
This paper obtains sufficient optimality conditions for a nonlinear nondifferentiable multiobjective semi-infinite programming problem involving generalized(C,α,ρ,d)-convex functions.The authors formulate Mond-Weir-...This paper obtains sufficient optimality conditions for a nonlinear nondifferentiable multiobjective semi-infinite programming problem involving generalized(C,α,ρ,d)-convex functions.The authors formulate Mond-Weir-type dual model for the nonlinear nondifferentiable multiobjective semiinfinite programming problem and establish weak,strong and strict converse duality theorems relating the primal and the dual problems.展开更多
文摘This paper deals with extensions of higher-order optimality conditions for scalar optimization to multiobjective optimization.A type of directional derivatives for a multiobjective function is proposed,and with this notion characterizations of strict local minima of order k for a multiobjective optimization problem with a nonempty set constraint are established,generalizing the corresponding scalar case obtained by Studniarski[3].Also necessary not sufficient and sufficient not necessary optimality conditions for this minima are derived based on our directional derivatives,which are generalizations of some existing scalar results and equivalent to some existing multiobjective ones.Many examples are given to illustrate them there.
基金Supported by the National Key R&D Program of China(No.2023YFA1011100)NSFC(No.12131004)。
文摘Sparse optimization has witnessed advancements in recent decades,and the step function finds extensive applications across various machine learning and signal processing domains.This paper integrates zero norm and the step function to formulate a doublesparsity constrained optimization problem,wherein a linear equality constraint is also taken into consideration.By defining aτ-Lagrangian stationary point and a KKT point,we establish the first-order and second-order necessary and sufficient optimality conditions for the problem.Furthermore,we thoroughly elucidate their relationships to local and global optimal solutions.Finally,special cases and examples are presented to illustrate the obtained theorems.
文摘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.
基金This work was supported by National Natural Science Foundation of China (10401041)Natural Science Foundation of Hubei Province (2004ABA009)
文摘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.
基金Supported by the NSF of Shaanxi Provincial Educational Department(06JK152)
文摘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 National Natural Science Foundation(69972036) and the Natural Science Foundation of Shanxi province(995L02)
文摘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.
文摘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.
基金Supported by Chongqing Key Lab. of Operations Research and System Engineering
文摘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.
文摘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.
文摘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.
基金Supported by the National Natural Science Foundation of China(11361001)Natural Science Foundation of Ningxia(NZ14101)
文摘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.
基金Supported by the Science Foundation of Shaanxi Provincial Educational Department Natural Science Foundation of China（06JK152） Supported by the Graduate Innovation Project of Yanan uni- versity（YCX201003）
文摘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.
基金Supported by the National Natural Science Foundation of China（10871216） Supported by the Science and Technology Research Project of Chongqing Municipal Education Commission（KJ100419） Supported by the Natural Science Foundation Project of CQ CSTC（cstcjjA00019）
文摘This paper deals with higher-order optimality conditions for Henig effcient solutions of set-valued optimization problems.By virtue of the higher-order tangent sets, necessary and suffcient conditions are obtained for Henig effcient solutions of set-valued optimization problems whose constraint condition is determined by a fixed set.
文摘In this paper, by using the notion of convexificator, we introduce the generalized standard Abadie constraint qualification and the generalized MPVC Abadie constraint qualification, and define the generalized stationary conditions for the nonsmooth mathematical program with vanishing constraints (MPVC for short). We show that the generalized strong stationary is the first order necessary optimality condition for nonsmooth MPVC under the generalized standard Abadie constraint qualification. Sufficient conditions for global or local optimality for nonsmooth MPVC are also derived under some generalized convexity assumptions.
文摘In this paper,through the use of image space analysis,optimality conditions for a class of variational inequalities with cone constraints are proposed.By virtue of the nonlinear scalarization function,known as the Gerstewitz function,three nonlinear weak separation functions,two nonlinear regular weak separation functions and a nonlinear strong separation function are introduced.According to nonlinearseparation functions,some optimality conditions of the weak and strong alternative for variational inequalities with cone constraints are derived.
基金funded by the KRICT Project (KK2512-10) of the Korea Research Institute of Chemical Technology and the Ministry of Trade, Industry and Energy (MOTIE)the Korea Institute for Advancement of Technology (KIAT) through the Virtual Engineering Platform Program (P0022334)+1 种基金supported by the Carbon Neutral Industrial Strategic Technology Development Program (RS-202300261088) funded by the Ministry of Trade, Industry & Energy (MOTIE, Korea)Further support was provided by research fund of Chungnam National University。
文摘Bifunctional oxide-zeolite-based composites(OXZEO)have emerged as promising materials for the direct conversion of syngas to olefins.However,experimental screening and optimization of reaction parameters remain resource-intensive.To address this challenge,we implemented a three-stage framework integrating machine learning,Bayesian optimization,and experimental validation,utilizing a carefully curated dataset from the literature.Our ensemble-tree model(R^(2)>0.87)identified Zn-Zr and Cu-Mg binary mixed oxides as the most effective OXZEO systems,with their light olefin space-time yields confirmed by physically mixing with HSAPO-34 through experimental validation.Density functional theory calculations further elucidated the activity trends between Zn-Zr and Cu-Mg mixed oxides.Among 16 catalyst and reaction condition descriptors,the oxide/zeolite ratio,reaction temperature,and pressure emerged as the most significant factors.This interpretable,data-driven framework offers a versatile approach that can be applied to other catalytic processes,providing a powerful tool for experiment design and optimization in catalysis.
基金supported by the National Natural Science Foundation of China (Grant No. 42288101, 42375062, 42476192, 42275158)the National Key Scientific and Technological Infrastructure project “Earth System Science Numerical Simulator Facility” (Earth Lab)the GHfund C (202407036001)
文摘The Conditional Nonlinear Optimal Perturbation(CNOP)method works essentially for conventional numerical models;however,it is not fully applicable to the commonly used deep-learning forecasting models(DLMs),which typically input multiple time slices without deterministic dependencies.In this study,the CNOP for DLMs(CNOP-DL)is proposed as an extension of the CNOP in the time dimension.This method is useful for targeted observations as it indicates not only where but also when to deploy additional observations.The CNOP-DL is calculated for a forecast case of sea surface temperature in the South China Sea with a DLM.The CNOP-DL identifies a sensitive area northwest of Palawan Island at the last input time.Sensitivity experiments demonstrate that the sensitive area identified by the CNOP-DL is effective not only for the CNOP-DL itself,but also for random perturbations.Therefore,this approach holds potential for guiding practical field campaigns.Notably,forecast errors are more sensitive to time than to location in the sensitive area.It highlights the crucial role of identifying the time of the sensitive area in targeted observations,corroborating the usefulness of extending the CNOP in the time dimension.
基金This research was supported by the National Natural Science Foundation of China(Nos.11431002 and 11371116).
文摘In this paper,we comprehensively study optimality conditions for rank-constrained matrix optimization(RCMO).By calculating the Clarke tangent and normal cones to a rank-constrained set,along with the given Fréchet,Mordukhovich normal cones,we investigate four kinds of stationary points of the RCMO and analyze the relations between each stationary point and local/global minimizer of the RCMO.Furthermore,the second-order optimality condition of the RCMO is achieved with the help of the Clarke tangent cone.
基金supported by National Natural Science Foundation of China(Grant No.11431002)Shandong Province Natural Science Foundation(Grant No.ZR2016AM07)
文摘The sparse nonlinear programming （SNP） is to minimize a general continuously differentiable func- tion subject to sparsity, nonlinear equality and inequality constraints. We first define two restricted constraint qualifications and show how these constraint qualifications can be applied to obtain the decomposition properties of the Frechet, Mordukhovich and Clarke normal cones to the sparsity constrained feasible set. Based on the decomposition properties of the normal cones, we then present and analyze three classes of Karush-Kuhn- Tucker （KKT） conditions for the SNP. At last, we establish the second-order necessary optimality condition and sufficient optimality condition for the SNP.
文摘This paper obtains sufficient optimality conditions for a nonlinear nondifferentiable multiobjective semi-infinite programming problem involving generalized(C,α,ρ,d)-convex functions.The authors formulate Mond-Weir-type dual model for the nonlinear nondifferentiable multiobjective semiinfinite programming problem and establish weak,strong and strict converse duality theorems relating the primal and the dual problems.
