A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function

DOI10.3934/NACO.2013.3.601MaRDI QIDQ380342zbMATH OpenOpenAlexFDO

Authors Behrouz Kheirfam

Publication date 13 November 2013

Published in Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/naco.2013.3.601

zbMATH Keywords

polynomial complexitykernel functionfull Nesterov-Todd stepinfeasible interior-point methods

Mathematics Subject Classification ID

Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function
• A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions
• Full-NT step infeasible interior-point method for SOCO based on a specific kernel function
• scientific article; zbMATH DE number 6285133
• A modified full-NT-step infeasible interior-point algorithm for SDP based on a specific kernel function

Cited in

(11)

• scientific article; zbMATH DE number 6285133 (Why is no real title available?)
• Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function
• A new infeasible interior-point method based on a non-coercive kernel function with improved centering steps for second-order cone optimization
• Full-NT step infeasible interior-point method for SOCO based on a specific kernel function
• An infeasible interior-point method for the \(P_*\)-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
• A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions
• A new search direction for full-Newton step infeasible interior-point method in linear optimization
• An infeasible full-NT step interior point algorithm for CQSCO
• A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps
• A modified full-NT-step infeasible interior-point algorithm for SDP based on a specific kernel function
• A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function

This page was built for publication: A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q380342)