A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones
From MaRDI portal
Publication:6146961
DOI10.1080/02331934.2022.2098124MaRDI QIDQ6146961
Publication date: 15 January 2024
Published in: Optimization (Search for Journal in Brave)
Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Cites Work
- Unnamed Item
- Unnamed Item
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function
- Test example for nonlinear programming codes
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- On a homogeneous algorithm for the monotone complementarity problem
- A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones
- 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 Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
- On Mehrotra-Type Predictor-Corrector Algorithms
- On the Implementation of a Primal-Dual Interior Point Method
- Solving the Nonlinear Complementarity Problem by a Homotopy Method
- Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones
- 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
- Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P*(κ) nonlinear complementarity problems over symmetric cones
- Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP∗(κ)-LCP 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
This page was built for publication: A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones