An introduction to formally real Jordan algebras and their applications in optimization
From MaRDI portal
Publication:2802529
Recommendations
- Several Jordan-algebraic aspects of optimization†
- Euclidean Jordan algebras and interior-point algorithms
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Jordan-algebraic aspects of nonconvex optimization over symmetric cones
- Jordan‐Algebraic Approach to Convexity Theorems for Quadratic Mappings
Cites work
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 741122 (Why is no real title available?)
- scientific article; zbMATH DE number 1489808 (Why is no real title available?)
- scientific article; zbMATH DE number 1534294 (Why is no real title available?)
- scientific article; zbMATH DE number 3445421 (Why is no real title available?)
- scientific article; zbMATH DE number 3225176 (Why is no real title available?)
- scientific article; zbMATH DE number 3234475 (Why is no real title available?)
- scientific article; zbMATH DE number 3246461 (Why is no real title available?)
- scientific article; zbMATH DE number 3346614 (Why is no real title available?)
- scientific article; zbMATH DE number 3409568 (Why is no real title available?)
- scientific article; zbMATH DE number 3073200 (Why is no real title available?)
- A Jordan-algebraic approach to potential-reduction algorithms
- A Note on the Exceptional Jordan Algebra
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- A taste of Jordan algebras
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- An Interior-Point Method for Semidefinite Programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- Applications of second-order cone programming
- Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
- Barrier Functions in Interior Point Methods
- Bilinear optimality constraints for the cone of positive polynomials
- Complementarity and nondegeneracy in semidefinite programming
- Cone-LP's and semidefinite programs: geometry and a simplex-type method
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- Euclidean Jordan algebras and interior-point algorithms
- Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
- Extension of primal-dual interior point algorithms to symmetric cones
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior path following primal-dual algorithms. I: Linear programming
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Matrix Analysis
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Schur complements, Schur determinantal and Haynsworth inertia formulas in Euclidean Jordan algebras
- Second-order cone programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Smooth minimization of non-smooth functions
- Some P-properties for linear transformations on Euclidean Jordan algebras
- The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
- The \(Q\) method for second order cone programming
- The \(Q\) method for symmetric cone programming
Cited in
(7)- Random projections for conic programs
- LP-based tractable subcones of the semidefinite plus nonnegative cone
- Random projections for linear programming: an improved retrieval phase
- Several Jordan-algebraic aspects of optimization†
- Jordan-algebraic aspects of optimization: randomization
- A new extension of Chubanov's method to symmetric cones
- Approximation hierarchies for copositive cone over symmetric cone and their comparison
This page was built for publication: An introduction to formally real Jordan algebras and their applications in optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802529)
