A generalized power iteration method for solving quadratic problem on the stiefel manifold
In this paper, we first propose a novel generalized power iteration (GPI) method to solve the
quadratic problem on the Stiefel manifold (QPSM) as min_ W^ TW= I min WTW= I Tr (WT …
quadratic problem on the Stiefel manifold (QPSM) as min_ W^ TW= I min WTW= I Tr (WT …
A general framework for feature selection under orthogonal regression with global redundancy minimization
Feature selection has attracted a lot of attention in obtaining discriminative and non-
redundant features from high-dimension data. Compared with traditional filter and wrapper …
redundant features from high-dimension data. Compared with traditional filter and wrapper …
Feature selection under regularized orthogonal least square regression with optimal scaling
Due to lack of scale change in orthogonal least square regression (OLSR), the scaling term
is introduced to OLSR to build up a novel orthogonal least square regression with optimal …
is introduced to OLSR to build up a novel orthogonal least square regression with optimal …
Estimating Outlier-Immunized Common Harmonic Waves for Brain Network Analyses on the Stiefel Manifold
Since brain network organization is essentially governed by the harmonic waves derived
from the Eigen-system of the underlying Laplacian matrix, discovering the harmonic-based …
from the Eigen-system of the underlying Laplacian matrix, discovering the harmonic-based …
A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold
We study semidefinite programming (SDP) relaxations for the NP-hard problem of globally
optimizing a quadratic function over the Stiefel manifold. We introduce a strengthened …
optimizing a quadratic function over the Stiefel manifold. We introduce a strengthened …
Linear programming on the Stiefel manifold
M Song, Y Xia - SIAM Journal on Optimization, 2024 - SIAM
Linear programming on the Stiefel manifold (LPS) is studied for the first time. It aims at
minimizing a linear objective function over the set of all-tuples of orthonormal vectors in …
minimizing a linear objective function over the set of all-tuples of orthonormal vectors in …
On a sub‐Stiefel Procrustes problem arising in computer vision
JR Cardoso, K Ziȩtak - Numerical Linear Algebra with …, 2015 - Wiley Online Library
A sub‐Stiefel matrix is a matrix that results from deleting simultaneously the last row and the
last column of an orthogonal matrix. In this paper, we consider a Procrustes problem on the …
last column of an orthogonal matrix. In this paper, we consider a Procrustes problem on the …
基于双线性迭代量化的哈希图像检索方法.
崔文成, 徐盼盼, 邵虹 - Application Research of Computers …, 2020 - search.ebscohost.com
针对迭代量化哈希算法未考虑高维图像描述符中呈现出的自然矩阵结构, 当视觉描述符由高维
特征向量表示并且分配长二进制码时, 投影矩阵需要昂贵的空间和时间复杂度的问题 …
特征向量表示并且分配长二进制码时, 投影矩阵需要昂贵的空间和时间复杂度的问题 …
Advances in Convex Relaxations for Quadratic Optimization: A Study on Conic Programming Relaxations Including Second-Order-Cone and Semidefinite …
K Park - 2023 - search.proquest.com
Quadratic optimization problems are crucial in various applications, ranging from
engineering and science to economics. However, solving nonconvex quadratic problems …
engineering and science to economics. However, solving nonconvex quadratic problems …
[PDF][PDF] The Multi-Class Stackelberg Prediction Game with Least Squares Loss
S Han, Y Lin, J Wang, LH Zhang - 2023 - researchgate.net
The Stackelberg prediction game (SPG) is an effective model that formulates the strategic
interaction between the learner and data generator in a competition situation in which the …
interaction between the learner and data generator in a competition situation in which the …