A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones
From MaRDI portal
Publication:1743538
DOI10.1007/s10957-017-1194-0zbMath1384.90109OpenAlexW2770189235MaRDI QIDQ1743538
Publication date: 13 April 2018
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-017-1194-0
nonlinear complementarity problemsymmetric conepredictor correctorinterior point algorithmnonmonotoneinfeasible
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
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
Cites Work
- Unnamed Item
- Unnamed Item
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- A new path-following algorithm for nonlinear \(P_*\) complementarity problems
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- Test example for nonlinear programming codes
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Predictor-corrector method for nonlinear complementarity problems
- Extension of primal-dual interior point algorithms to symmetric cones
- On a homogeneous algorithm for the monotone complementarity problem
- On a commutative class of search directions for linear programming over symmetric cones
- Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions
- Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems.
- Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
- On Mehrotra-Type Predictor-Corrector Algorithms
- Computational complexity of LCPs associated with positive definite symmetric matrices
- On the Implementation of a Primal-Dual Interior Point Method
- Solving the Nonlinear Complementarity Problem by a Homotopy Method
- Iterative methods for linear complementarity problems with upperbounds on primary variables
- Infeasible path-following interior point algorithm for Cartesian P*(κ) nonlinear complementarity problems over symmetric cones
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
