A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function
From MaRDI portal
Publication:6158944
Recommendations
- A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
- A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function
- A new predictor-corrector infeasible interior-point algorithm for linear optimization in a wide neighborhood
- A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization
- A second-order corrector infeasible interior-point method with one-norm wide neighborhood for symmetric optimization
Cites work
- scientific article; zbMATH DE number 3972641 (Why is no real title available?)
- scientific article; zbMATH DE number 4126998 (Why is no real title available?)
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization
- A corrector-predictor path-following method for second-order cone optimization
- A new \(O(\sqrt nL)\) iteration large-update primal-dual interior-point method for second-order cone programming
- A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
- A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with \(O(\sqrt{n}\log\frac{\text{Tr}(X^0S^0)}{\varepsilon})\) iteration complexity
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A new polynomial-time algorithm for linear programming
- A new predictor-collector algorithm for linear programming
- A new second-order corrector interior-point algorithm for \(P_\ast (\kappa)\)-LCP
- A new second-order corrector interior-point algorithm for semidefinite programming
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function
- A wide neighborhood second-order predictor-corrector interior-point algorithm for semidefinite optimization with modified corrector directions
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization
- Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
- Neighborhood-following algorithms for linear programming
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- On the Implementation of a Primal-Dual Interior Point Method
- Self-regular functions and new search directions for linear and semidefinite optimization
Cited in
(2)
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6158944)
