When signal-to-interference ratio is low, the energy of strong interference leaked from the side lobe of beam pattern will infect the detection of weak target. Therefore, the beam pattern needs to be op...When signal-to-interference ratio is low, the energy of strong interference leaked from the side lobe of beam pattern will infect the detection of weak target. Therefore, the beam pattern needs to be optimized. The existing Dolph-Chebyshev weighting method can get the lowest side lobe level under given main lobe width, but for the other non-uniform circular array and nonlinear array, the low side lobe pattern needs to be designed specially. The second order cone programming optimization （SOCP） algorithm proposed in the paper transforms the optimization of the beam pattern into a standard convex optimization problem. Thus there is a paradigm to follow for any array formation, which not only achieves the purpose of Dolph-Chebyshev weighting, but also solves the problem of the increased side lobe when the signal is at end fire direction The simulation proves that the SOCP algorithm can detect the weak target better than the conventional beam forming.展开更多
In order to improve the design results for the reconfigurable frequency response masking FRM filters an improved design method based on second-order cone programming SOCP is proposed.Unlike traditional methods that se...In order to improve the design results for the reconfigurable frequency response masking FRM filters an improved design method based on second-order cone programming SOCP is proposed.Unlike traditional methods that separately design the proposed method takes all the desired designing modes into consideration when designing all the subfilters. First an initial solution is obtained by separately designing the subfilters and then the initial solution is updated by iteratively solving a SOCP problem. The proposed method is evaluated on a design example and simulation results demonstrate that jointly designing all the subfilters can obtain significantly lower minimax approximation errors compared to the conventional design method.展开更多
The definitions of cone-subconvexlike set-valued maps and generalized cone-subconvexlike set-valued maps in topological vector spaces are defined by using the relative interiors of ordering cone. The relationships bet...The definitions of cone-subconvexlike set-valued maps and generalized cone-subconvexlike set-valued maps in topological vector spaces are defined by using the relative interiors of ordering cone. The relationships between the two classes of set-valued maps are investigated, and some properties of them are shown. A Gordan type alternative theorem under the assumption of generalized cone-subconvexlikeness of set-valued maps is proved by applying convex separation theorems involving the relative interiors in infinite dimensional spaces. Finally a necessary optimality condition theorem is shown for a general kind of set-valued vector optimization in a sense of weak E-minimizer.展开更多
This paper investigates the optimal control problem of spacecraft reorientation subject to attitude forbidden constraints,angular velocity saturation and actuator saturation simultaneously.A second-order cone programm...This paper investigates the optimal control problem of spacecraft reorientation subject to attitude forbidden constraints,angular velocity saturation and actuator saturation simultaneously.A second-order cone programming(SOCP)technology is developed to solve the strong nonlinear and non-convex control problem in real time.Specifically,the nonlinear attitude kinematic and dynamic are transformed and relaxed to a standard affine system,and linearization and L1 penalty technique are adopted to convexify non-convex inequality constraints.With the proposed quadratic performance index of angular velocity,the optimal control solution is obtained with high accuracy using the successive SOCP algorithm.Finally,the effectiveness of the algorithm is validated by numerical simulation.展开更多
Five kinds of cones are introduced, which are used to establish the constraints qualifications, under which the generalized Kuhn-Tucker necessary conditions are developed for a class of generalized (h,φ)-differentiab...Five kinds of cones are introduced, which are used to establish the constraints qualifications, under which the generalized Kuhn-Tucker necessary conditions are developed for a class of generalized (h,φ)-differentiable single-objective and multiobjective programming problems by using Motzkin's alternative theorem and Ben-Tal generalized algebraic operations.展开更多
This paper is concerned with the topological structure of efficient sets for optimizationproblem of set-valued mapping. It is proved that these sets are closed or. connected under someconditions on cone-continuity, co...This paper is concerned with the topological structure of efficient sets for optimizationproblem of set-valued mapping. It is proved that these sets are closed or. connected under someconditions on cone-continuity, cone-convexity and cone-quasiconvexity.展开更多
There recently has been much interest in studying some optimization problems over symmetric cones. This paper deals with linear programming over symmetric cones （SCLP）. The objective here is to extend the Qi-Sun-Zho...There recently has been much interest in studying some optimization problems over symmetric cones. This paper deals with linear programming over symmetric cones （SCLP）. The objective here is to extend the Qi-Sun-Zhou＇s smoothing Newton algorithm to solve SCLP, where characterization of symmetric cones using Jordan algebras forms the fundamental basis for our analysis. By using the theory of Euclidean Jordan algebras, the authors show that the algorithm is globally and locally quadratically convergent under suitable assumptions. The preliminary numerical results for solving the second-order cone programming are also reported.展开更多
This paper derives first order necessary and sufficient conditions for unconstrained coned.c. Programming problems where the underlined space is partially ordered with respect to acone. These conditions are given in t...This paper derives first order necessary and sufficient conditions for unconstrained coned.c. Programming problems where the underlined space is partially ordered with respect to acone. These conditions are given in terms of directional derivatives and subdifferentials of thecomponent functions. Moreover, conjugate duality for cone d.c. Optimization is discussed andweak duality theorem is proved in a more general partially ordered linear topological vectorspace (generalizing the results in [11]).展开更多
This paper deals with Henig globally efficiency in vector optimization involving generalized cone-preinvex set-valued mapping. Some properties of generalized cone-preinvex set-valued map are derived. It also disclose ...This paper deals with Henig globally efficiency in vector optimization involving generalized cone-preinvex set-valued mapping. Some properties of generalized cone-preinvex set-valued map are derived. It also disclose the closed relationships between Henig globally efficiency of generalized conepreinvex set-valued optimization problem and Henig globally efficiency of a kind of vector variational inequality.展开更多
The present paper describes an optimization work to obtain the properties related to a pyrolysis process in the solid material such as density, specific heat, conductivity of virgin and char, heat of pyrolysis and kin...The present paper describes an optimization work to obtain the properties related to a pyrolysis process in the solid material such as density, specific heat, conductivity of virgin and char, heat of pyrolysis and kinetic parameters used for deciding pyrolysis rate. A repulsive particle swarm optimization algorithm is used to obtain the pyrolysis-related properties. In the previous study all properties obtained only using a cone calorimeter but in this paper both the cone calorimeter and thermo gravimetric analysis (TGA) are used for precisely optimizing the pyrolysis properties. In the TGA test a very small mass is heated up and conduction and heat capacity in the specimen is negligible so kinetic parameters can first be optimized. Other pyrolysis-related properties such as virgin/char specific heat and conductivity and char density are also optimized in the cone calorimeter test with the already decided parameters in the TGA test.展开更多
基金Special Item of National Major Scientific Apparatus Development(No.2013YQ140431)
文摘When signal-to-interference ratio is low, the energy of strong interference leaked from the side lobe of beam pattern will infect the detection of weak target. Therefore, the beam pattern needs to be optimized. The existing Dolph-Chebyshev weighting method can get the lowest side lobe level under given main lobe width, but for the other non-uniform circular array and nonlinear array, the low side lobe pattern needs to be designed specially. The second order cone programming optimization （SOCP） algorithm proposed in the paper transforms the optimization of the beam pattern into a standard convex optimization problem. Thus there is a paradigm to follow for any array formation, which not only achieves the purpose of Dolph-Chebyshev weighting, but also solves the problem of the increased side lobe when the signal is at end fire direction The simulation proves that the SOCP algorithm can detect the weak target better than the conventional beam forming.
基金The National Natural Science Foundation of China(No.61231002,61273266,61375028)the Ph.D.Programs Foundation of Ministry of Education of China(No.20110092130004)
文摘In order to improve the design results for the reconfigurable frequency response masking FRM filters an improved design method based on second-order cone programming SOCP is proposed.Unlike traditional methods that separately design the proposed method takes all the desired designing modes into consideration when designing all the subfilters. First an initial solution is obtained by separately designing the subfilters and then the initial solution is updated by iteratively solving a SOCP problem. The proposed method is evaluated on a design example and simulation results demonstrate that jointly designing all the subfilters can obtain significantly lower minimax approximation errors compared to the conventional design method.
文摘The definitions of cone-subconvexlike set-valued maps and generalized cone-subconvexlike set-valued maps in topological vector spaces are defined by using the relative interiors of ordering cone. The relationships between the two classes of set-valued maps are investigated, and some properties of them are shown. A Gordan type alternative theorem under the assumption of generalized cone-subconvexlikeness of set-valued maps is proved by applying convex separation theorems involving the relative interiors in infinite dimensional spaces. Finally a necessary optimality condition theorem is shown for a general kind of set-valued vector optimization in a sense of weak E-minimizer.
基金This work was supported by the National Natural Science Foundation of China(Nos.61960206011,61633003)the Beijing Natural Science Foundation(No.JQ19017)。
文摘This paper investigates the optimal control problem of spacecraft reorientation subject to attitude forbidden constraints,angular velocity saturation and actuator saturation simultaneously.A second-order cone programming(SOCP)technology is developed to solve the strong nonlinear and non-convex control problem in real time.Specifically,the nonlinear attitude kinematic and dynamic are transformed and relaxed to a standard affine system,and linearization and L1 penalty technique are adopted to convexify non-convex inequality constraints.With the proposed quadratic performance index of angular velocity,the optimal control solution is obtained with high accuracy using the successive SOCP algorithm.Finally,the effectiveness of the algorithm is validated by numerical simulation.
基金This research is supported by the National Natural Science Foundation of China Grant 10261006, the Foundation of Education Section of Excellent Doctorial Theses Grant 200217 and the Basic Theory Foundation of Nanchang University.
文摘Five kinds of cones are introduced, which are used to establish the constraints qualifications, under which the generalized Kuhn-Tucker necessary conditions are developed for a class of generalized (h,φ)-differentiable single-objective and multiobjective programming problems by using Motzkin's alternative theorem and Ben-Tal generalized algebraic operations.
文摘This paper is concerned with the topological structure of efficient sets for optimizationproblem of set-valued mapping. It is proved that these sets are closed or. connected under someconditions on cone-continuity, cone-convexity and cone-quasiconvexity.
基金This research is supported by the National Natural Science Foundation of China under Grant No. 10871144 and the Natural Science Foundation of Tianjin under Grant No. 07JCYBJC05200.
文摘There recently has been much interest in studying some optimization problems over symmetric cones. This paper deals with linear programming over symmetric cones （SCLP）. The objective here is to extend the Qi-Sun-Zhou＇s smoothing Newton algorithm to solve SCLP, where characterization of symmetric cones using Jordan algebras forms the fundamental basis for our analysis. By using the theory of Euclidean Jordan algebras, the authors show that the algorithm is globally and locally quadratically convergent under suitable assumptions. The preliminary numerical results for solving the second-order cone programming are also reported.
文摘This paper derives first order necessary and sufficient conditions for unconstrained coned.c. Programming problems where the underlined space is partially ordered with respect to acone. These conditions are given in terms of directional derivatives and subdifferentials of thecomponent functions. Moreover, conjugate duality for cone d.c. Optimization is discussed andweak duality theorem is proved in a more general partially ordered linear topological vectorspace (generalizing the results in [11]).
基金supported by the Natural Science Foundation of China under Grant No.11361001Ministry of Education Science and technology key projects under Grant No.212204+1 种基金the Natural Science Foundation of Ningxia under Grant No.NZ12207the Science and Technology key project of Ningxia institutions of higher learning under Grant No.NGY2012092
文摘This paper deals with Henig globally efficiency in vector optimization involving generalized cone-preinvex set-valued mapping. Some properties of generalized cone-preinvex set-valued map are derived. It also disclose the closed relationships between Henig globally efficiency of generalized conepreinvex set-valued optimization problem and Henig globally efficiency of a kind of vector variational inequality.
文摘The present paper describes an optimization work to obtain the properties related to a pyrolysis process in the solid material such as density, specific heat, conductivity of virgin and char, heat of pyrolysis and kinetic parameters used for deciding pyrolysis rate. A repulsive particle swarm optimization algorithm is used to obtain the pyrolysis-related properties. In the previous study all properties obtained only using a cone calorimeter but in this paper both the cone calorimeter and thermo gravimetric analysis (TGA) are used for precisely optimizing the pyrolysis properties. In the TGA test a very small mass is heated up and conduction and heat capacity in the specimen is negligible so kinetic parameters can first be optimized. Other pyrolysis-related properties such as virgin/char specific heat and conductivity and char density are also optimized in the cone calorimeter test with the already decided parameters in the TGA test.
