Interior-point methods for Cartesian P_()-linear complementarity problems over symmetric cones based on the eligible kernel functions
From MaRDI portal
Publication:5200563
Recommendations
- Kernel-based interior-point methods for Cartesian P_*()-linear complementarity problems over symmetric cones
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- Unified analysis of kernel-based interior-point methods for P_*()-linear complementarity problems
Cites work
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
- A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
- A primal‐dual interior-point method for linear optimization based on a new proximity function
- 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 unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- An Interior-Point Method for Semidefinite Programming
- Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
- Automorphism Invariance of P- and GUS-Properties of Linear Transformations on Euclidean Jordan Algebras
- Barrier Functions in Interior Point Methods
- Conic convex programming and self-dual embedding
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
- Equivaence between different formulations of the linear complementarity promblem
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- New complexity analysis of the primal-dual Newton method for linear optimization
- On homogeneous and self-dual algorithms for LCP
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- 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∗
- Unified analysis of kernel-based interior-point methods for P_*()-linear complementarity problems
- VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
Cited in
(24)- A path following interior-point method for linear complementarity problems over circular cones
- A generalized smoothing Newton method for the symmetric cone complementarity problem
- A primal-dual large-update interior-point algorithm for P_*()-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
- The parameter-Newton iteration for the second-order cone linear complementarity problem
- New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP
- On the \(P_*(\kappa)\) horizontal linear complementarity problems over Cartesian product of symmetric cones
- Kernel-based interior-point methods for Cartesian P_*()-linear complementarity problems over symmetric cones
- An infeasible full-NT step IPM for P_() horizontal linear complementarity problem over Cartesian product of symmetric cones
- Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones
- A long-step interior-point algorithm for symmetric cone Cartesian P_ ()-HLCP
- 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
- 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_\ast(\kappa )\) nonlinear complementarity problems over symmetric cones
- Infeasible Mehrotra-type predictor-corrector algorithm for Cartesian \(P_\ast(\kappa )\) 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
- Adaptive full Newton-step infeasible interior-point method for sufficient horizontal LCP
- Full Nesterov-Todd step feasible interior-point method for the Cartesian \(P_{\ast}(\kappa)\)-SCLCP
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
- Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- New predictor-corrector algorithm for symmetric cone horizontal linear complementarity problems
- A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones
This page was built for publication: Interior-point methods for Cartesian \(P_{\ast}(\kappa)\)-linear complementarity problems over symmetric cones based on the eligible kernel functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200563)
