A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
From MaRDI portal
Publication:1646672
DOI10.1007/s11075-017-0387-9zbMath1395.90240OpenAlexW2763458913MaRDI QIDQ1646672
Publication date: 25 June 2018
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-017-0387-9
Related Items (6)
An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization ⋮ A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming ⋮ An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs ⋮ Novel design of morlet wavelet neural network for solving second order Lane-Emden equation ⋮ A discrete dynamics approach to sparse calculation and applied in ontology science ⋮ A smoothing Levenberg-Marquardt method for the complementarity problem over symmetric cone.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
- A new polynomial-time algorithm for linear programming
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- Extension of primal-dual interior point algorithms to symmetric cones
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
- 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 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 Nesterov--Todd Direction in Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- A Jordan-algebraic approach to potential-reduction algorithms
This page was built for publication: A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
