A long-step primal--dual algorithm for the symmetric programming problem
From MaRDI portal
Recommendations
- Extension of primal-dual interior point algorithms to symmetric cones
- Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
- Euclidean Jordan algebras and interior-point algorithms
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- A T-Algebraic Approach to Primal-Dual Interior-Point Algorithms
Cites work
- A Jordan-algebraic approach to potential-reduction algorithms
- Euclidean Jordan algebras and interior-point algorithms
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- On the long-step path-following method for semidefinite programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
Cited in
(23)- Numerical experiments with universal barrier functions for cones of Chebyshev systems
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- An O(rL) infeasible interior-point algorithm for symmetric cone LCP via CHKS function
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Primal-dual algorithms and infinite-dimensional Jordan algebras of finite rank
- Extension of primal-dual interior point algorithms to symmetric cones
- On a commutative class of search directions for linear programming over symmetric cones
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
- On Hazan's algorithm for symmetric programming problems
- A primal-dual interior-point method based on various selections of displacement step for symmetric optimization
- Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions
- Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
- Jordan-algebraic aspects of optimization: randomization
- Derivatives of eigenvalues and Jordan frames
- Several Jordan-algebraic aspects of optimization†
- New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems
- Extension of primal-dual interior point methods to diff-convex problems on symmetric cones
- Infeasible Mehrotra-type predictor-corrector interior-point algorithm for the Cartesian P_()-LCP over symmetric cones
- A polynomial primal-dual affine scaling algorithm for symmetric conic optimization
- Stein linear programs over symmetric cones
- Implementation of infinite-dimensional interior-point method for solving multi-criteria linear-quadratic control problem
- A Jordan-algebraic approach to potential-reduction algorithms
- Feasibility and solvability of Lyapunov-type linear programming over symmetric cones
This page was built for publication: A long-step primal--dual algorithm for the symmetric programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941187)
