| Publication | Date of Publication | Type |
|---|
| Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications | 2024-01-10 | Paper |
| Sparse SVM with Hard-Margin Loss: a Newton-Augmented Lagrangian Method in Reduced Dimensions | 2023-07-30 | Paper |
| iNALM: An inexact Newton Augmented Lagrangian Method for Zero-One Composite Optimization | 2023-06-15 | Paper |
| Geometric Characterization of Maximum Diversification Return Portfolio via Rao’s Quadratic Entropy | 2023-06-01 | Paper |
| An Optimization Study of Diversification Return Portfolios | 2023-03-02 | Paper |
| A Lagrange-Newton algorithm for sparse nonlinear programming | 2022-10-24 | Paper |
| A penalized method of alternating projections for weighted low-rank Hankel matrix optimization | 2022-10-06 | Paper |
| Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization | 2022-01-07 | Paper |
| On the long-only minimum variance portfolio under single factor model | 2021-12-13 | Paper |
| Optimal portfolio selections via \(\ell_{1, 2}\)-norm regularization | 2021-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4998877 | 2021-07-09 | Paper |
| Robust Euclidean embedding via EDM optimization | 2021-01-25 | Paper |
| The decompositions with respect to two core non-symmetric cones | 2020-02-28 | Paper |
| Lagrangian duality and saddle points for sparse linear programming | 2019-11-27 | Paper |
| Classical Multidimensional Scaling: A Subspace Perspective, Over-Denoising, and Outlier Detection | 2019-10-28 | Paper |
| Preface | 2019-06-25 | Paper |
| A Fast Matrix Majorization-Projection Method for Penalized Stress Minimization With Box Constraints | 2019-02-12 | Paper |
| Global and Quadratic Convergence of Newton Hard-Thresholding Pursuit | 2019-01-09 | Paper |
| An Inexact Smoothing Newton Method for Euclidean Distance Matrix Optimization Under Ordinal Constraints | 2018-10-22 | Paper |
| A sequential majorization method for approximating weighted time series of finite rank | 2018-09-27 | Paper |
| A Lagrangian Dual Approach to the Single-Source Localization Problem | 2018-08-22 | Paper |
| A Lagrangian Dual Based Approach to Sparse Linear Programming | 2018-05-30 | Paper |
| Iterative reweighted methods for \(\ell _1-\ell _p\) minimization | 2018-05-25 | Paper |
| A null-space-based weightedl1minimization approach to compressed sensing | 2018-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3134091 | 2018-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132649 | 2018-01-29 | Paper |
| New Sufficient Conditions for Global Robust Stability of Delayed Neural Networks | 2017-11-20 | Paper |
| Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction | 2017-07-21 | Paper |
| Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation | 2017-05-29 | Paper |
| A Convex Matrix Optimization for the Additive Constant Problem in Multidimensional Scaling with Application to Locally Linear Embedding | 2016-12-13 | Paper |
| Regularized multidimensional scaling with radial basis functions | 2015-10-22 | Paper |
| A Computable Characterization of the Extrinsic Mean of Reflection Shapes and Its Asymptotic Properties | 2015-04-15 | Paper |
| Conditional quadratic semidefinite programming: examples and methods | 2015-01-27 | Paper |
| Computing the nearest Euclidean distance matrix with low embedding dimensions | 2014-10-17 | Paper |
| A convex quadratic semi-definite programming approach to the partial additive constant problem in multidimensional scaling | 2013-06-28 | Paper |
| A Semismooth Newton Method for the Nearest Euclidean Distance Matrix Problem | 2013-06-27 | Paper |
| A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem | 2012-03-16 | Paper |
| Block relaxation and majorization methods for the nearest correlation matrix with factor structure | 2012-03-09 | Paper |
| A semidefinite programming study of the Elfving theorem | 2011-06-24 | Paper |
| An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem | 2011-06-07 | Paper |
| Local Duality of Nonlinear Semidefinite Programming | 2011-04-27 | Paper |
| Newton's method for computing the nearest correlation matrix with a simple upper bound | 2011-01-19 | Paper |
| Correlation stress testing for value-at-risk: an unconstrained convex optimization approach | 2010-03-19 | Paper |
| Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming | 2009-02-10 | Paper |
| An application of the nearest correlation matrix on web document classification | 2008-02-11 | Paper |
| Regularity and well-posedness of a dual program for convex best \(C^{1}\)-spline interpolation | 2007-10-12 | Paper |
| A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix | 2007-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5494165 | 2006-10-17 | Paper |
| Armijo Newton method for convex best interpolation | 2006-07-13 | Paper |
| Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem | 2006-05-02 | Paper |
| Finite termination of a dual Newton method for convex best \(C^1\) interpolation and smoothing | 2005-10-28 | Paper |
| Smooth convex approximation to the maximum eigenvalue function | 2005-05-17 | Paper |
| Neurodynamical optimization | 2005-04-07 | Paper |
| Semismoothness of Spectral Functions | 2005-02-21 | Paper |
| Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems | 2004-01-19 | Paper |
| Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient Methods | 2004-01-19 | Paper |
| On the minimum norm solution of linear programs | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426068 | 2003-09-16 | Paper |
| A feasible semismooth asymptotically Newton method for mixed complementarity problems | 2003-07-13 | Paper |
| Quadratic convergence of Newton's method for convex interpolation and smoothing | 2003-03-17 | Paper |
| A Newton Method for Shape-Preserving Spline Interpolation | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783278 | 2002-12-04 | Paper |
| Solving nonlinear complementarity problems with neural networks: A reformulation method approach | 2002-05-27 | Paper |
| A neural network for the linear complementarity problem | 2002-05-05 | Paper |
| Convergence of Newton's method for convex best interpolation | 2001-10-07 | Paper |
| Stability analysis of gradient-based neural networks for optimization problems | 2001-08-28 | Paper |
| A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization | 2001-03-19 | Paper |
| A smoothing Newton method for general nonlinear complementarity problems | 2001-02-18 | Paper |
| A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions | 2000-11-20 | Paper |
| Exceptional families and existence theorems for variational inequality problems | 2000-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503864 | 2000-09-14 | Paper |
| Tikhonov regularization methods for variational inequality problems | 2000-07-12 | Paper |
| On minimizing and stationary sequences of a new class of merit functions for nonlinear complementarity problems | 2000-06-14 | Paper |
| Regularized smoothing approximations to vertical nonlinear complementarity problems | 2000-04-29 | Paper |
| A Smoothing Newton Method for Extended Vertical Linear Complementarity Problems | 1999-11-24 | Paper |
| A QP-free constrained Newton-type method for variational inequality problems | 1999-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4391790 | 1999-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4238924 | 1999-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840121 | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4346528 | 1997-12-11 | Paper |
