A Jordan-algebraic approach to potential-reduction algorithms
From MaRDI portal
The author considers a linear monotone complementarity problem for domains obtained as the intersection of an affine subspace and the Cartesian product of symmetric cones. For this problem, a primal-dual potential-reduction algorithm is derived using the Jordan-algebraic technique.
Recommendations
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Jordan-algebraic aspects of nonconvex optimization over symmetric cones
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- Euclidean Jordan algebras and interior-point algorithms
- A long-step primal--dual algorithm for the symmetric programming problem
Cited in
(63)- An O(rL) infeasible interior-point algorithm for symmetric cone LCP via CHKS function
- Similarity and other spectral relations for symmetric cones
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
- A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization
- An inexact interior point method for the large-scale simulation of granular material
- An extension of Chubanov's algorithm to symmetric cones
- On self-regular IPMs (with comments and rejoinder)
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Gaddum's test for symmetric cones
- Rank computation in Euclidean Jordan algebras
- A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions
- A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds
- An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones
- Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
- Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions
- New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP
- A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization
- An extended Lie--Trotter formula and its applications
- A full Nesterov-Todd step infeasible-interior-point algorithm for Cartesian P_() horizontal linear complementarity problems over symmetric cones
- A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
- An introduction to formally real Jordan algebras and their applications in optimization
- An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem
- On extending primal-dual interior-point method for linear optimization to convex quadratic symmetric cone optimization
- Interior-point methods based on kernel functions for symmetric optimization
- A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
- An infeasible full-NT step IPM for P_() horizontal linear complementarity problem over Cartesian product of symmetric cones
- A corrector-predictor interior-point algorithm for P_()-HLCPs over Cartesian product of symmetric cones
- Jordan-algebraic aspects of optimization: randomization
- Todd's maximum-volume ellipsoid problem on symmetric cones
- Derivatives of eigenvalues and Jordan frames
- A primal-dual predictor-corrector interior-point method for symmetric cone programming with \(O (\sqrt{r} \log \epsilon^{-1})\) iteration complexity
- Several Jordan-algebraic aspects of optimization†
- New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- scientific article; zbMATH DE number 6847407 (Why is no real title available?)
- New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function
- A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization
- A long-step interior-point algorithm for symmetric cone Cartesian P_ ()-HLCP
- A weighted-path-following method for symmetric cone linear complementarity problems
- A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function
- A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
- Infeasible Mehrotra-type predictor-corrector interior-point algorithm for the Cartesian P_()-LCP over symmetric cones
- An infeasible full-NT step interior point algorithm for CQSCO
- Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
- A polynomial primal-dual affine scaling algorithm for symmetric conic optimization
- Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions
- Full Nesterov-Todd step feasible interior-point method for the Cartesian \(P_{\ast}(\kappa)\)-SCLCP
- A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function
- scientific article; zbMATH DE number 6285133 (Why is no real title available?)
- Implementation of infinite-dimensional interior-point method for solving multi-criteria linear-quadratic control problem
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
- A long-step primal--dual algorithm for the symmetric programming problem
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
- Polynomial time solvability of non-symmetric semidefinite programming
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Feasibility and solvability of Lyapunov-type linear programming over symmetric cones
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
This page was built for publication: A Jordan-algebraic approach to potential-reduction algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957309)
