Full-NT step infeasible interior-point method for SOCO based on a specific kernel function

DOI10.1007/s13370-013-0134-xzbMath1303.65045OpenAlexW1964217543MaRDI QIDQ471570

J. Herrera, Sumit K. Garg

Publication date: 17 November 2014

Published in: Afrika Matematika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13370-013-0134-x

zbMATH Keywords

kernel functioniteration boundJordan algebrasecond-order conic optimizationfull Nesterov-Todd stepinfeasible interior-point methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Interior-point methods (90C51)

Related Items (2)

A New Infeasible Interior-Point Method Based on a Non-Coercive Kernel Function with Improved Centering Steps for Second-Order Cone Optimization ⋮ New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
• Extension of primal-dual interior point algorithms to symmetric cones
• Self-regular functions and new search directions for linear and semidefinite optimization
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

This page was built for publication: Full-NT step infeasible interior-point method for SOCO based on a specific kernel function