A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization
From MaRDI portal
Publication:2176832
DOI10.1007/s40305-018-0219-1zbMath1449.90281OpenAlexW2895424070MaRDI QIDQ2176832
Ali Shojaeifard, Maryam Zangiabadi, Ali Nakhaei, Hossien Mansouri, Mohammad Pirhaji
Publication date: 5 May 2020
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-018-0219-1
polynomial complexitywide neighborhoodfeasible interior-point methodconvex quadratic semidefinite optimization
Cites Work
- Unnamed Item
- Unnamed Item
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A new polynomial-time algorithm for linear programming
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Extension of primal-dual interior point algorithms to symmetric cones
- A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
- A new second-order corrector interior-point algorithm for semidefinite programming
- A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
- Neighborhood-following algorithms for linear programming
- A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming
- A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite 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
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- 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 predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps
This page was built for publication: A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization
