Infeasible Mehrotra-type predictor-corrector interior-point algorithm for the Cartesian P_()-LCP over symmetric cones
From MaRDI portal
Publication:4979787
Recommendations
- Polynomial convergence of Mehrotra-type predictor-corrector algorithm for the Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
- Infeasible Mehrotra-type predictor-corrector algorithm for Cartesian \(P_\ast(\kappa )\) nonlinear complementarity problems over symmetric cones
- A predictor-corrector infeasible-interior-point method for the Cartesian \(P_\ast(\kappa)\)-LCP over symmetric cones with \(O\left( \sqrt{\mathrm{cond}(G)}(1+\kappa)^2 r\log \varepsilon^{-1} \right)\) iteration complexity
- A wide neighborhood predictor-corrector infeasible-interior-point method for Cartesian \(P_* (\kappa)\)-LCP over symmetric cones
- A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones
Cites work
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- A Jordan-algebraic approach to potential-reduction algorithms
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- A long-step primal--dual algorithm for the symmetric programming problem
- A unified approach to interior point algorithms for linear complementary problems
- An O(rL) infeasible interior-point algorithm for symmetric cone LCP via CHKS function
- Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- On Mehrotra-Type Predictor-Corrector Algorithms
- On a commutative class of search directions for linear programming over symmetric cones
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- On the Implementation of a Primal-Dual Interior Point Method
- On the Nesterov--Todd Direction in Semidefinite Programming
- On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Polynomial time second order mehrotra-type predictor--corrector algorithms
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
Cited in
(21)- A long-step interior-point algorithm for symmetric cone Cartesian \(P_\ast (\kappa)\)-HLCP
- Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
- On the \(P_*(\kappa)\) horizontal linear complementarity problems over Cartesian product of symmetric cones
- An infeasible full-NT step IPM for \(P_\ast(\kappa)\) horizontal linear complementarity problem over Cartesian product of symmetric cones
- A corrector-predictor interior-point algorithm for \(P_\ast(\kappa)\)-HLCPs over Cartesian product of symmetric cones
- A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones
- A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
- A wide neighborhood predictor-corrector infeasible-interior-point method for Cartesian \(P_* (\kappa)\)-LCP over symmetric cones
- A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones
- An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP
- 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
- An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones
- A wide neighborhood infeasible-interior-point method with arc-search for \(P_\ast (\kappa)\)-SCLCPs
- A modified infeasible interior-point algorithm for \(P_\ast(\kappa)\)-HLCP over symmetric cones
- scientific article; zbMATH DE number 1864507 (Why is no real title available?)
- scientific article; zbMATH DE number 6847407 (Why is no real title available?)
- An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs
- Polynomial convergence of Mehrotra-type predictor-corrector algorithm for the Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
- An O(rL) infeasible interior-point algorithm for symmetric cone LCP via CHKS function
- A predictor-corrector infeasible-interior-point method for the Cartesian \(P_\ast(\kappa)\)-LCP over symmetric cones with \(O\left( \sqrt{\mathrm{cond}(G)}(1+\kappa)^2 r\log \varepsilon^{-1} \right)\) iteration complexity
This page was built for publication: Infeasible Mehrotra-type predictor-corrector interior-point algorithm for the Cartesian \(P_\ast(\kappa)\)-LCP over symmetric cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4979787)
