A wide neighbourhood primal-dual second-order corrector interior point algorithm for semidefinite optimization
From MaRDI portal
Publication:6151644
DOI10.1080/02331934.2022.2126283MaRDI QIDQ6151644FDOQ6151644
Authors: Fujian Duan, Xiangli Li 
Publication date: 11 March 2024
Published in: Optimization (Search for Journal in Brave)
Recommendations
- A new second-order corrector interior-point algorithm for semidefinite programming
- A wide neighborhood second-order predictor-corrector interior-point algorithm for semidefinite optimization with modified corrector directions
- A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood
- An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization
- A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization
interior-point methodspolynomial complexitysemidefinite optimizationsecond-order methodswide neighbourhood
Cites Work
- Title not available (Why is that?)
- Self-regular functions and new search directions for linear and semidefinite optimization
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
- A second-order mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming
- New interior point algorithms in linear programming
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- 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
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization
- A new primal-dual interior-point algorithm for semidefinite optimization
- A new second-order corrector interior-point algorithm for semidefinite programming
- A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
- A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
- A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming
- A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization
- A new wide neighborhood infeasible interior-point algorithm for semidefinite programming
This page was built for publication: A wide neighbourhood primal-dual second-order corrector interior point algorithm for semidefinite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151644)
