Houduo Qi

Orcid: 0000-0003-3481-4814

According to our database1, Houduo Qi authored at least 51 papers between 1999 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Perturbation analysis of the euclidean distance matrix optimization problem and its numerical implications.
Comput. Optim. Appl., December, 2023

Geometric Characterization of Maximum Diversification Return Portfolio via Rao's Quadratic Entropy.
SIAM J. Financial Math., June, 2023

2022
A penalized method of alternating projections for weighted low-rank hankel matrix optimization.
Math. Program. Comput., 2022

A Lagrange-Newton algorithm for sparse nonlinear programming.
Math. Program., 2022

2021
Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization.
SIAM J. Optim., 2021

On the long-only minimum variance portfolio under single factor model.
Oper. Res. Lett., 2021

Global and Quadratic Convergence of Newton Hard-Thresholding Pursuit.
J. Mach. Learn. Res., 2021

Optimal portfolio selections via ℓ <sub>1, 2</sub>-norm regularization.
Comput. Optim. Appl., 2021

2020
Robust Euclidean embedding via EDM optimization.
Math. Program. Comput., 2020

The decompositions with respect to two core non-symmetric cones.
J. Glob. Optim., 2020

2019
Classical Multidimensional Scaling: A Subspace Perspective, Over-Denoising, and Outlier Detection.
IEEE Trans. Signal Process., 2019

Preface.
Asia Pac. J. Oper. Res., 2019

2018
A Fast Matrix Majorization-Projection Method for Penalized Stress Minimization With Box Constraints.
IEEE Trans. Signal Process., 2018

Iterative reweighted methods for \(\ell _1-\ell _p\) minimization.
Comput. Optim. Appl., 2018

2017
Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction.
Math. Program., 2017

Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation.
Comput. Optim. Appl., 2017

2016
A Convex Matrix Optimization for the Additive Constant Problem in Multidimensional Scaling with Application to Locally Linear Embedding.
SIAM J. Optim., 2016

Tackling the flip ambiguity in wireless sensor network localization and beyond.
Digit. Signal Process., 2016

2015
Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach.
SIAM J. Optim., 2015

A Computable Characterization of the Extrinsic Mean of Reflection Shapes and Its Asymptotic Properties.
Asia Pac. J. Oper. Res., 2015

2014
Computing the nearest Euclidean distance matrix with low embedding dimensions.
Math. Program., 2014

2013
A Lagrangian Dual Approach to the Single-Source Localization Problem.
IEEE Trans. Signal Process., 2013

A Semismooth Newton Method for the Nearest Euclidean Distance Matrix Problem.
SIAM J. Matrix Anal. Appl., 2013

2011
A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem.
SIAM J. Optim., 2011

Block relaxation and majorization methods for the nearest correlation matrix with factor structure.
Comput. Optim. Appl., 2011

2010
Newton's Method for Computing the Nearest Correlation Matrix with a Simple Upper Bound.
J. Optim. Theory Appl., 2010

Correlation stress testing for value-at-risk: an unconstrained convex optimization approach.
Comput. Optim. Appl., 2010

2009
Local Duality of Nonlinear Semidefinite Programming.
Math. Oper. Res., 2009

2008
Data Integration for Recommendation Systems.
Proceedings of the Seventh International Conference on Machine Learning and Applications, 2008

2007
New Sufficient Conditions for Global Robust Stability of Delayed Neural Networks.
IEEE Trans. Circuits Syst. I Regul. Pap., 2007

Regularity and well-posedness of a dual program for convex best <i>C</i><sup>1</sup>-spline interpolation.
Comput. Optim. Appl., 2007

2006
A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix.
SIAM J. Matrix Anal. Appl., 2006

Armijo Newton method for convex best interpolation.
Optim. Methods Softw., 2006

Cartesian <i>P</i>-property and Its Applications to the Semidefinite Linear Complementarity Problem.
Math. Program., 2006

2005
Deriving sufficient conditions for global asymptotic stability of delayed neural networks via nonsmooth analysis-II.
IEEE Trans. Neural Networks, 2005

2004
Deriving sufficient conditions for global asymptotic stability of delayed neural networks via nonsmooth analysis.
IEEE Trans. Neural Networks, 2004

Neurodynamical Optimization.
J. Glob. Optim., 2004

Smooth Convex Approximation to the Maximum Eigenvalue Function.
J. Glob. Optim., 2004

2003
Semismoothness of Spectral Functions.
SIAM J. Matrix Anal. Appl., 2003

Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient Methods.
SIAM J. Optim., 2003

Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems.
SIAM J. Optim., 2003

Finite termination of a dual Newton method for convex best <i>C</i> <sup> <i>1</i> </sup> interpolation and smoothing.
Numerische Mathematik, 2003

2002
A Newton Method for Shape-Preserving Spline Interpolation.
SIAM J. Optim., 2002

A feasible semismooth asymptotically Newton method for mixed complementarity problems.
Math. Program., 2002

2001
Convergence of Newton's method for convex best interpolation.
Numerische Mathematik, 2001

Stability Analysis of Gradient-Based Neural Networks for Optimization Problems.
J. Glob. Optim., 2001

2000
A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization.
SIAM J. Optim., 2000

A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions.
SIAM J. Optim., 2000

A Smoothing Newton Method for General Nonlinear Complementarity Problems.
Comput. Optim. Appl., 2000

1999
A Smoothing Newton Method for Extended Vertical Linear Complementarity Problems.
SIAM J. Matrix Anal. Appl., 1999

A QP-free constrained Newton-type method for variational inequality problems.
Math. Program., 1999


  Loading...