A note on lack of strong duality for quadratic problems with orthogonal constraints (Q1848387): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound for the quadratic assignment problem based on convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lagrangian Relaxation of Quadratic Matrix Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3681854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Geometry of Algorithms with Orthogonality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3747197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Lower Bound Via Projection for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite framework for trust region subproblems with applications to large scale minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual Algorithm for Orthogonal Procrustes Rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Richtungsfelder und Fernparallelismus in \(n\)-dimensionalen Mannigfaltigkeiten / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the quadratic assignment problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(02)00295-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026391120 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:36, 30 July 2024

scientific article
Language Label Description Also known as
English
A note on lack of strong duality for quadratic problems with orthogonal constraints
scientific article

    Statements

    A note on lack of strong duality for quadratic problems with orthogonal constraints (English)
    0 references
    0 references
    20 November 2002
    0 references
    Quadratic objective
    0 references
    Orthogonal constraints
    0 references
    Semidefinite programming
    0 references
    Lagrangian relaxation
    0 references
    Redundant constraints
    0 references
    Strong duality
    0 references
    Procrustes problem
    0 references

    Identifiers