Feasibility and solvability of Lyapunov-type linear programming over symmetric cones
From MaRDI portal
Publication:707872
DOI10.1007/s11117-009-0032-5zbMath1225.90099MaRDI QIDQ707872
Publication date: 8 October 2010
Published in: Positivity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11117-009-0032-5
solvability; feasibility; symmetric cone; Lyapunov-type Farkas' lemma; Lyapunov-type linear programming
90C25: Convex programming
90C46: Optimality conditions and duality in mathematical programming
15A09: Theory of matrix inversion and generalized inverses
49N15: Duality theory (optimization)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some inertia theorems in Euclidean Jordan algebras
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Similarity and other spectral relations for symmetric cones
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- On a commutative class of search directions for linear programming over symmetric cones
- Generalized inverses: theory and computations
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- More on linear inequalities with applications to matrix theory
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- Several Jordan-algebraic aspects of optimization†
- Generalizations of Farkas’ Theorem
- Low-Rank Solution of Lyapunov Equations
- Structured and simultaneous Lyapunov functions for system stability problems
- Semidefinite Programming
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Convex Analysis
- A long-step primal--dual algorithm for the symmetric programming problem
- A Jordan-algebraic approach to potential-reduction algorithms
