Leonardo M. Mito

Orcid: 0000-0003-2851-8285

According to our database¹, Leonardo M. Mito authored at least 10 papers between 2020 and 2026.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of four.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Links

On csauthors.net:

Bibliography

2026

A minimal face constant rank constraint qualification for reducible conic programming.

[BibT_eX]

[DOI]

Math. Program., January, 2026

2025

Exploiting cone approximations in an augmented Lagrangian method for conic optimization.

[BibT_eX]

[DOI]

Optim. Methods Softw., November, 2025

2024

Weak notions of nondegeneracy in nonlinear semidefinite programming.

[BibT_eX]

[DOI]

Math. Program., May, 2024

2023

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

[BibT_eX]

[DOI]

Math. Program., November, 2023

2022

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

[BibT_eX]

[DOI]

Optim. Lett., 2022

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

[BibT_eX]

[DOI]

Numer. Algorithms, 2022

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

[BibT_eX]

[DOI]

Numer. Algorithms, 2022

On Optimality Conditions for Nonlinear Conic Programming.

[BibT_eX]

[DOI]

Math. Oper. Res., 2022

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

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2022

2020

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

[BibT_eX]

[DOI]

Comput. Appl. Math., 2020

Leonardo M. Mito

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...