A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization

DOI10.1007/s10915-021-01609-6zbMath1476.90232OpenAlexW3194903226MaRDI QIDQ2050559

Behrouz Kheirfam

Publication date: 31 August 2021

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10915-021-01609-6

zbMATH Keywords

semidefinite optimizationpolynomial complexityinfeasible interior-point methodwide neighborhoodarc-search strategy

Mathematics Subject Classification ID

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

Related Items (2)

An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints ⋮ A polynomial time infeasible interior-point arc-search algorithm for convex optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A wide neighborhood infeasible-interior-point method with arc-search for linear programming
• A polynomial arc-search interior-point algorithm for linear programming
• Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
• A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
• Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
• First- and second-order methods for semidefinite programming
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
• On the extension of an arc-search interior-point algorithm for semidefinite optimization
• Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
• An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• On the Nesterov--Todd Direction in Semidefinite Programming
• Linear Matrix Inequalities in System and Control Theory
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• An Interior-Point Method for Semidefinite Programming
• An Arc-search Interior Point Method in the 𝒩−∞ Neighborhood for Symmetric Optimization
• Arc-Search Techniques for Interior-Point Methods
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization