Some applications of optimization in matrix theory

DOI10.1016/0024-3795(81)90143-9MaRDI QIDQ1158352zbMATH OpenOpenAlexWikidataFDO

Authors Henry Wolkowicz

Publication date 1981

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(81)90143-9

zbMATH Keywords

duality gapFarkas' lemmaLagrange multiplierslinear programming over conesmatrix best approximation

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Best approximation, Chebyshev systems (41A50) Duality theory for topological vector spaces (46A20) Topological linear spaces and related structures (46A99) Methods involving semicontinuity and convergence; relaxation (49J45) Convex programming (90C25) Programming in abstract spaces (90C48)

Cites work

• Cones of diagonally dominant matrices
• Cones, matrices and mathematical programming
• scientific article; zbMATH DE number 3850834 (Why is no real title available?)
• scientific article; zbMATH DE number 3737415 (Why is no real title available?)
• scientific article; zbMATH DE number 3525695 (Why is no real title available?)
• scientific article; zbMATH DE number 3271001 (Why is no real title available?)
• scientific article; zbMATH DE number 3281211 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• scientific article; zbMATH DE number 3410807 (Why is no real title available?)
• Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
• Regularizing the abstract convex program

Cited in

(20)

• Generalizations of Slater's constraint qualification for infinite convex programs
• Semidefinite programming
• Some geometric results in semidefinite programming
• A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
• Explicit solutions for interval semidefinite linear programs
• Strong duality and minimal representations for cone optimization
• Graph rigidity via Euclidean distance matrices
• New constraint qualification and conjugate duality for composed convex optimization problems
• Embedding methods for semidefinite programming
• Understanding linear semi-infinite programming via linear programming over cones
• A simple constraint qualification in infinite dimensional programming
• On some fundamental properties of structural topology optimization problems
• Copositive realxation for genera quadratic programming
• Cone-LP's and semidefinite programs: geometry and a simplex-type method
• Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints
• Preprocessing and regularization for degenerate semidefinite programs
• Semidefinite programming and combinatorial optimization
• scientific article; zbMATH DE number 7743708 (Why is no real title available?)
• Hilbert-Schmidt approximation problems arising in quantum chemistry
• The minimal cone for conic linear programming

This page was built for publication: Some applications of optimization in matrix theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1158352)