A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization

DOI10.1080/00207160.2018.1545088zbMath1499.65234OpenAlexW2899684910MaRDI QIDQ5031729

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

Publication date: 16 February 2022

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2018.1545088

zbMATH Keywords

kernel functionsemidefinite optimizationpolynomial complexityfull-Newton stepinfeasible interior-point algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Interior-point methods (90C51)

Related Items (1)

An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood

Cites Work

• Unnamed Item
• Unnamed Item
• A full-Newton step interior-point algorithm based on modified Newton direction
• Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
• A modified infeasible-interior-point algorithm for linear optimization problems
• A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
• 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
• Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization
• A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
• A primal-dual infeasible-interior-point algorithm for linear programming
• Semidefinite programming relaxations for semialgebraic problems
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• Self-regular functions and new search directions for linear and semidefinite optimization
• Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization
• A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• Global Optimization with Polynomials and the Problem of Moments
• An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• On the Nesterov--Todd Direction in Semidefinite Programming
• Linear Matrix Inequalities in System and Control Theory
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Primal--Dual Path-Following Algorithms for Semidefinite 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
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• An Interior-Point Method for Semidefinite Programming
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

This page was built for publication: A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization