Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones

DOI10.1007/s11425-008-0174-0zbMath1237.90235OpenAlexW2009345006MaRDI QIDQ1043012

Nai-Hua Xiu, Ziyan Luo

Publication date: 7 December 2009

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-008-0174-0

zbMATH Keywords

complexityglobal convergencesymmetric cone linear complementarity problemCartesian \(P_{*}(\kappa )\)-propertypath-following interior point algorithm

Mathematics Subject Classification ID

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

Related Items

Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP, A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP, An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization, A path following interior-point method for linear complementarity problems over circular cones, A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ⁻¹) iteration complexity, 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, Two wide neighborhood interior-point methods for symmetric cone optimization, An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs, A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming, A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem, Half thresholding eigenvalue algorithm for semidefinite matrix completion, A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones, A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones, A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems 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, A new projected Barzilai-Borwein method for the symmetric cone complementarity problem, A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones, A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming, A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs, A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones, A long-step interior-point algorithm for symmetric cone Cartesian P_*(κ)-HLCP, A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems, A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization, A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP_*(κ) horizontal linear complementarity problems over symmetric cones, Interior-point methods for CartesianP_*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions, Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects, A modified infeasible interior-point algorithm for P*(κ)-HLCP over symmetric cones, 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, A wide neighborhood predictor–corrector infeasible-interior-point method for Cartesian P∗(κ)-LCP over symmetric cones, Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP_*(κ)-LCP Over Symmetric Cones, Unnamed Item, A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity, An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function, Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP_∗(κ)-LCP over symmetric cones, Infeasible path-following interior point algorithm for Cartesian P_*(κ) nonlinear complementarity problems over symmetric cones, A smoothing Newton method for symmetric cone complementarity problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A homogeneous model for mixed complementarity problems over symmetric cones
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
• 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
• On implementing a primal-dual interior-point method for conic quadratic optimization
• On a commutative class of search directions for linear programming over symmetric cones
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
• Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
• Jordan-algebraic aspects of nonconvex optimization over symmetric cones
• Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
• An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints
• Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
• An Interior‐Point Trust‐Region Algorithm for General Symmetric Cone Programming
• Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
• A long-step primal--dual algorithm for the symmetric programming problem