A long-step primal--dual algorithm for the symmetric programming problem
From MaRDI portal
Publication:5941187
DOI10.1016/S0167-6911(01)00092-5zbMath0970.90117OpenAlexW2020830442WikidataQ127720140 ScholiaQ127720140MaRDI QIDQ5941187
Publication date: 20 August 2001
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6911(01)00092-5
Abstract computational complexity for mathematical programming problems (90C60) Interior-point methods (90C51) Jordan algebras (algebras, triples and pairs) (17C99)
Related Items
Jordan-algebraic aspects of optimization: randomization, Derivatives of eigenvalues and Jordan frames, New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems, Several Jordan-algebraic aspects of optimization†, Feasibility and solvability of Lyapunov-type linear programming over symmetric cones, Implementation of infinite-dimensional interior-point method for solving multi-criteria linear-quadratic control problem, Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones, 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, On a commutative class of search directions for linear programming over symmetric cones
Cites Work
- Unnamed Item
- Unnamed Item
- On the long-step path-following method for semidefinite programming
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Euclidean Jordan algebras and interior-point algorithms
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- A Jordan-algebraic approach to potential-reduction algorithms
