Feasibility and solvability of Lyapunov-type linear programming over symmetric cones
DOI10.1007/S11117-009-0032-5zbMATH Open1225.90099OpenAlexW2014268800MaRDI QIDQ707872FDOQ707872
Authors: Ziyan Luo, Naihua Xiu 
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
Recommendations
- Lyapunov-type least-squares problems over symmetric cones
- Stein linear programs over symmetric cones
- A primal-dual symmetric relaxation for homogeneous conic systems
- Some aspects of feasibility and solvability for cone linear complementarity problems
- Characterizations of interiors of feasible and infeasible data instances and feasibility for conic linear programming
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Theory of matrix inversion and generalized inverses (15A09) Duality theory (optimization) (49N15)
Cites Work
- Title not available (Why is that?)
- Semidefinite Programming
- Convex Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some inertia theorems in Euclidean Jordan algebras
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- 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
- A Jordan-algebraic approach to potential-reduction algorithms
- 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
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- Low-Rank Solution of Lyapunov Equations
- A long-step primal--dual algorithm for the symmetric programming problem
- Generalized inverses: theory and computations
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- Structured and simultaneous Lyapunov functions for system stability problems
- More on linear inequalities with applications to matrix theory
- Several Jordan-algebraic aspects of optimization†
- Generalizations of Farkas’ Theorem
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Feasibility and solvability of Lyapunov-type linear programming over symmetric cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707872)
