Jordan-algebraic aspects of optimization: randomization
From MaRDI portal
Recommendations
- Several Jordan-algebraic aspects of optimization†
- scientific article; zbMATH DE number 780783
- An introduction to formally real Jordan algebras and their applications in optimization
- Random optimization on random sets
- Randomized optimization: a probabilistic analysis
- A Randomized Algorithm to Optimize Over Certain Convex Sets
- Jordan-algebraic aspects of nonconvex optimization over symmetric cones
- A Jordan-algebraic approach to potential-reduction algorithms
- Random algorithms for solving convex inequalities
- Randomized algorithms in combinatorial optimization: A survey
Cites work
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- A Jordan-algebraic approach to potential-reduction algorithms
- A Unified Theorem on SDP Rank Reduction
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- A long-step primal--dual algorithm for the symmetric programming problem
- Extension of primal-dual interior point algorithms to symmetric cones
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Jordan‐Algebraic Approach to Convexity Theorems for Quadratic Mappings
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- 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
- Several Jordan-algebraic aspects of optimization†
- Simultaneous diagonalization on simple Euclidean Jordan algebras and its applications
Cited in
(3)
This page was built for publication: Jordan-algebraic aspects of optimization: randomization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3161141)
