Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function

DOI10.1007/s12190-018-1187-7zbMath1418.90283OpenAlexW2802675821WikidataQ129834882 ScholiaQ129834882MaRDI QIDQ2317415

Hongmei Bi, Hong-Wei Liu, Wei-wei Wang

Publication date: 9 August 2019

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-018-1187-7

zbMATH Keywords

kernel functionsemidefinite optimizationexponential convexityfull Nesterov-Todd stepinfeasible interior-point algorithm

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infeasible interior-point methods for linear optimization based on large neighborhood
• Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
• A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
• Feasibility issues in a primal-dual interior-point method for linear programming
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• A primal-dual infeasible-interior-point algorithm for linear programming
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• A full-Newton step interior-point algorithm for linear optimization based on a finite barrier
• An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• A new infeasible interior-point algorithm with full step for linear optimization based on a simple function
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Practical Optimization
• On the Nesterov--Todd Direction in Semidefinite Programming
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Semidefinite Programming
• Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming
• 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: Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function