A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
From MaRDI portal
Publication:607084
DOI10.1016/j.na.2010.07.036zbMath1203.90162OpenAlexW1987794910MaRDI QIDQ607084
Publication date: 19 November 2010
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2010.07.036
kernel functioniteration boundinterior-point algorithmlarge- and small-update methodssecond-order cone linear complementarity problem
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
A new non-interior continuation method for solving the second-order cone complementarity problem ⋮ A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones ⋮ Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity
Cites Work
- Unnamed Item
- Unnamed Item
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
- A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- 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
- Applications of second-order cone programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Extension of primal-dual interior point algorithms to symmetric cones
- Second-order cone programming
- A matrix-splitting method for symmetric affine second-order cone complementarity problems
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- Self-regular functions and new search directions for linear and semidefinite optimization
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
- Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- A Jordan-algebraic approach to potential-reduction algorithms
