Linear semidefinite programming problems: regularisation and strong dual formulations
Regularisation consists in reducing a given optimisation problem to an equivalent form where certain regularity conditions, which guarantee the strong duality, are fulfilled. In this paper, for linear problems of semidefinite programming (SDP), we propose a regularisation procedure which is based on...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2021
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10773/30248 |
| País: | Portugal |
| Oai: | oai:ria.ua.pt:10773/30248 |