A note on lack of strong duality for quadratic problems with orthogonal constraints

DOI10.1016/S0377-2217(02)00295-3zbMath1058.90046OpenAlexW2026391120MaRDI QIDQ1848387

Henry Wolkowicz

Publication date: 20 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00295-3

zbMATH Keywords

Lagrangian relaxationSemidefinite programmingProcrustes problemStrong dualityRedundant constraintsOrthogonal constraintsQuadratic objective

Mathematics Subject Classification ID

Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)

Related Items

A survey of hidden convex optimization, Linear Programming on the Stiefel Manifold, Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons

Cites Work

• A semidefinite framework for trust region subproblems with applications to large scale minimization
• Semidefinite programming relaxations for the quadratic assignment problem
• Semidefinite programming relaxations for the graph partitioning problem
• Richtungsfelder und Fernparallelismus in \(n\)-dimensionalen Mannigfaltigkeiten
• On Lagrangian Relaxation of Quadratic Matrix Constraints
• Dual Algorithm for Orthogonal Procrustes Rotations
• A New Lower Bound Via Projection for the Quadratic Assignment Problem
• The Geometry of Algorithms with Orthogonality Constraints
• Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
• A new bound for the quadratic assignment problem based on convex quadratic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item