A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP*(κ) horizontal linear complementarity problems over symmetric cones
From MaRDI portal
Publication:2790893
DOI10.1080/02331934.2015.1062011zbMath1370.90274OpenAlexW2223535329MaRDI QIDQ2790893
No author found.
Publication date: 8 March 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2015.1062011
Euclidean Jordan algebrasinterior-point methodssymmetric coneshorizontal linear complementarity problems
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function, Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations, A corrector-predictor interior-point method with new search direction for linear optimization, An infeasible full-NT step IPM for 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, A modified infeasible interior-point algorithm for P*(κ)-HLCP over symmetric cones
Cites Work
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
- Corrector-predictor methods for sufficient linear complementarity problems
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- Sufficient matrices and the linear complementarity problem
- A unified approach to interior point algorithms for linear complementary problems
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Similarity and other spectral relations for symmetric cones
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
- On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
- Equivaence between different formulations of the linear complementarity promblem
- Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- A Jordan-algebraic approach to potential-reduction algorithms
