Leonardo M. Mito

According to our database, Leonardo M. Mito authored at least 8 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Weak notions of nondegeneracy in nonlinear semidefinite programming.

Roberto Andreani, Gabriel Haeser, Leonardo M. Mito, Héctor Ramírez

Math. Program., May, 2024

2023

First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition.

Roberto Andreani, Gabriel Haeser, Leonardo M. Mito, Héctor Ramírez, Paulo Silveira

Math. Program., November, 2023

2022

Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming.

Roberto Andreani, Gabriel Haeser, Leonardo M. Mito, Héctor Ramírez, Daiana O. Santos, Paulo Silveira

Optim. Lett., 2022

Correction to: On the best achievable quality of limit points of augmented Lagrangian schemes.

Roberto Andreani, Gabriel Haeser, Leonardo M. Mito, Alberto Ramos, Leonardo D. Secchin

Numer. Algorithms, 2022

On the best achievable quality of limit points of augmented Lagrangian schemes.

Roberto Andreani, Gabriel Haeser, Leonardo M. Mito, Alberto Ramos, Leonardo D. Secchin

Numer. Algorithms, 2022

On Optimality Conditions for Nonlinear Conic Programming.

Roberto Andreani, Walter Gómez, Gabriel Haeser, Leonardo M. Mito, Alberto Ramos

Math. Oper. Res., 2022

Global Convergence of Algorithms Under Constant Rank Conditions for Nonlinear Second-Order Cone Programming.

Roberto Andreani, Gabriel Haeser, Leonardo M. Mito, C. Héctor Ramírez, Paulo Silveira

J. Optim. Theory Appl., 2022

2020

An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem.

Ernesto G. Birgin, Walter Gómez, Gabriel Haeser, Leonardo M. Mito, Daiana O. Santos

Comput. Appl. Math., 2020