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

European Journal of Operational Research

Volumn 143, Issue 2, 2002, Pages 356-364

  Wolkowicz, Henry ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Lagrangian relaxation; Orthogonal constraints; Procrustes problem; Quadratic objective; Redundant constraints; Semidefinite programming; Strong duality

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; LAGRANGE MULTIPLIERS; MATRIX ALGEBRA; QUADRATIC PROGRAMMING;

QUADRATIC OBJECTIVE; SEMIDEFINITE PROGRAMMING (SDP);

OPERATIONS RESEARCH;

EID: 0036883766     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00295-3     Document Type: Conference Paper

References (16)

1. A new bound for the quadratic assignment problem based on convex quadratic programming
2. On Lagrangian relaxation of quadratic matrix constraints
3. A trust region strategy for nonlinear equality constrained optimization
4. The geometry of algorithms with orthogonality constraints
5. Quadratic assignment problems
6. A new lower bound via projection for the quadratic assignment problem
7. Semidefinite programming relaxations of nonconvex quadratic optimization
8. A semidefinite framework for trust region subproblems with applications to large scale minimization
9. Dual algorithms for orthogonal procrustes rotations
10. Indefinite trust region subproblems and nonsymmetric eigenvalue perturbations
11. Richtungsfelder und fernparallelismus in n-dimensionalem mannig faltigkeiten
12. Semidefinite and Lagrangian relaxations for hard combinatorial problems
13. Semidefinite programming relaxations for the graph partitioning problem
14. Semidefinite programming relaxations for the quadratic assignment problem