Some applications of optimization in matrix theory

DOI10.1016/0024-3795(81)90143-9zbMath0472.90078OpenAlexW2076767912WikidataQ94994177 ScholiaQ94994177MaRDI QIDQ1158352

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

Lagrange multipliersduality gapFarkas' lemmalinear programming over conesmatrix best approximation

Mathematics Subject Classification ID

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

Related Items (20)

Embedding methods for semidefinite programming ⋮ A simple constraint qualification in infinite dimensional programming ⋮ Some geometric results in semidefinite programming ⋮ A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming ⋮ Explicit solutions for interval semidefinite linear programs ⋮ On some fundamental properties of structural topology optimization problems ⋮ Strong duality and minimal representations for cone optimization ⋮ Unnamed Item ⋮ Graph rigidity via Euclidean distance matrices ⋮ New constraint qualification and conjugate duality for composed convex optimization problems ⋮ Cone-LP's and semidefinite programs: Geometry and a simplex-type method ⋮ Generalizations of Slater's constraint qualification for infinite convex programs ⋮ Copositive realxation for genera quadratic programming ⋮ Semidefinite programming and combinatorial optimization ⋮ Preprocessing and Regularization for Degenerate Semidefinite Programs ⋮ Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints ⋮ Understanding linear semi-infinite programming via linear programming over cones ⋮ Hilbert-Schmidt approximation problems arising in quantum chemistry ⋮ The minimal cone for conic linear programming ⋮ Semidefinite programming

Cites Work

• Regularizing the abstract convex program
• Cones of diagonally dominant matrices
• Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
• Cones, matrices and mathematical programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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