A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs
From MaRDI portal
Publication:4639138
DOI10.1080/02331934.2017.1401071zbMath1398.90182OpenAlexW2770140850MaRDI QIDQ4639138
No author found.
Publication date: 3 May 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2017.1401071
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints, An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs, An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints
Cites Work
- Unnamed Item
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood
- A polynomial arc-search interior-point algorithm for linear programming
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A polynomial arc-search interior-point algorithm for convex quadratic programming
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- A unified approach to interior point algorithms for linear complementary problems
- Extension of primal-dual interior point algorithms to symmetric cones
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
- Neighborhood-following algorithms for linear programming
- A wide neighborhood predictor–corrector infeasible-interior-point method for Cartesian P∗(κ)-LCP over symmetric cones
- A New Wide Neighborhood Primal-Dual Predictor-Corrector Interior-Point Method for Linear Programming
- Barrier Functions in Interior Point Methods
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones
- Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP∗(κ)-LCP over symmetric cones
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
