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

DOI10.1007/s11075-020-01033-1zbMath1476.90233OpenAlexW3095438095WikidataQ114224310 ScholiaQ114224310MaRDI QIDQ2048820

Naser Osmanpour, Mohammad Keyanpour, Behrouz Kheirfam

Publication date: 24 August 2021

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-020-01033-1

zbMATH Keywords

semidefinite optimizationpolynomial complexityinfeasible interior-point methodarc-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 ⋮ Unnamed Item

Uses Software

• SDPLIB
• SDPT3

Cites Work

• 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
• A polynomial arc-search interior-point algorithm for convex quadratic programming
• 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
• Semidefinite programming relaxations for semialgebraic problems
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• 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
• A primal-dual interior-point algorithm with arc-search for semidefinite programming
• An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
• Global Optimization with Polynomials and the Problem of Moments
• Latest Developments in the SDPA Family for Solving Large-Scale SDPs
• 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
• On the Implementation of a Primal-Dual Interior Point Method
• Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
• 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
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• SDPLIB 1.2, a library of semidefinite programming test problems
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• On the Convergence of the Central Path in Semidefinite Optimization
• An Interior-Point Method for Semidefinite Programming
• An Arc-search Interior Point Method in the 𝒩−∞ Neighborhood for Symmetric Optimization
• A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• Benchmarking optimization software with performance profiles.

This page was built for publication: An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood