Stein linear programs over symmetric cones
From MaRDI portal
Recommendations
- Feasibility and solvability of Lyapunov-type linear programming over symmetric cones
- A long-step primal--dual algorithm for the symmetric programming problem
- Lyapunov-type least-squares problems over symmetric cones
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- The \(\mathbf Q\)-property of composite transformations and the \(\mathbf P\)-property of Stein-type transformations on self-dual and symmetric cones
Cites work
- Automorphism Invariance of P- and GUS-Properties of Linear Transformations on Euclidean Jordan Algebras
- Extension of primal-dual interior point algorithms to symmetric cones
- Feasibility and solvability of Lyapunov-type linear programming over symmetric cones
- scientific article; zbMATH DE number 3558452 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- Minimality and complementarity properties associated with Z-functions and M-functions
- On some interconnections between strict monotonicity, globally uniquely solvable, and \(P\) properties in semidefinite linear complementarity problems.
- On the Lipschitzian property in linear complementarity problems over symmetric cones
- Some inertia theorems in Euclidean Jordan algebras
- Some P-properties for linear transformations on Euclidean Jordan algebras
- Z-transformations on proper and symmetric cones
Cited in
(2)
This page was built for publication: Stein linear programs over symmetric cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5396052)