Suivre
Daiana Oliveira dos Santos
Daiana Oliveira dos Santos
Federal University of São Paulo
Adresse e-mail validée de ime.usp.br
Titre
Citée par
Citée par
Année
Optimality conditions and global convergence for nonlinear semidefinite programming
R Andreani, G Haeser, DS Viana
Mathematical Programming 180, 203-235, 2020
432020
On a conjecture in second-order optimality conditions
R Behling, G Haeser, A Ramos, DS Viana
Journal of Optimization Theory and Applications 176, 625-633, 2018
212018
Optimality conditions for nonlinear second-order cone programming and symmetric cone programming
R Andreani, EH Fukuda, G Haeser, DO Santos, LD Secchin
Optimization online, 2019
20*2019
On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming
R Andreani, EH Fukuda, G Haeser, DO Santos, LD Secchin
Computational Optimization and Applications 79 (3), 633-648, 2021
142021
Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
R Andreani, G Haeser, LM Mito, H Ramírez, DO Santos, TP Silveira
Optimization Letters, 1-22, 2022
112022
An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem
EG Birgin, W Gómez, G Haeser, LM Mito, DO Santos
112019
Erratum to: New constraint qualifications and optimality conditions for second order cone programs
R Andreani, EH Fukuda, G Haeser, H Ramírez, DO Santos, PJS Silva, ...
Set-Valued and Variational Analysis, 1-5, 2020
62020
Condiçoes de otimalidade para otimizaçao cônica
DS Viana
Universidade de São Paulo, 2019
42019
A simple proof of existence of Lagrange multipliers
G Haeser, DO Santos
arXiv preprint arXiv:2402.05335, 2024
2024
Strong global convergence properties of algorithms for nonlinear symmetric cone programming
R Andreani, G Haeser, A Ramos, DO Santos, LD Secchin, A Serranoni
2024
LEITURAS DA METRÓPOLE A PARTIR DA CIDADE DE MAUÁ
J NUNES, DOS SANTOS
2019
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–11