相关期刊:《Journal of Beijing Institute of Technology》《中国多媒体与网络教学学报(电子版)》《Applied Mathematics and Mechanics(English Edition)》《World Journal of Nephrology》更多>>
supported by the National Natural Science Foundation of China(Grant No.11971092);supported by the Fundamental Research Funds for the Central Universities(Grant No.DUT20RC(3)079)。
Optimization problem of cardinality constrained mean-variance(CCMV)model for sparse portfolio selection is considered.To overcome the difficulties caused by cardinality constraint,an exact penalty approach is employed...
supported by the National Natural Science Foundation of China(Grant No.NSFC-11971118).
Classical quasi-Newton methods are widely used to solve nonlinear problems in which the first-order information is exact.In some practical problems,we can only obtain approximate values of the objective function and i...
supported by CAS-President International Fellowship Initiative(PIFI)from the Academy of Mathematics and Systems Science,Chinese Academy of Sciences,Beijing,China.
In the present paper,we study the restricted inexact Newton-type method for solving the generalized equation 0∈f(x)+F(x),where X and Y are Banach spaces,f:X→Y is a Frechet differentiable function and F:X■Y is a set...
JL was supported by China Postdoctoral Science Foundation grant No.2017M620589;JFC was supported in part by Hong Kong Research Grant Council(HKRGC)grants 16300616 and 16306317;HK Zhao was supported in part by NSF grants DMS-1418422 and DMS-1622490.
We investigate the problem of robust matrix completion with a fraction of observation corrupted by sparsity outlier noise.We propose an algorithmic framework based on the ADMM algorithm for a non-convex optimization,w...
The preconditioner for parameterized inexact Uzawa methods have been used to solve some indefinite saddle point problems. Firstly, we modify the preconditioner by making it more generalized, then we use theoretical an...
The modified Hermitian and skew-Hermitian splitting (MHSS) iteration method and preconditioned MHSS (PMHSS) iteration method were introduced respectively. In the paper, on the basis of the MHSS iteration method, w...
When the coordinates of a set of points are known, the pairwise Euclidean distances among the points can be easily computed. Conversely, if the Euclidean distance matrix is given, a set of coordinates for those points...
The authors are grateful to Prof. Zhaojun Bai in University of Cali- fornia, Davis, and Prof. Carlos J. Garcia-Cervera in University of California, Santa Barbara for their helpful discussions. The authors are grateful to the editor and the referees for their valuable comments, which improves the quality of the paper greatly. Weiguo Gao is supported by the National Natural Science Foundation of China under grants 91330202, Special Funds for Major State Basic Research Projects of China (2015CB858560003), and Shanghai Science and Technology Development Funds 13dz2260200 and 13511504300. Qun Gu acknowledges the financial support from China Scholarship Council (No. 2011610055).
We discuss the inexact two-grid methods for solving eigenvalue problems, including both partial differential and integral equations. Instead of solving the linear system exactly in both traditional two-grid and accele...
We present a Hermitian and skew-Herrnitian splitting (HSS) iteration method for solving large sparse continuous Sylvester equations with non-Hermitian and positive definite/semi- definite matrices. The unconditional...
To solve nonlinear complementarity problems (NCP), at each iteration, the classical proximal point algorithm solves a well-conditioned sub-NCP while the Logarithmic-Quadratic Proximal (LQP) method solves a system ...