Lennin Mallma Ramirez

Dr. Lennin Mallma Ramirez

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2015 in European Journal of Operational Research
Verified
Journal Article
Closed access
EQErik Alex Papa Quiroz
Erik Alex Papa Quiroz
LRLennin Mallma Ramirez
Lennin Mallma Ramirez
POP.R. Oliveira
P.R. Oliveira

1 September 2023 in RAIRO - Operations Research
Verified
Journal Article
Open access
PDF file
LRLennin Mallma Ramirez
Lennin Mallma Ramirez
NMNelson Maculan
Nelson Maculan
AXAdilson Elias Xavier
Adilson Elias Xavier
VXVinicius Layter Xavier
Vinicius Layter Xavier
The dislocation hyperbolic augmented Lagrangian algorithm (DHALA) solves the nonconvex programming problem considering an update rule for its penalty parameter and considering a condition to ensure the complementarity condition. in this work, we ensure that the sequence generated by DHALA converges to a Karush-Kuhn-Tucker (KKT) point, and we present computational experiments to demonstrate the performance of our proposed algorithm.

1 January 2018 in RAIRO - Operations Research
Verified
Journal Article
Closed access
EQErik Alex Papa Quiroz
Erik Alex Papa Quiroz
LRLennin Mallma Ramirez
Lennin Mallma Ramirez
POP.R. Oliveira
P.R. Oliveira
In this paper we introduce an inexact proximal point algorithm using proximal distances for solving variational inequality problems when the mapping is pseudomonotone or quasimonotone. Under some natural assumptions we prove that the sequence generated by the algorithm is convergent for the pseudomonotone case and assuming an extra condition on the solution set we prove the convergence for the quasimonotone case. This approach unifies the results obtained by Auslender et al. [Math Oper. Res. 24 (1999) 644–688] and Brito et al. [J. Optim. Theory Appl. 154 (2012) 217–234] and extends the convergence properties for the class of φ-divergence distances and Bregman distances.

7 April 2017 in Journal of the Operations Research Society of China
Verified
Journal Article
Closed access
PDF file
LRLennin Mallma Ramirez
Lennin Mallma Ramirez
EQErik Alex Papa Quiroz
Erik Alex Papa Quiroz
POP. R. Oliveira
P. R. Oliveira

Verified
Closed access
EQE. A. Papa Quiroz
E. A. Papa Quiroz
LRLennin Mallma Ramirez
Lennin Mallma Ramirez
POP. R. Oliveira
P. R. Oliveira

29 February 2024 in An International Journal of Optimization and Control: Theories & Applications (IJOCTA)
Verified
Journal Article
Open access
PDF file
LRLennin Mallma Ramirez
Lennin Mallma Ramirez
NMNelson Maculan
Nelson Maculan
AXAdilson Elias Xavier
Adilson Elias Xavier
VXVinicius Layter Xavier
Vinicius Layter Xavier
The dislocation hyperbolic augmented Lagrangian algorithm (DHALA) is a new approach to the hyperbolic augmented Lagrangian algorithm (HALA). DHALA is designed to solve convex nonlinear programming problems. We guarantee that the sequence generated by DHALA converges towards a Karush-Kuhn-Tucker point. We are going to observe that DHALA has a slight computational advantage in solving the problems over HALA. Finally, we will computationally illustrate our theoretical results.