Symmetric matrices whose entries are linear functions
From MaRDI portal
Publication:2206413
DOI10.1134/S0965542520010121zbMath1454.15023OpenAlexW3013106083MaRDI QIDQ2206413
Publication date: 22 October 2020
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542520010121
Semidefinite programming (90C22) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Hermitian, skew-Hermitian, and related matrices (15B57) Matrices over function rings in one or more variables (15A54)
Related Items (1)
Uses Software
Cites Work
- On the arithmetic complexity of Strassen-like matrix multiplications
- Newton's method for minimizing a convex twice differentiable function on a preconvex set
- Nonsymmetric normal entry patterns with the maximum number of distinct indeterminates
- Primal Newton method for the linear cone programming problem
- Finding sets of solutions to systems of nonlinear inequalities
- Accelerated first-order methods for hyperbolic programming
- An extension of Chubanov's algorithm to symmetric cones
- Affine reductions for LPs and SDPs
- Generic amplification of recursively enumerable sets
- Level-set methods for convex optimization
- On real typical ranks
- Polynomial greatest common divisor as a solution of system of linear equations
- Sum-of-squares hierarchy lower bounds for symmetric formulations
- MathPartner computer algebra
- Almost-nonsingular entry pattern matrices
- A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
- ACI-matrices of constant rank over arbitrary fields
- On the maximum rank of completions of entry pattern matrices
- Partial matrices of constant rank
- Positive semidefinite matrix completion, universal rigidity and the strong Arnold property
- The bilinear complexity and practical algorithms for matrix multiplication
- A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
- Fast matrix multiplication and its algebraic neighbourhood
- ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM
- ON COMPLEXITY OF THE SATISFIABILITY PROBLEM OF SYSTEMS OVER FINITE POSETS
- Most Tensor Problems Are NP-Hard
- Finding connected components of a semialgebraic set in subexponential time
- Singular, nonsingular, and bounded rank completions of ACI-matrices
This page was built for publication: Symmetric matrices whose entries are linear functions
