A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function
From MaRDI portal
Publication:6158944
DOI10.22049/cco.2021.27044.1185zbMath1524.90341OpenAlexW3183607058MaRDI QIDQ6158944
Unnamed Author, Behrouz Kheirfam
Publication date: 1 June 2023
Full work available at URL: http://comb-opt.azaruniv.ac.ir/article_14173_1df6e96dade6e38c933045a9f35f95f2.pdf
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
- A new polynomial-time algorithm for linear programming
- Self-regular functions and new search directions for linear and semidefinite optimization
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- A new second-order corrector interior-point algorithm for semidefinite programming
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization
- A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function
- Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization
- A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
- Neighborhood-following algorithms for linear programming
- A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming
- A corrector–predictor path-following method for second-order cone optimization
- A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
- On the Implementation of a Primal-Dual Interior Point Method
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood
- A Wide Neighborhood Second-order Predictor-corrector Interior-point Algorithm for Semidefinite Optimization with Modified Corrector Directions
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
- A new second-order corrector interior-point algorithm for P*(k)-LCP
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
This page was built for publication: A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function