During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive...During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive distance)to a moving target as quickly as possible,resulting in the extended minimum-time intercept problem(EMTIP).Existing research has primarily focused on the zero-distance intercept problem,MTIP,establishing the necessary or sufficient conditions for MTIP optimality,and utilizing analytic algorithms,such as root-finding algorithms,to calculate the optimal solutions.However,these approaches depend heavily on the properties of the analytic algorithm,making them inapplicable when problem settings change,such as in the case of a positive effective range or complicated target motions outside uniform rectilinear motion.In this study,an approach employing a high-accuracy and quality-guaranteed mixed-integer piecewise-linear program(QG-PWL)is proposed for the EMTIP.This program can accommodate different effective interception ranges and complicated target motions(variable velocity or complicated trajectories).The high accuracy and quality guarantees of QG-PWL originate from elegant strategies such as piecewise linearization and other developed operation strategies.The approximate error in the intercept path length is proved to be bounded to h^(2)/(4√2),where h is the piecewise length.展开更多
In this paper, the function characteristics of instruction are introduced, and the focus is on contact compare instruction and the characteristics of the transfer instructions. With the traffic lights control as an ex...In this paper, the function characteristics of instruction are introduced, and the focus is on contact compare instruction and the characteristics of the transfer instructions. With the traffic lights control as an example, this paper proposes the application of contact compare instruction and transfer instruction to program design method, making the program structure compact and statement concise. The control requirements are easily completed. Key words： Function Instruction; Programming; Traffic Lights; Contact Compare Instruction; Transfer展开更多
In this paper, an improved radial basis function networks named hidden neuron modifiable radial basis function (HNMRBF) networks is proposed for target classification, and evolutionary programming (EP) is used as a le...In this paper, an improved radial basis function networks named hidden neuron modifiable radial basis function (HNMRBF) networks is proposed for target classification, and evolutionary programming (EP) is used as a learning algorithm to determine and modify the hidden neuron of HNMRBF nets. The result of passive sonar target classification shows that HNMRBF nets can effectively solve the problem of traditional neural networks, i. e. learning new target patterns on line will cause forgetting of the old patterns.展开更多
The penalty function method, presented many years ago, is an important nu- merical method for the mathematical programming problems. In this article, we propose a dual-relax penalty function approach, which is signifi...The penalty function method, presented many years ago, is an important nu- merical method for the mathematical programming problems. In this article, we propose a dual-relax penalty function approach, which is significantly different from penalty func- tion approach existing for solving the bilevel programming, to solve the nonlinear bilevel programming with linear lower level problem. Our algorithm will redound to the error analysis for computing an approximate solution to the bilevel programming. The error estimate is obtained among the optimal objective function value of the dual-relax penalty problem and of the original bilevel programming problem. An example is illustrated to show the feasibility of the proposed approach.展开更多
The motor relearning program can significantly improve various functional disturbance induced by ischemic cerebrovascular diseases. However, its mechanism of action remains poorly understood. In injured brain tissues,...The motor relearning program can significantly improve various functional disturbance induced by ischemic cerebrovascular diseases. However, its mechanism of action remains poorly understood. In injured brain tissues, glial fibrillary acidic protein and neurofilament protein changes can reflect the condition of injured neurons and astrocytes, while vascular endothelial growth factor and basic fibroblast growth factor changes can indicate angiogenesis. In the present study, we induced ischemic brain injury in the rhesus macaque by electrocoagulation of the M1 segment of the right middle cerebral artery. The motor relearning program was conducted for 60 days from the third day after model establishment. Immunohistochemistry and single-photon emission CT showed that the numbers of glial fibrillary acidic protein-, neurofilament protein-, vascular endothelial growth factor- and basic fibroblast growth factor-positive cells were significantly increased in the infarcted side compared with the contralateral hemisphere following the motor relearning program. Moreover, cerebral blood flow in the infarcted side was significantly improved. The clinical rating scale for stroke was used to assess neurological function changes in the rhesus macaque following the motor relearning program. Results showed that motor function was improved, and problems with consciousness, self-care ability and balance function were significantly ameliorated. These findings indicate that the motor relearning program significantly promoted neuronal regeneration, repair and angiogenesis in the surroundings of the infarcted hemisphere, and improve neurological function in the rhesus macaque following brain ischemia.展开更多
The algorithm proposed by T. F. Colemen and A. R. Conn is improved in this paper, and the improved algorithm can solve nonlinear programming problem with quality constraints. It is shown that the improved algorithm po...The algorithm proposed by T. F. Colemen and A. R. Conn is improved in this paper, and the improved algorithm can solve nonlinear programming problem with quality constraints. It is shown that the improved algorithm possesses global convergence, and under some conditions, it possesses locally supperlinear convergence.展开更多
In this paper, the general exact penalty functions in integer programming were studied. The conditions which ensure the exact penalty property for the general penalty function with one penalty parameter were given and...In this paper, the general exact penalty functions in integer programming were studied. The conditions which ensure the exact penalty property for the general penalty function with one penalty parameter were given and a general penalty function with two parameters was proposed.展开更多
A quasi-filled function for nonlinear integer programming problem is given in this paper. This function contains two parameters which are easily to be chosen. Theoretical properties of the proposed quasi-filled functi...A quasi-filled function for nonlinear integer programming problem is given in this paper. This function contains two parameters which are easily to be chosen. Theoretical properties of the proposed quasi-filled function are investigated. Moreover, we also propose a new solution algorithm using this quasi-filled function to solve nonlinear integer programming problem in this paper. The examples with 2 to 6 variables are tested and computational results indicated the efficiency and reliability of the pro- posed quasi-filled function algorithm.展开更多
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.展开更多
In this paper, a new algorithm-approximate penalty function method is designed, which can be used to solve a bilevel optimization problem with linear constrained function. In this kind of bilevel optimization problem....In this paper, a new algorithm-approximate penalty function method is designed, which can be used to solve a bilevel optimization problem with linear constrained function. In this kind of bilevel optimization problem. the evaluation of the objective function is very difficult, so that only their approximate values can be obtained. This algorithm is obtained by combining penalty function method and approximation in bilevel programming. The presented algorithm is completely different from existing methods. That convergence for this algorithm is proved.展开更多
A definition of the quasi-filled function for nonlinear integer programming problem is given in this paper. A quasi-filled function satisfying our definition is presented. This function contains only one parameter. Th...A definition of the quasi-filled function for nonlinear integer programming problem is given in this paper. A quasi-filled function satisfying our definition is presented. This function contains only one parameter. The properties of the pro- posed quasi-filled function and the method using this quasi-filled function to solve nonlinear integer programming problem are also discussed in this paper. Numerical results indicated the efficiency and reliability of the proposed quasi-filled function algo- rithm.展开更多
For a multiobjective bilevel programnfing problem （P） with an extremal-value function, its dual problem is constructed by using the Fenchel-Moreau conjugate of the functions involved. Under some convexity and monoto...For a multiobjective bilevel programnfing problem （P） with an extremal-value function, its dual problem is constructed by using the Fenchel-Moreau conjugate of the functions involved. Under some convexity and monotonicity assumptions, the weak and strong duality assertions are obtained.展开更多
In this paper,the differentiability of interval valued function is discussed by using the idea of total differential of real valued function,the concept of D-differentiability of interval valued function is establishe...In this paper,the differentiability of interval valued function is discussed by using the idea of total differential of real valued function,the concept of D-differentiability of interval valued function is established and some basic properties are given.By discussing the optimality condition of unconstrained interval programming,the necessary conditions for obtaining the optimal solution of a class of constrained interval valued programming with real valued function constraints are given.Meanwhile,the sufficient conditions for obtaining the optimal solution are given for the convex interval value programming problem with real value function constraints.展开更多
This paper gives a new definition of the filled function for nonlinear integer programming problem. A filled function satisfying our definition is presented. This function contains only one parameter. The properties o...This paper gives a new definition of the filled function for nonlinear integer programming problem. A filled function satisfying our definition is presented. This function contains only one parameter. The properties of the proposed filled function and the method using this filled function to solve nonlinear integer programming problem are also discussed. Numerical results indicate the efficiency and reliability of the proposed filled function algorithm.展开更多
The traditional linear programming model is deterministic. The way that uncertainty is handled is to compute the range of optimality. After the optimal solution is obtained, typically by the simplex method, one consid...The traditional linear programming model is deterministic. The way that uncertainty is handled is to compute the range of optimality. After the optimal solution is obtained, typically by the simplex method, one considers the effect of varying each objective function coefficient, one at a time. This yields the range of optimality within which the decision variables remain constant. This sensitivity analysis is useful for helping the analyst get a sense for the problem. However, it is unrealistic because objective function coefficients tend not to stand still. They are typically profit contributions from products sold and are subject to randomly varying selling prices. In this paper, a realistic linear program is created for simultaneously randomizing the coefficients from any probability distribution. Furthermore, we present a novel approach for designing a copula of random objective function coefficients according to a specified rank correlation. The corresponding distribution of objective function values is created. This distribution is examined directly for central tendency, spread, skewness and extreme values for the purpose of risk analysis. This enables risk analysis and business analytics, emerging topics in education and preparation for the knowledge economy.展开更多
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.展开更多
To evaluate the heat performance of the lifting-body entry vehicle during the hypersonic gliding phase,entry flight heat tests involving the determination of the maximum peak-heat-flux entry trajectory with complex co...To evaluate the heat performance of the lifting-body entry vehicle during the hypersonic gliding phase,entry flight heat tests involving the determination of the maximum peak-heat-flux entry trajectory with complex constraints are essential.A significant obstacle is the uncertainty of passage time or energy states of the maximum peak entry heat flux point and waypoints.This paper showcases an endeavour to leverage disjunctive programming and combinatorial theory for the max-max type(maximum peak-heat-flux)Entry Trajectory Optimization(ETO)problems with complex constraints such as dynamic pressure,normal load,waypoints,and no-fly zones.The concept of a"generalized waypoint"is introduced,and the maximum peak-heat-flux point is regarded as a"generalized waypoint".Through the application of propositional calculus rules,the derivation of generalized waypoints incorporating various physical quantities and magnitudes such as heat flux density,longitude,and latitude is actualized in one disjunctive normal form,enabling resolution via a unified method.Consequently,a novel method based on combinatorial prior rules is proposed,utilizing Successive Mixed-Integer Nonlinear Programming(SMINLP)to optimize various heat entry test flight trajectories.Numerical experiments are provided to show the computational accuracy,stability,and adaptability of the proposed method in solving maxmax type entry optimal control problems.展开更多
An exact augmented Lagrangian function for the nonlinear nonconvex programming problems with inequality constraints was discussed. Under suitable hypotheses, the relationship was established between the local unconstr...An exact augmented Lagrangian function for the nonlinear nonconvex programming problems with inequality constraints was discussed. Under suitable hypotheses, the relationship was established between the local unconstrained minimizers of the augmented Lagrangian function on the space of problem variables and the local minimizers of the original constrained problem. Furthermore, under some assumptions, the relationship was also established between the global solutions of the augmented Lagrangian function on some compact subset of the space of problem variables and the global solutions of the constrained problem. Therefore, f^om the theoretical point of view, a solution of the inequality constrained problem and the corresponding values of the Lagrange multipliers can be found by the well-known method of multipliers which resort to the unconstrained minimization of the augmented Lagrangian function presented.展开更多
基金supported by the National Natural Sci‐ence Foundation of China(Grant No.62306325)。
文摘During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive distance)to a moving target as quickly as possible,resulting in the extended minimum-time intercept problem(EMTIP).Existing research has primarily focused on the zero-distance intercept problem,MTIP,establishing the necessary or sufficient conditions for MTIP optimality,and utilizing analytic algorithms,such as root-finding algorithms,to calculate the optimal solutions.However,these approaches depend heavily on the properties of the analytic algorithm,making them inapplicable when problem settings change,such as in the case of a positive effective range or complicated target motions outside uniform rectilinear motion.In this study,an approach employing a high-accuracy and quality-guaranteed mixed-integer piecewise-linear program(QG-PWL)is proposed for the EMTIP.This program can accommodate different effective interception ranges and complicated target motions(variable velocity or complicated trajectories).The high accuracy and quality guarantees of QG-PWL originate from elegant strategies such as piecewise linearization and other developed operation strategies.The approximate error in the intercept path length is proved to be bounded to h^(2)/(4√2),where h is the piecewise length.
文摘In this paper, the function characteristics of instruction are introduced, and the focus is on contact compare instruction and the characteristics of the transfer instructions. With the traffic lights control as an example, this paper proposes the application of contact compare instruction and transfer instruction to program design method, making the program structure compact and statement concise. The control requirements are easily completed. Key words： Function Instruction; Programming; Traffic Lights; Contact Compare Instruction; Transfer
文摘In this paper, an improved radial basis function networks named hidden neuron modifiable radial basis function (HNMRBF) networks is proposed for target classification, and evolutionary programming (EP) is used as a learning algorithm to determine and modify the hidden neuron of HNMRBF nets. The result of passive sonar target classification shows that HNMRBF nets can effectively solve the problem of traditional neural networks, i. e. learning new target patterns on line will cause forgetting of the old patterns.
基金supported by the National Science Foundation of China (70771080)Social Science Foundation of Ministry of Education (10YJC630233)
文摘The penalty function method, presented many years ago, is an important nu- merical method for the mathematical programming problems. In this article, we propose a dual-relax penalty function approach, which is significantly different from penalty func- tion approach existing for solving the bilevel programming, to solve the nonlinear bilevel programming with linear lower level problem. Our algorithm will redound to the error analysis for computing an approximate solution to the bilevel programming. The error estimate is obtained among the optimal objective function value of the dual-relax penalty problem and of the original bilevel programming problem. An example is illustrated to show the feasibility of the proposed approach.
基金supported by the Combined pecific Foundation of Department of Science and Technology of Yunnan Province and Kunming Medical University,No.2008CD037
文摘The motor relearning program can significantly improve various functional disturbance induced by ischemic cerebrovascular diseases. However, its mechanism of action remains poorly understood. In injured brain tissues, glial fibrillary acidic protein and neurofilament protein changes can reflect the condition of injured neurons and astrocytes, while vascular endothelial growth factor and basic fibroblast growth factor changes can indicate angiogenesis. In the present study, we induced ischemic brain injury in the rhesus macaque by electrocoagulation of the M1 segment of the right middle cerebral artery. The motor relearning program was conducted for 60 days from the third day after model establishment. Immunohistochemistry and single-photon emission CT showed that the numbers of glial fibrillary acidic protein-, neurofilament protein-, vascular endothelial growth factor- and basic fibroblast growth factor-positive cells were significantly increased in the infarcted side compared with the contralateral hemisphere following the motor relearning program. Moreover, cerebral blood flow in the infarcted side was significantly improved. The clinical rating scale for stroke was used to assess neurological function changes in the rhesus macaque following the motor relearning program. Results showed that motor function was improved, and problems with consciousness, self-care ability and balance function were significantly ameliorated. These findings indicate that the motor relearning program significantly promoted neuronal regeneration, repair and angiogenesis in the surroundings of the infarcted hemisphere, and improve neurological function in the rhesus macaque following brain ischemia.
基金the National+4 种基金 Natural Science Foundation of China
文摘The algorithm proposed by T. F. Colemen and A. R. Conn is improved in this paper, and the improved algorithm can solve nonlinear programming problem with quality constraints. It is shown that the improved algorithm possesses global convergence, and under some conditions, it possesses locally supperlinear convergence.
文摘In this paper, the general exact penalty functions in integer programming were studied. The conditions which ensure the exact penalty property for the general penalty function with one penalty parameter were given and a general penalty function with two parameters was proposed.
基金Project (Nos. 10571137 and 10271073) supported by the NationalNatural Science Foundation of China
文摘A quasi-filled function for nonlinear integer programming problem is given in this paper. This function contains two parameters which are easily to be chosen. Theoretical properties of the proposed quasi-filled function are investigated. Moreover, we also propose a new solution algorithm using this quasi-filled function to solve nonlinear integer programming problem in this paper. The examples with 2 to 6 variables are tested and computational results indicated the efficiency and reliability of the pro- posed quasi-filled function algorithm.
基金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.
文摘In this paper, a new algorithm-approximate penalty function method is designed, which can be used to solve a bilevel optimization problem with linear constrained function. In this kind of bilevel optimization problem. the evaluation of the objective function is very difficult, so that only their approximate values can be obtained. This algorithm is obtained by combining penalty function method and approximation in bilevel programming. The presented algorithm is completely different from existing methods. That convergence for this algorithm is proved.
基金Project (No. 10271073) supported by the National Natural Science Foundation of China
文摘A definition of the quasi-filled function for nonlinear integer programming problem is given in this paper. A quasi-filled function satisfying our definition is presented. This function contains only one parameter. The properties of the pro- posed quasi-filled function and the method using this quasi-filled function to solve nonlinear integer programming problem are also discussed in this paper. Numerical results indicated the efficiency and reliability of the proposed quasi-filled function algo- rithm.
基金Supported by the National Natural Science Foundation of China(Grant No.11171250)
文摘For a multiobjective bilevel programnfing problem （P） with an extremal-value function, its dual problem is constructed by using the Fenchel-Moreau conjugate of the functions involved. Under some convexity and monotonicity assumptions, the weak and strong duality assertions are obtained.
基金Supported by the National Natural Science Fund of China(Grant No.11461052)the Natural Science Foundation of Inner Mongolia(Grant No.2018MS01010)。
文摘In this paper,the differentiability of interval valued function is discussed by using the idea of total differential of real valued function,the concept of D-differentiability of interval valued function is established and some basic properties are given.By discussing the optimality condition of unconstrained interval programming,the necessary conditions for obtaining the optimal solution of a class of constrained interval valued programming with real valued function constraints are given.Meanwhile,the sufficient conditions for obtaining the optimal solution are given for the convex interval value programming problem with real value function constraints.
文摘This paper gives a new definition of the filled function for nonlinear integer programming problem. A filled function satisfying our definition is presented. This function contains only one parameter. The properties of the proposed filled function and the method using this filled function to solve nonlinear integer programming problem are also discussed. Numerical results indicate the efficiency and reliability of the proposed filled function algorithm.
文摘The traditional linear programming model is deterministic. The way that uncertainty is handled is to compute the range of optimality. After the optimal solution is obtained, typically by the simplex method, one considers the effect of varying each objective function coefficient, one at a time. This yields the range of optimality within which the decision variables remain constant. This sensitivity analysis is useful for helping the analyst get a sense for the problem. However, it is unrealistic because objective function coefficients tend not to stand still. They are typically profit contributions from products sold and are subject to randomly varying selling prices. In this paper, a realistic linear program is created for simultaneously randomizing the coefficients from any probability distribution. Furthermore, we present a novel approach for designing a copula of random objective function coefficients according to a specified rank correlation. The corresponding distribution of objective function values is created. This distribution is examined directly for central tendency, spread, skewness and extreme values for the purpose of risk analysis. This enables risk analysis and business analytics, emerging topics in education and preparation for the knowledge economy.
基金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.
基金funded by the Key Laboratory of Cross-Domain Flight Interdisciplinary Technology,China(No.2024-KF02201)the National Natural Science Foundation of China(No.61973326)。
文摘To evaluate the heat performance of the lifting-body entry vehicle during the hypersonic gliding phase,entry flight heat tests involving the determination of the maximum peak-heat-flux entry trajectory with complex constraints are essential.A significant obstacle is the uncertainty of passage time or energy states of the maximum peak entry heat flux point and waypoints.This paper showcases an endeavour to leverage disjunctive programming and combinatorial theory for the max-max type(maximum peak-heat-flux)Entry Trajectory Optimization(ETO)problems with complex constraints such as dynamic pressure,normal load,waypoints,and no-fly zones.The concept of a"generalized waypoint"is introduced,and the maximum peak-heat-flux point is regarded as a"generalized waypoint".Through the application of propositional calculus rules,the derivation of generalized waypoints incorporating various physical quantities and magnitudes such as heat flux density,longitude,and latitude is actualized in one disjunctive normal form,enabling resolution via a unified method.Consequently,a novel method based on combinatorial prior rules is proposed,utilizing Successive Mixed-Integer Nonlinear Programming(SMINLP)to optimize various heat entry test flight trajectories.Numerical experiments are provided to show the computational accuracy,stability,and adaptability of the proposed method in solving maxmax type entry optimal control problems.
文摘An exact augmented Lagrangian function for the nonlinear nonconvex programming problems with inequality constraints was discussed. Under suitable hypotheses, the relationship was established between the local unconstrained minimizers of the augmented Lagrangian function on the space of problem variables and the local minimizers of the original constrained problem. Furthermore, under some assumptions, the relationship was also established between the global solutions of the augmented Lagrangian function on some compact subset of the space of problem variables and the global solutions of the constrained problem. Therefore, f^om the theoretical point of view, a solution of the inequality constrained problem and the corresponding values of the Lagrange multipliers can be found by the well-known method of multipliers which resort to the unconstrained minimization of the augmented Lagrangian function presented.
