A full NT-step infeasible interior-point algorithm for semidefinite optimization
Year of publication: |
July-September 2017
|
---|---|
Authors: | Pirhaji, Mohammad ; Mansouri, Hosseino ; Zangiabadi, Maryam |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 51.2017, 3, p. 533-545
|
Subject: | Semidefinite optimization | infeasible interior-point method | convergence analysis | polynomial complexity | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices
Papp, Dávid, (2023)
-
Peyghami, M. Reza, (2016)
-
A rounding procedure for semidefinite optimization
Mohammad-Nezhad, Ali, (2019)
- More ...
-
How much is enough? : government subsidies in supporting green product development
Zolfagharinia, Hossein, (2023)
- More ...