Houduo Qi - Citegraph

Author Info

Name	Affiliation	Papers
HOUDUO QI	Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong/ E-mail: <rfc822>mahdqi@polyu.edu.hk</rfc822>	38
Collaborators	Citations	PageRank
32	437	32.91
Referers	Referees	References
595	435	452

Search Limit

100595

Publications (38 rows)

Collaborators (32 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Global And Quadratic Convergence Of Newton Hard-Thresholding Pursuit	0	0.34	2021
Robust Euclidean embedding via EDM optimization	1	0.36	2020
Classical Multidimensional Scaling: A Subspace Perspective, Over-Denoising, and Outlier Detection.	0	0.34	2019
A Fast Matrix Majorization-Projection Method for Penalized Stress Minimization With Box Constraints.	1	0.36	2018
Iterative reweighted methods for \(\ell _1-\ell _p\) minimization.	1	0.36	2018
Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation.	5	0.43	2017
A Convex Matrix Optimization for the Additive Constant Problem in Multidimensional Scaling with Application to Locally Linear Embedding.	1	0.36	2016
Tackling the flip ambiguity in wireless sensor network localization and beyond.	4	0.39	2016
A Computable Characterization of the Extrinsic Mean of Reflection Shapes and Its Asymptotic Properties.	0	0.34	2015
Convex Optimization Learning of Faithful Euclidean Distance Representations in Nonlinear Dimensionality Reduction.	3	0.42	2014
Computing the nearest Euclidean distance matrix with low embedding dimensions	3	0.39	2014
A Semismooth Newton Method for the Nearest Euclidean Distance Matrix Problem.	10	0.53	2013
A Lagrangian Dual Approach to the Single-Source Localization Problem	5	0.45	2013
A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem	16	0.67	2011
Block relaxation and majorization methods for the nearest correlation matrix with factor structure	1	0.35	2011
Correlation stress testing for value-at-risk: an unconstrained convex optimization approach	10	0.78	2010
Newton's Method for Computing the Nearest Correlation Matrix with a Simple Upper Bound.	1	0.36	2010
Local Duality of Nonlinear Semidefinite Programming	7	0.50	2009
Data Integration for Recommendation Systems	0	0.34	2008
New Sufficient Conditions for Global Robust Stability of Delayed Neural Networks	29	1.30	2007
Regularity and well-posedness of a dual program for convex best C1-spline interpolation	2	0.42	2007
Armijo Newton Method for Convex Best Interpolation1	0	0.34	2006
A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix	73	3.63	2006
Cartesian P-property and Its Applications to the Semidefinite Linear Complementarity Problem	17	0.74	2006
Neurodynamical Optimization	9	0.68	2004
Deriving sufficient conditions for global asymptotic stability of delayed neural networks via nonsmooth analysis.	39	3.96	2004
Smooth Convex Approximation to the Maximum Eigenvalue Function	13	0.90	2004
Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems	34	2.00	2003
Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient Methods	10	0.58	2003
Semismoothness of Spectral Functions	4	0.57	2003
Finite termination of a dual Newton method for convex best C 1 interpolation and smoothing	1	0.38	2003
A feasible semismooth asymptotically Newton method for mixed complementarity problems	19	0.89	2002
A Newton Method for Shape-Preserving Spline Interpolation	6	0.64	2002
Convergence of Newton's method for convex best interpolation	13	1.48	2001
Stability Analysis of Gradient-Based Neural Networks for Optimization Problems	19	1.46	2001
A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions	24	1.09	2000
A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization	19	1.30	2000
A QP-free constrained Newton-type method for variational inequality problems	37	2.48	1999