A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization

From MaRDI portal
Publication:378264

DOI10.1007/s10957-013-0278-8zbMath1274.90496OpenAlexW2022488470MaRDI QIDQ378264

Mohammad Hasan, H. S. Yoon

Publication date: 11 November 2013

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-013-0278-8



Related Items

An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones, A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ−1) iteration complexity, A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs, A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming, A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization, Two wide neighborhood interior-point methods for symmetric cone optimization, An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization, A class of new search directions for full-NT step feasible interior point method in semidefinite optimization, A primal-dual interior-point method for optimal grasping manipulation of multi-fingered hand-arm robots, A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones, Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization, A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP*(κ) horizontal linear complementarity problems over symmetric cones, A New Infeasible Interior-Point Method Based on a Non-Coercive Kernel Function with Improved Centering Steps for Second-Order Cone Optimization, A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function, New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization, A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity, Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization, Primal-dual interior-point algorithms for convex quadratic circular cone optimization



Cites Work