Some applications of optimization in matrix theory
From MaRDI portal
Convex programming (90C25) Best approximation, Chebyshev systems (41A50) Methods involving semicontinuity and convergence; relaxation (49J45) Programming in abstract spaces (90C48) Matrix equations and identities (15A24) Duality theory for topological vector spaces (46A20) Topological linear spaces and related structures (46A99)
Cites work
- 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?)
- Cones of diagonally dominant matrices
- Cones, matrices and mathematical programming
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- Regularizing the abstract convex program
Cited in
(20)- Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints
- Semidefinite programming
- Understanding linear semi-infinite programming via linear programming over cones
- A simple constraint qualification in infinite dimensional programming
- Preprocessing and regularization for degenerate semidefinite programs
- Graph rigidity via Euclidean distance matrices
- Generalizations of Slater's constraint qualification for infinite convex programs
- Strong duality and minimal representations for cone optimization
- Embedding methods for semidefinite programming
- Semidefinite programming and combinatorial optimization
- Hilbert-Schmidt approximation problems arising in quantum chemistry
- The minimal cone for conic linear programming
- Cone-LP's and semidefinite programs: geometry and a simplex-type method
- Explicit solutions for interval semidefinite linear programs
- New constraint qualification and conjugate duality for composed convex optimization problems
- Some geometric results in semidefinite programming
- Copositive realxation for genera quadratic programming
- scientific article; zbMATH DE number 7743708 (Why is no real title available?)
- On some fundamental properties of structural topology optimization problems
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic 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)
