Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions

DOI10.1080/10556788.2012.670858zbMath1254.90256OpenAlexW1977067945MaRDI QIDQ5200563

Goran Lešaja, De-Tong Zhu, Guo-Qiang Wang

Publication date: 6 November 2012

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2012.670858

zbMATH Keywords

interior-point methodlinear complementarity problempolynomial complexityEuclidean Jordan algebras and symmetric conesbarrier and kernel functionsCartesian \(P_{\ast}(\kappa)\)-property

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (21)

Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P_*(κ) nonlinear complementarity problems over symmetric cones ⋮ Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function ⋮ The parameter-Newton iteration for the second-order cone linear complementarity problem ⋮ A path following interior-point method for linear complementarity problems over circular cones ⋮ Full Nesterov–Todd step feasible interior-point method for the CartesianP_*(κ)-SCLCP ⋮ Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones ⋮ A generalized smoothing Newton method for the symmetric cone complementarity problem ⋮ A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP 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 ⋮ New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP ⋮ A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions ⋮ Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones ⋮ 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 ⋮ A long-step interior-point algorithm for symmetric cone Cartesian P_*(κ)-HLCP ⋮ A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions ⋮ Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP ⋮ On theP_*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction ⋮ Infeasible path-following interior point algorithm for Cartesian P_*(κ) nonlinear complementarity problems over symmetric cones

Cites Work

• Unnamed Item
• A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
• Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
• A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
• On homogeneous and self-dual algorithms for LCP
• 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
• Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions
• A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
• A superquadratic infeasible-interior-point method for linear complementarity problems
• A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
• Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
• Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
• VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp^∗
• Barrier Functions in Interior Point Methods
• A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
• Equivaence between different formulations of the linear complementarity promblem
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• A primal‐dual interior-point method for linear optimization based on a new proximity function
• Conic convex programming and self-dual embedding
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• An Interior-Point Method for Semidefinite Programming
• Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
• Automorphism Invariance of P- and GUS-Properties of Linear Transformations on Euclidean Jordan Algebras
• 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
• New complexity analysis of the primal-dual Newton method for linear optimization

This page was built for publication: Interior-point methods for CartesianP_*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions