By using an existence theorems of maximal elements for a family of set-valued mappings in G-convex spaces due to the author, some new nonempty intersection theorems for a family of set-valued mappings were established...By using an existence theorems of maximal elements for a family of set-valued mappings in G-convex spaces due to the author, some new nonempty intersection theorems for a family of set-valued mappings were established in noncompact product G-convex spaces. As applications, some equilibrium existence theorems for a system of generalized vector equilibrium problems were proved in noncompact product G-convex spaces. These theorems unify, improve and generalize some important known results in literature.展开更多
Using K-T optimality condition of nonsmooth optimization, we establish two equivalent systems of the nonsmooth equations for the constrained minimax problem directly. Then generalized Newton methods are applied to so...Using K-T optimality condition of nonsmooth optimization, we establish two equivalent systems of the nonsmooth equations for the constrained minimax problem directly. Then generalized Newton methods are applied to solve these systems of the nonsmooth equations. Thus a new approach to solving the constrained minimax problem is developed.展开更多
For the polarimetric synthetic aperture radar interferometry (PoIInSAR) processing, it is necessary to coregister all the images, including the coregistration of polarimetric SAR images and the coregistration of inter...For the polarimetric synthetic aperture radar interferometry (PoIInSAR) processing, it is necessary to coregister all the images, including the coregistration of polarimetric SAR images and the coregistration of interferometric SAR images. Otherwise, the performance of the estimated optimal interferograms will be deteriorated. A generalized scattering vector (GSV) model is proposed to execute the PoIInSAR optimal interferograms estimation. The generalized scattering vector is constructed by the Pauli scattering vectors of the processing pixel and the surrounding pixels. Even though there are coregistration errors, all the polarimetric information of the current processing pixel is entirely included in the generalized scattering vector. Therefore, the GSV-based method can automatically recover the optimal scattering mechanisms of the processing pixel with coregistration errors either in interferoemetric channels or polarimetric channels. Theoretical analysis and processing results of simulated PoISARPro data and real PALSAR data validate the effectiveness and correctness of the proposed method.展开更多
By using the characteristic properties of the anti-Hermitian generalized anti-Hamiltonian matrices, we prove some necessary and sufficient conditions of the solvability for algebra inverse eigenvalue problem of anti-H...By using the characteristic properties of the anti-Hermitian generalized anti-Hamiltonian matrices, we prove some necessary and sufficient conditions of the solvability for algebra inverse eigenvalue problem of anti-Hermitian generalized anti-Hamiltonian matrices, and obtain a general expression of the solution to this problem. By using the properties of the orthogonal projection matrix, we also obtain the expression of the solution to optimal approximate problem of an n× n complex matrix under spectral restriction.展开更多
Support vector machine has become an increasingly popular tool for machine learning tasks involving classification, regression or novelty detection. Training a support vector machine requires the solution of a very la...Support vector machine has become an increasingly popular tool for machine learning tasks involving classification, regression or novelty detection. Training a support vector machine requires the solution of a very large quadratic programming problem. Traditional optimization methods cannot be directly applied due to memory restrictions. Up to now, several approaches exist for circumventing the above shortcomings and work well. Another learning algorithm, particle swarm optimization, for training SVM is introduted. The method is tested on UCI datasets.展开更多
文摘By using an existence theorems of maximal elements for a family of set-valued mappings in G-convex spaces due to the author, some new nonempty intersection theorems for a family of set-valued mappings were established in noncompact product G-convex spaces. As applications, some equilibrium existence theorems for a system of generalized vector equilibrium problems were proved in noncompact product G-convex spaces. These theorems unify, improve and generalize some important known results in literature.
文摘Using K-T optimality condition of nonsmooth optimization, we establish two equivalent systems of the nonsmooth equations for the constrained minimax problem directly. Then generalized Newton methods are applied to solve these systems of the nonsmooth equations. Thus a new approach to solving the constrained minimax problem is developed.
基金supported by the National Natural Science Foundation of China(6147127661671355)the Areospace T.T.&.C.Innovation Program
文摘For the polarimetric synthetic aperture radar interferometry (PoIInSAR) processing, it is necessary to coregister all the images, including the coregistration of polarimetric SAR images and the coregistration of interferometric SAR images. Otherwise, the performance of the estimated optimal interferograms will be deteriorated. A generalized scattering vector (GSV) model is proposed to execute the PoIInSAR optimal interferograms estimation. The generalized scattering vector is constructed by the Pauli scattering vectors of the processing pixel and the surrounding pixels. Even though there are coregistration errors, all the polarimetric information of the current processing pixel is entirely included in the generalized scattering vector. Therefore, the GSV-based method can automatically recover the optimal scattering mechanisms of the processing pixel with coregistration errors either in interferoemetric channels or polarimetric channels. Theoretical analysis and processing results of simulated PoISARPro data and real PALSAR data validate the effectiveness and correctness of the proposed method.
基金Project(10171031) supported by the National Natural Science Foundation of China
文摘By using the characteristic properties of the anti-Hermitian generalized anti-Hamiltonian matrices, we prove some necessary and sufficient conditions of the solvability for algebra inverse eigenvalue problem of anti-Hermitian generalized anti-Hamiltonian matrices, and obtain a general expression of the solution to this problem. By using the properties of the orthogonal projection matrix, we also obtain the expression of the solution to optimal approximate problem of an n× n complex matrix under spectral restriction.
文摘Support vector machine has become an increasingly popular tool for machine learning tasks involving classification, regression or novelty detection. Training a support vector machine requires the solution of a very large quadratic programming problem. Traditional optimization methods cannot be directly applied due to memory restrictions. Up to now, several approaches exist for circumventing the above shortcomings and work well. Another learning algorithm, particle swarm optimization, for training SVM is introduted. The method is tested on UCI datasets.
