On theP*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones
From MaRDI portal
Publication:2815503
DOI10.1080/10556788.2015.1058795zbMath1368.90182OpenAlexW2201446621MaRDI QIDQ2815503
No author found.
Publication date: 29 June 2016
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2015.1058795
horizontal linear complementarity problemEuclidean Jordan algebracentral trajectoryCartesian product of symmetric conessufficient linear operator
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, Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones, Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations, 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, Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones, A generalized direction in interior point method for monotone linear complementarity problems, A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP, A Mehrotra type predictor-corrector interior-point algorithm for linear programming, A modified infeasible interior-point algorithm for P*(κ)-HLCP over symmetric cones, On sufficient properties of sufficient matrices, Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction
Cites Work
- Unnamed Item
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A new polynomial-time algorithm for linear programming
- 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
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
- VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Equivaence between different formulations of the linear complementarity promblem
- Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones
- Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
