A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
From MaRDI portal
Publication:483262
DOI10.1007/s10852-013-9246-4zbMath1305.65156OpenAlexW2006281441MaRDI QIDQ483262
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-9246-4
interior-point methodlinear complementarity problemkernel functionsymmetric coneEuclidean Jordan algebraCartesian \(P_ \ast({\kappa})\) property
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
A wide neighborhood predictor–corrector infeasible-interior-point method for Cartesian P∗(κ)-LCP over symmetric cones, A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity
Cites Work
- Unnamed Item
- Unnamed Item
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- A unified approach to interior point algorithms for linear complementary problems
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- On a commutative class of search directions for linear programming over symmetric cones
- Self-regular functions and new search directions for linear and semidefinite optimization
- Improved infeasible-interior-point algorithm for linear complementarity problerns
- Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
- Interior-point methods based on kernel functions for symmetric optimization
- A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS
- 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
- A Jordan-algebraic approach to potential-reduction algorithms
