default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHouduo Qi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j51]Deliang Yang
, Hou-Duo Qi:
Supervised maximum variance unfolding. Mach. Learn. 113(9): 6197-6226 (2024)- 2023
- [j50]Shaoyan Guo, Hou-Duo Qi, Liwei Zhang:
Perturbation analysis of the euclidean distance matrix optimization problem and its numerical implications. Comput. Optim. Appl. 86(3): 1193-1227 (2023) - [j49]Hou-Duo Qi:
Geometric Characterization of Maximum Diversification Return Portfolio via Rao's Quadratic Entropy. SIAM J. Financial Math. 14(2): 525-556 (2023) - 2022
- [j48]Chen Zhao, Naihua Xiu, Houduo Qi, Ziyan Luo:
A Lagrange-Newton algorithm for sparse nonlinear programming. Math. Program. 195(1): 903-928 (2022) - [j47]Jian Shen, Jein-Shan Chen, Hou-Duo Qi, Naihua Xiu:
A penalized method of alternating projections for weighted low-rank hankel matrix optimization. Math. Program. Comput. 14(3): 417-450 (2022) - 2021
- [j46]Hongxin Zhao, Lingchen Kong, Hou-Duo Qi:
Optimal portfolio selections via ℓ 1, 2-norm regularization. Comput. Optim. Appl. 80(3): 853-881 (2021) - [j45]Shenglong Zhou, Naihua Xiu, Hou-Duo Qi:
Global and Quadratic Convergence of Newton Hard-Thresholding Pursuit. J. Mach. Learn. Res. 22: 12:1-12:45 (2021) - [j44]Hou-Duo Qi:
On the long-only minimum variance portfolio under single factor model. Oper. Res. Lett. 49(5): 795-801 (2021) - [j43]Shenglong Zhou, Lili Pan, Naihua Xiu, Hou-Duo Qi:
Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization. SIAM J. Optim. 31(4): 3184-3211 (2021) - 2020
- [j42]Yue Lu, Ching-Yu Yang, Jein-Shan Chen, Hou-Duo Qi:
The decompositions with respect to two core non-symmetric cones. J. Glob. Optim. 76(1): 155-188 (2020) - [j41]Shenglong Zhou, Naihua Xiu, Hou-Duo Qi:
Robust Euclidean embedding via EDM optimization. Math. Program. Comput. 12(3): 337-387 (2020) - 2019
- [j40]Houduo Qi, Yiju Wang, Naihua Xiu:
Preface. Asia Pac. J. Oper. Res. 36(2): 1902001:1-1902001:2 (2019) - [j39]Lingchen Kong, Chuanqi Qi, Hou-Duo Qi:
Classical Multidimensional Scaling: A Subspace Perspective, Over-Denoising, and Outlier Detection. IEEE Trans. Signal Process. 67(14): 3842-3857 (2019) - 2018
- [j38]Xianchao Xiu, Lingchen Kong, Yan Li, Houduo Qi:
Iterative reweighted methods for \(\ell _1-\ell _p\) minimization. Comput. Optim. Appl. 70(1): 201-219 (2018) - [j37]Shenglong Zhou, Naihua Xiu, Hou-Duo Qi:
A Fast Matrix Majorization-Projection Method for Penalized Stress Minimization With Box Constraints. IEEE Trans. Signal Process. 66(16): 4331-4346 (2018) - 2017
- [j36]Chao Ding, Hou-Duo Qi:
Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation. Comput. Optim. Appl. 66(1): 187-218 (2017) - [j35]Chao Ding, Hou-Duo Qi:
Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction. Math. Program. 164(1-2): 341-381 (2017) - 2016
- [j34]Shuanghua Bai, Houduo Qi:
Tackling the flip ambiguity in wireless sensor network localization and beyond. Digit. Signal Process. 55: 85-97 (2016) - [j33]Hou-Duo Qi:
A Convex Matrix Optimization for the Additive Constant Problem in Multidimensional Scaling with Application to Locally Linear Embedding. SIAM J. Optim. 26(4): 2564-2590 (2016) - 2015
- [j32]Chao Ding, Hou-Duo Qi:
A Computable Characterization of the Extrinsic Mean of Reflection Shapes and Its Asymptotic Properties. Asia Pac. J. Oper. Res. 32(1): 1540005:1-1540005:16 (2015) - [j31]Shuanghua Bai, Hou-Duo Qi, Naihua Xiu:
Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach. SIAM J. Optim. 25(1): 439-467 (2015) - 2014
- [j30]Houduo Qi, Xiaoming Yuan:
Computing the nearest Euclidean distance matrix with low embedding dimensions. Math. Program. 147(1-2): 351-389 (2014) - 2013
- [j29]Houduo Qi:
A Semismooth Newton Method for the Nearest Euclidean Distance Matrix Problem. SIAM J. Matrix Anal. Appl. 34(1): 67-93 (2013) - [j28]Houduo Qi, Naihua Xiu, Xiaoming Yuan:
A Lagrangian Dual Approach to the Single-Source Localization Problem. IEEE Trans. Signal Process. 61(15): 3815-3826 (2013) - 2011
- [j27]Qingna Li, Houduo Qi, Naihua Xiu:
Block relaxation and majorization methods for the nearest correlation matrix with factor structure. Comput. Optim. Appl. 50(2): 327-349 (2011) - [j26]Qingna Li, Houduo Qi:
A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem. SIAM J. Optim. 21(4): 1641-1666 (2011) - 2010
- [j25]Houduo Qi, Defeng Sun:
Correlation stress testing for value-at-risk: an unconstrained convex optimization approach. Comput. Optim. Appl. 45(2): 427-462 (2010) - [j24]Qingna Li, Donghui Li, Houduo Qi:
Newton's Method for Computing the Nearest Correlation Matrix with a Simple Upper Bound. J. Optim. Theory Appl. 147(3): 546-568 (2010) - 2009
- [j23]Houduo Qi:
Local Duality of Nonlinear Semidefinite Programming. Math. Oper. Res. 34(1): 124-141 (2009) - 2007
- [j22]Houduo Qi, Xiaoqi Yang:
Regularity and well-posedness of a dual program for convex best C1-spline interpolation. Comput. Optim. Appl. 37(3): 409-425 (2007) - [j21]Houduo Qi:
New Sufficient Conditions for Global Robust Stability of Delayed Neural Networks. IEEE Trans. Circuits Syst. I Regul. Pap. 54-I(5): 1131-1141 (2007) - 2006
- [j20]Xin Chen, Houduo Qi:
Cartesian P-property and Its Applications to the Semidefinite Linear Complementarity Problem. Math. Program. 106(1): 177-201 (2006) - [j19]Hou-Duo Qi, Xiaoqi Yang:
Armijo Newton method for convex best interpolation. Optim. Methods Softw. 21(2): 179-200 (2006) - [j18]Houduo Qi, Defeng Sun:
A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix. SIAM J. Matrix Anal. Appl. 28(2): 360-385 (2006) - 2005
- [j17]Houduo Qi, Liqun Qi, Xiaoqi Yang:
Deriving sufficient conditions for global asymptotic stability of delayed neural networks via nonsmooth analysis-II. IEEE Trans. Neural Networks 16(6): 1701-1706 (2005) - 2004
- [j16]Li-Zhi Liao, Houduo Qi, Liqun Qi:
Neurodynamical Optimization. J. Glob. Optim. 28(2): 175-195 (2004) - [j15]Xin Chen, Houduo Qi, Liqun Qi, Kok Lay Teo:
Smooth Convex Approximation to the Maximum Eigenvalue Function. J. Glob. Optim. 30(2-3): 253-270 (2004) - [j14]Houduo Qi, Liqun Qi:
Deriving sufficient conditions for global asymptotic stability of delayed neural networks via nonsmooth analysis. IEEE Trans. Neural Networks 15(1): 99-109 (2004) - 2003
- [j13]Houduo Qi, Liqun Qi:
Finite termination of a dual Newton method for convex best C 1 interpolation and smoothing. Numerische Mathematik 96(2): 317-337 (2003) - [j12]Xin Chen, Houduo Qi, Paul Tseng:
Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems. SIAM J. Optim. 13(4): 960-985 (2003) - [j11]Houduo Qi, Liqun Qi, Defeng Sun:
Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient Methods. SIAM J. Optim. 14(2): 439-463 (2003) - [j10]Houduo Qi, Xiaoqi Yang:
Semismoothness of Spectral Functions. SIAM J. Matrix Anal. Appl. 25(3): 766-783 (2003) - 2002
- [j9]Defeng Sun, Robert S. Womersley, Houduo Qi:
A feasible semismooth asymptotically Newton method for mixed complementarity problems. Math. Program. 94(1): 167-187 (2002) - [j8]Asen L. Dontchev, Houduo Qi, Liqun Qi, Hongxia Yin:
A Newton Method for Shape-Preserving Spline Interpolation. SIAM J. Optim. 13(2): 588-602 (2002) - 2001
- [j7]Qiaoming Han, Li-Zhi Liao, Houduo Qi, Liqun Qi:
Stability Analysis of Gradient-Based Neural Networks for Optimization Problems. J. Glob. Optim. 19(4): 363-381 (2001) - [j6]Asen L. Dontchev, Houduo Qi, Liqun Qi:
Convergence of Newton's method for convex best interpolation. Numerische Mathematik 87(3): 435-456 (2001) - 2000
- [j5]Houduo Qi, Li-Zhi Liao:
A Smoothing Newton Method for General Nonlinear Complementarity Problems. Comput. Optim. Appl. 17(2-3): 231-253 (2000) - [j4]Houduo Qi:
A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions. SIAM J. Optim. 10(2): 315-330 (2000) - [j3]Houduo Qi, Liqun Qi:
A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization. SIAM J. Optim. 11(1): 113-132 (2000) - 1999
- [j2]Christian Kanzow, Houduo Qi:
A QP-free constrained Newton-type method for variational inequality problems. Math. Program. 85(1): 81-106 (1999) - [j1]Houduo Qi, Li-Zhi Liao:
A Smoothing Newton Method for Extended Vertical Linear Complementarity Problems. SIAM J. Matrix Anal. Appl. 21(1): 45-66 (1999)
Conference and Workshop Papers
- 2008
- [c1]Zhonghang Xia, Houduo Qi, Manghui Tu, Wenke Zhang:
Data Integration for Recommendation Systems. ICMLA 2008: 863-866
Informal and Other Publications
- 2024
- [i3]Jiaxin Xie, Houduo Qi, Deren Han:
Randomized iterative methods for generalized absolute value equations: Solvability and error bounds. CoRR abs/2405.04091 (2024) - [i2]Maojun Sun, Ruijian Han, Binyan Jiang, Houduo Qi, Defeng Sun, Yancheng Yuan, Jian Huang:
LAMBDA: A Large Model Based Data Agent. CoRR abs/2407.17535 (2024) - 2014
- [i1]Chao Ding, Hou-Duo Qi:
Convex Optimization Learning of Faithful Euclidean Distance Representations in Nonlinear Dimensionality Reduction. CoRR abs/1406.5736 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
