An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization
From MaRDI portal
Publication:2802529
DOI10.1007/978-1-4614-0769-0_11zbMath1334.90123OpenAlexW194686849MaRDI QIDQ2802529
No author found.
Publication date: 26 April 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_11
Convex programming (90C25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Jordan algebras (algebras, triples and pairs) (17C99)
Related Items
LP-based tractable subcones of the semidefinite plus nonnegative cone, Approximation hierarchies for copositive cone over symmetric cone and their comparison, A new extension of Chubanov's method to symmetric cones, Random projections for conic programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- The \(Q\) method for symmetric cone programming
- Some P-properties for linear transformations on Euclidean Jordan algebras
- Bilinear optimality constraints for the cone of positive polynomials
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- Schur complements, Schur determinantal and Haynsworth inertia formulas in Euclidean Jordan algebras
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- Interior path following primal-dual algorithms. I: Linear programming
- Applications of second-order cone programming
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
- Complementarity and nondegeneracy in semidefinite programming
- 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
- Second-order cone programming
- A taste of Jordan algebras
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
- The \(Q\) method for second order cone programming
- Lectures on Modern Convex Optimization
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Matrix Analysis
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- Cone-LP's and semidefinite programs: Geometry and a simplex-type method
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- An Interior-Point Method for Semidefinite Programming
- A Note on the Exceptional Jordan Algebra
- A Jordan-algebraic approach to potential-reduction algorithms
