A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization (Q5238196)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7122799

Language	Label	Description	Also known as
English	A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization	scientific article; zbMATH DE number 7122799

Statements

scholarly article

0 references

A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization (English)

0 references

Behrouz Kheirfam

0 references

0 references

publication date

28 October 2019

0 references

zbMATH Keywords

semidefinite optimization

0 references

wide neighbourhood

0 references

interior-point method

0 references

iteration complexity bound

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/02331934.2019.1591405

0 references

Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization

0 references

Linear Matrix Inequalities in System and Control Theory

0 references

0 references

0 references

Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices

0 references

Self-Scaled Barriers and Interior-Point Methods for Convex Programming

0 references

Primal-Dual Interior-Point Methods for Self-Scaled Cones

0 references

Primal--Dual Path-Following Algorithms for Semidefinite Programming

0 references

Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions

0 references

First- and second-order methods for semidefinite programming

0 references

A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming

0 references

Aspects of semidefinite programming. Interior point algorithms and selected applications

0 references

An <i>O</i>$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP

0 references

A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity

0 references

A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming

0 references

Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity

0 references

A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood

0 references

Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood

0 references

On the Convergence of the Central Path in Semidefinite Optimization

0 references

A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming

0 references

On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming

0 references

Identifiers

zbMATH Open document ID

0 references

10.1080/02331934.2019.1591405

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5238196

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5238196&oldid=36533443"