Jordan-algebraic aspects of optimization: randomization
From MaRDI portal
Publication:3161141
DOI10.1080/10556780903033771zbMath1247.90218OpenAlexW2054749913MaRDI QIDQ3161141
Publication date: 12 October 2010
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780903033771
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Jordan algebras (algebras, triples and pairs) (17C99)
Related Items
On a ternary generalization of Jordan algebras, On Hazan's algorithm for symmetric programming problems
Cites Work
- Unnamed Item
- Extension of primal-dual interior point algorithms to symmetric cones
- On a commutative class of search directions for linear programming over symmetric cones
- On maximization of quadratic form over intersection of ellipsoids with common center
- Lectures on Modern Convex Optimization
- A Unified Theorem on SDP Rank Reduction
- Jordan‐Algebraic Approach to Convexity Theorems for Quadratic Mappings
- Several Jordan-algebraic aspects of optimization†
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- Simultaneous diagonalization on simple Euclidean Jordan algebras and its applications
- A long-step primal--dual algorithm for the symmetric programming problem
- A Jordan-algebraic approach to potential-reduction algorithms
