Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-2894
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence ; volume:74 ; number:2 ; day:22 ; month:5 ; year:2019 ; pages:583-621 ; date:11.2019
Computational optimization and applications ; 74, Heft 2 (22.5.2019), 583-621, 11.2019
- Creator
-
Sim, Chee-Khian
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10589-019-00110-z
- URN
-
urn:nbn:de:101:1-2020020220140845701122
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:53 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Sim, Chee-Khian
- SpringerLink (Online service)
Other Objects (12)
Lining up a positive semi-definite six-point bootstrap
Automatic positive semi-definite HAC covariance matrix and GMM estimation
Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming
Estimates for the condition numbers of large semi-definite Toeplitz matrices
Solving clustered low-rank semidefinite programs arising from polynomial optimization
An Interior Point-Proximal Method of Multipliers for Linear Positive Semi-Definite Programming
Predictive control using semi-definite programming - efficient approaches for periodic systems and Luré systems
Positive semi-definite variants of CBM4 and CBM05 chemistry schemes for atmospheric composition models
Symmetries in semidefinite and polynomial optimization: relaxations, combinatorics, and the degree principle
Semidefinite games
Characterizations of Herglotz–Nevanlinna Functions Using Positive Semi-Definite Functions and the Nevanlinna Kernel in Several Variables
Semidefinite lineare Komplementärprobleme
Lining up a positive semi-definite six-point bootstrap
Automatic positive semi-definite HAC covariance matrix and GMM estimation
Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming
Estimates for the condition numbers of large semi-definite Toeplitz matrices
Solving clustered low-rank semidefinite programs arising from polynomial optimization
An Interior Point-Proximal Method of Multipliers for Linear Positive Semi-Definite Programming
Predictive control using semi-definite programming - efficient approaches for periodic systems and Luré systems
Positive semi-definite variants of CBM4 and CBM05 chemistry schemes for atmospheric composition models
Symmetries in semidefinite and polynomial optimization: relaxations, combinatorics, and the degree principle
Semidefinite games
Characterizations of Herglotz–Nevanlinna Functions Using Positive Semi-Definite Functions and the Nevanlinna Kernel in Several Variables
Semidefinite lineare Komplementärprobleme
Lining up a positive semi-definite six-point bootstrap
Automatic positive semi-definite HAC covariance matrix and GMM estimation
Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming
Estimates for the condition numbers of large semi-definite Toeplitz matrices
Solving clustered low-rank semidefinite programs arising from polynomial optimization
An Interior Point-Proximal Method of Multipliers for Linear Positive Semi-Definite Programming
Predictive control using semi-definite programming - efficient approaches for periodic systems and Luré systems
Positive semi-definite variants of CBM4 and CBM05 chemistry schemes for atmospheric composition models
Symmetries in semidefinite and polynomial optimization: relaxations, combinatorics, and the degree principle
Semidefinite games
Characterizations of Herglotz–Nevanlinna Functions Using Positive Semi-Definite Functions and the Nevanlinna Kernel in Several Variables