An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function
From MaRDI portal
Publication:1048238
DOI10.1007/s10255-008-8814-2zbMath1205.90280OpenAlexW15943779MaRDI QIDQ1048238
Publication date: 11 January 2010
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-008-8814-2
monotonicitypolynomial complexitysymmetric cone linear complementarity probleminfeasible interior-point algorithm
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (7)
Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P*(κ) nonlinear complementarity problems over symmetric cones ⋮ A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS ⋮ Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones ⋮ A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones ⋮ Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects ⋮ Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones ⋮ Infeasible path-following interior point algorithm for Cartesian P*(κ) nonlinear complementarity problems over symmetric cones
Cites Work
- Unnamed Item
- Unnamed Item
- Some P-properties for linear transformations on Euclidean Jordan algebras
- A homogeneous model for mixed complementarity problems over symmetric cones
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- 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 polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques
- Jordan-algebraic aspects of nonconvex optimization over symmetric cones
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- 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
- A Jordan-algebraic approach to potential-reduction algorithms
This page was built for publication: An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function
