Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones

DOI10.1080/02331934.2018.1477942MaRDI QIDQ4559409zbMATH OpenOpenAlexFDO

Publication date 3 December 2018

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2018.1477942

complexity nonlinear complementarity problem symmetric cone interior point algorithm homogeneous algorithm

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

Recommendations

scientific article; zbMATH DE number 5564090
Complexities of homogeneous algorithm with one norm neighborhood for monotone nonlinear complementarity problems over symmetric cones
scientific article; zbMATH DE number 1059215
On a homogeneous algorithm for the monotone complementarity problem
scientific article; zbMATH DE number 30397
On the convergence of iterative methods for symmetric linear complementarity problems
Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems
Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
A wide neighborhood homogeneous algorithm for monotone nonlinear complementarity problems
On the complexity of a combined homotopy interior method for convex programming

Cites work

scientific article; zbMATH DE number 5564090 (Why is no real title available?)
scientific article; zbMATH DE number 715155 (Why is no real title available?)
A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones
An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function
An infeasible full-NT step IPM for \(P_\ast(\kappa)\) horizontal linear complementarity problem over Cartesian product of symmetric cones
Extension of primal-dual interior point algorithms to symmetric cones
Infeasible path-following interior point algorithm for Cartesian \(P_\ast(\kappa )\) nonlinear complementarity problems over symmetric cones
Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
Interior-point methods for Cartesian \(P_{\ast}(\kappa)\)-linear complementarity problems over symmetric cones based on the eligible kernel functions
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 a commutative class of search directions for linear programming over symmetric cones
On a homogeneous algorithm for the monotone complementarity problem
On the \(P_*(\kappa)\) horizontal linear complementarity problems over Cartesian product of symmetric cones
Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones

Cited in

(3)

A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones
scientific article; zbMATH DE number 5564090 (Why is no real title available?)
Complexities of homogeneous algorithm with one norm neighborhood for monotone nonlinear complementarity problems over symmetric cones

Describes a project that uses

Uses Software

SCCP

This page was built for publication: Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4559409)