Kernel-Based Interior-Point Methods for Cartesian P*(k)-Linear Complementarity Problems over Symmetric Cones
We present an interior point method for Cartesian P*(k)-Linear Complementarity Problems over Symmetric Cones (SCLCPs). The Cartesian P*(k)-SCLCPs have been recently introduced as the generalization of the more commonly known and more widely used monotone SCLCPs. The IPM is based on the barrier funct...
Main Author: | Goran Lešaja |
---|---|
Format: | Article |
Language: | English |
Published: |
Croatian Operational Research Society
2011-02-01
|
Series: | Croatian Operational Research Review |
Subjects: | |
Online Access: | http://hrcak.srce.hr/index.php?show=clanak&id_clanak_jezik=142164 |
Similar Items
-
An arc search interior-point algorithm for monotone linear complementarity problems over symmetric cones
by: Mohammad Pirhaji, et al.
Published: (2018-02-01) -
A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs
by: Ali Nakhaei Amroudi, et al.
Published: (2019-04-01) -
A full Nesterov-Todd step interior-point method for circular cone optimization
by: Behrouz Kheirfam
Published: (2016-01-01) -
A smoothing-type algorithm for solving inequalities under the order induced by a symmetric cone
by: Zhang Ying, et al.
Published: (2011-01-01) -
Long step homogeneous interior point algorithm for the p* nonlinear complementarity problems
by: Lešaja Goran
Published: (2002-01-01)