Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem

DOI10.1007/s00186-013-0460-7zbMath1291.90163OpenAlexW1989204766MaRDI QIDQ2454077

Yong Xia, Ying-Wei Han

Publication date: 12 June 2014

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-013-0460-7

zbMATH Keywords

Lagrangian relaxationsemidefinite programmingFrank-Wolfe algorithmorthogonal Procrustes problemquadratic conic programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Quadratic programming (90C20)

Related Items

On a sub‐Stiefel Procrustes problem arising in computer vision, Linear Programming on the Stiefel Manifold

Uses Software

• SeDuMi
• CVX

Cites Work

• Semidefinite programming
• Non-Euclidean restricted memory level method for large-scale convex optimization
• A Procrustes problem on the Stiefel manifold
• On semidefinite programming relaxations for the satisfiability problem
• A generalized solution of the orthogonal Procrustes problem
• On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Trust Region Methods
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Quadratic Matrix Programming
• Some Modified Matrix Eigenvalue Problems