LMLeandro Farias Maia
Leandro Farias Maia
*This is an algorithmically generated author record based on publicly available information.
Research Subjects
Research Interests
Leandro Farias Maia has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- David Huckleberry Gutman
Texas A&M University, College Station, United States
2 shared publications David H. Gutman
1 shared publication- Drew Philip Kouri
Optimization and Uncertainty Quantification, Sandia National Laboratories, Albuquerque, USA
1 shared publication Gilson N. Silva
1 shared publicationRenato D. C. Monteiro
1 shared publication- Robert Baraldi
Optimization and Uncertainty Quantification, Sandia National Laboratories, Albuquerque, USA
1 shared publication
Latest Publications
- Open Access
An Inexact Weighted Proximal Trust-Region Method
In [R. J. Baraldi and D. P. Kouri, Math. Program., 201:1 (2023), pp. 559-598], the authors introduced a trust-region method for minimizing the sum of a smooth nonconvex and a nonsmooth convex function, the latter of which has an analytical proximity operator. While many functions satisfy this criterion, e.g., the $\ell_1$-norm defined on $\ell_2$, many others are precluded by either the topology or the nature of the nonsmooth term. Using the $δ$-Fréchet subdifferential, we extend the definition of the inexact proximity operator and enable its use within the aforementioned trust-region algorithm. Moreover, we augment the analysis for the standard trust-region convergence theory to handle proximity operator inexactness with weighted inner products. We first introduce an algorithm to generate a point in the inexact proximity operator and then apply the algorithm within the trust-region method to solve an optimal control problem constrained by Burgers' equation.Open AccessAn Inexact Weighted Proximal Trust-Region Method
In [R. J. Baraldi and D. P. Kouri, Math. Program., 201:1 (2023), pp. 559-598], the authors introduced a trust-region method for minimizing the sum of a smooth nonconvex and a nonsmooth convex function, the latter of which has an analytical proximity operator. While many functions satisfy this criterion, e.g., the $\ell_1$-norm defined on $\ell_2$, many others are precluded by either the topology or the nature of the nonsmooth term. Using the $δ$-Fréchet subdifferential, we extend the definition of the inexact proximity operator and enable its use within the aforementioned trust-region algorithm. Moreover, we augment the analysis for the standard trust-region convergence theory to handle proximity operator inexactness with weighted inner products. We first introduce an algorithm to generate a point in the inexact proximity operator and then apply the algorithm within the trust-region method to solve an optimal control problem constrained by Burgers' equation. - 8 November 2024
- Published by Springer Nature in Optimization Letters
- Vol. 19 (1) , 1-20
The randomized block coordinate descent method in the Hölder smooth setting
- 8 November 2024
- Published by Springer Nature in Optimization Letters
- Vol. 19 (1) , 1-20
The randomized block coordinate descent method in the Hölder smooth setting
- 13 March 2024
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 201 (2) , 668-698
The Inexact Cyclic Block Proximal Gradient Method and Properties of Inexact Proximal Maps
- 13 March 2024
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 201 (2) , 668-698
The Inexact Cyclic Block Proximal Gradient Method and Properties of Inexact Proximal Maps