Numerical study of regularity in semidefinite programming and applications
This thesis is devoted to the study of regularity in semidefinite programming (SDP), an important area of convex optimization with a wide range of applications. The duality theory, optimality conditions and methods for SDP rely on certain assumptions of regularity that are not always satisfied. Abse...
| Autor principal: | |
|---|---|
| Formato: | doctoralThesis |
| Idioma: | eng |
| Publicado em: |
2016
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10773/16278 |
| País: | Portugal |
| Oai: | oai:ria.ua.pt:10773/16278 |