A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function

DOI10.1007/s10852-013-9240-xzbMath1311.90179OpenAlexW1965104376MaRDI QIDQ483254

Behrouz Kheirfam

Publication date: 16 December 2014

Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-013-9240-x

zbMATH Keywords

interior-point algorithmsEuclidean Jordan algebrakernel functionsmonotone linear complementarity problem

Mathematics Subject Classification ID

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

Related Items

Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function ⋮ A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps ⋮ Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function ⋮ An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
• Monotone functions on formally real Jordan algebras
• 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
• Self-regular functions and new search directions for linear and semidefinite optimization
• Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
• A Mathematical View of Interior-Point Methods in Convex Optimization
• Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
• A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS
• A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
• 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
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Interior-point methods for CartesianP_*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions
• Full Nesterov–Todd step feasible interior-point method for the CartesianP_*(κ)-SCLCP
• Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
• A Jordan-algebraic approach to potential-reduction algorithms

This page was built for publication: A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function