On numerical testing of the regularity of semidefinite problems
This paper is devoted to study regularity of Semidefinite Programming (SDP) problems. Current methods for SDP rely on assumptions of regularity such as constraint qualifications and wellposedness. Absence of regularity may compromise characterization of optimality and algorithms may present numerica...
| Autor principal: | |
|---|---|
| Formato: | conferenceObject |
| Idioma: | eng |
| Publicado em: |
2016
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10773/16488 |
| País: | Portugal |
| Oai: | oai:ria.ua.pt:10773/16488 |