A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood
From MaRDI portal
Publication:2221151
DOI10.1007/s10915-020-01384-wzbMath1458.90507OpenAlexW3118554349MaRDI QIDQ2221151
Publication date: 26 January 2021
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-020-01384-w
semidefinite optimizationpolynomial complexityinfeasible interior-point methodwide neighborhoodsecond-order corrector
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization
- Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path
- A new polynomial-time algorithm for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- First- and second-order methods for semidefinite programming
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- A new second-order corrector interior-point algorithm for semidefinite programming
- A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function
- A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
- Neighborhood-following algorithms for linear programming
- A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
- 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
- Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Linear Matrix Inequalities in System and Control Theory
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite 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
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
