Hongwei Liu - Citegraph

Author Info

Name	Affiliation	Papers
HONGWEI LIU	Applied Mathematics, Xidian University, Xi'an, China	30
Collaborators	Citations	PageRank
21	78	12.29
Referers	Referees	References
134	328	350

Search Limit

100328

Publications (30 rows)

Collaborators (21 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Smoothing projected Barzilai–Borwein method for constrained non-Lipschitz optimization	1	0.35	2016
An efficient monotone projected Barzilai-Borwein method for nonnegative matrix factorization.	4	0.43	2015
A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization.	1	0.36	2015
A Barzilai–Borwein type method for stochastic linear complementarity problems	7	0.44	2014
Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions.	2	0.46	2014
New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming	3	0.40	2013
Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization	3	0.46	2013
Solving non-negative matrix factorization by alternating least squares with a modified strategy	3	0.38	2013
A New Wide Neighborhood Primal-Dual Infeasible-Interior-Point Method for Symmetric Cone Programming.	15	0.68	2013
Polynomial Convergence of Second-Order Mehrotra-Type Predictor-Corrector Algorithms over Symmetric Cones.	10	0.60	2012
Rank-two update algorithms for the minimum volume enclosing ellipsoid problem	0	0.34	2012
Non-monotone projection gradient method for non-negative matrix factorization	1	0.36	2012
Trust-region method for box-constrained semismooth equations and its applications to complementary problems	2	0.38	2012
A variant spectral-type FR conjugate gradient method and its global convergence	4	0.46	2011
A nonmonotone derivative-free algorithm for nonlinear complementarity problems based on the new generalized penalized Fischer---Burmeister merit function	0	0.34	2011
Feasible smooth method based on Barzilai–Borwein method for stochastic linear complementarity problem	1	0.37	2011
Partial projected Newton method for a class of stochastic linear complementarity problems	2	0.38	2011
Sufficient Descent Conjugate Gradient Methods For Large-Scale Optimization Problems	0	0.34	2011
New reformulation and feasible semismooth Newton method for a class of stochastic linear complementarity problems	2	0.40	2011
Solving equations via the trust region and its application to a class of stochastic linear complementarity problems	2	0.40	2011
A smoothing inexact Newton method for variational inequality problems	0	0.34	2011
Corrigendum to “Solving equations via the trust region and its application to a class of stochastic linear complementarity problems” [Comput. Math. Appl. 61 (2011) 1646–1664]	0	0.34	2011
Rank-two residue iteration method for nonnegative matrix factorization	1	0.36	2011
Nonnegative matrix factorization with bounded total variational regularization for face recognition	6	0.58	2010
Solving variational inequalities by a modified projection method with an effective step-size	0	0.34	2010
A regularized smoothing-type algorithm for solving a system of inequalities with a P0-function	5	0.57	2010
A predictor–corrector smoothing Newton method for symmetric cone complementarity problems	1	0.36	2010
Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem	1	0.36	2010
The Application of Successive Quadratic Programming Algorithm to Multiuser Detection in CDMA	0	0.34	2006
A Tight Semidefinite Relaxation of the MAX CUT Problem	1	0.39	2003