Adilson Elias Xavier
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Adilson Elias Xavier has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Nelson Maculan
Systems Engineering and Computer Science Program-Applied Mathematics (COPPE/IM), Federal University of Rio de Janeiro, Rio de Janeiro, Brazil
9 shared publications - Vinicius Layter Xavier
Departamento de Estatística, Instituto de Matemática e Estatística, Universidade do Rio de Janeiro, Rio de Janeiro 20550-900, Brazil
8 shared publications - Lennin Mallma Ramirez
Federal University of Rio de Janeiro & Systems Engineering and Computer Science Program (COPPE)
4 shared publications - Claudio M. Gesteira
Systems Engineering Program/COPPE/UFRJ, Centro de Tecnologia, Bloco H, Cidade Universitária, Rio de Janeiro, Brazil
2 shared publications - Esteban Segura
Univ Costa Rica, Escuela Matemat, CIMPA, San Jose, Costa Rica
2 shared publications - Fabio Dias Fagundez
Federal University of Rio de Janeiro
2 shared publications
Latest Publications
- 11 April 2024
- Published by Springer Nature in Boletín de la Sociedad Matemática Mexicana
- Vol. 30 (2) , 1-24
Duality in convex optimization for the hyperbolic augmented Lagrangian
- 11 April 2024
- Published by Springer Nature in Boletín de la Sociedad Matemática Mexicana
- Vol. 30 (2) , 1-24
Duality in convex optimization for the hyperbolic augmented Lagrangian
- Open Access
- 29 February 2024
- Published by AccScience Publishing in An International Journal of Optimization and Control: Theories & Applications (IJOCTA)
- Vol. 14 (2) , 147-155
Dislocation hyperbolic augmented Lagrangian algorithm in convex programming
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.
- 29 February 2024
- Published by AccScience Publishing in An International Journal of Optimization and Control: Theories & Applications (IJOCTA)
- Vol. 14 (2) , 147-155
Open AccessDislocation hyperbolic augmented Lagrangian algorithm in convex programming
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.
- Open Access
- 1 January 2024
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 31 (3) , 1021-1034
Dislocation Hyperbolic Kernel Function
A new kernel function is introduced in Mathematical Optimization. This function is called the dislocation hyperbolic kernel function. It is based on the dislocation hyperbolic function. Finally we present some applications of this new function.
- 1 January 2024
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 31 (3) , 1021-1034
Open AccessDislocation Hyperbolic Kernel Function
A new kernel function is introduced in Mathematical Optimization. This function is called the dislocation hyperbolic kernel function. It is based on the dislocation hyperbolic function. Finally we present some applications of this new function.
- Open Access
- 8 December 2023
- Published by Springer Nature
- p. 243-251
Fuzzy Clustering by Hyperbolic Smoothing
We propose a novel method for building fuzzy clusters of large data sets,using a smoothing numerical approach. The usual sum-of-squares criterion is relaxed so the search for good fuzzy partitions is made on a continuous space, rather than a combinatorial space as in classical methods [8]. The smoothing allows a conversion from a strongly non-differentiable problem into differentiable subproblems of optimization without constraints of low dimension, by using a differentiable function of infinite class. For the implementation of the algorithm, we used the statistical softwareRand the results obtained were compared to the traditional fuzzyC–means method, proposed by Bezdek [1].
- 8 December 2023
- Published by Springer Nature
- p. 243-251
Open AccessFuzzy Clustering by Hyperbolic Smoothing
We propose a novel method for building fuzzy clusters of large data sets,using a smoothing numerical approach. The usual sum-of-squares criterion is relaxed so the search for good fuzzy partitions is made on a continuous space, rather than a combinatorial space as in classical methods [8]. The smoothing allows a conversion from a strongly non-differentiable problem into differentiable subproblems of optimization without constraints of low dimension, by using a differentiable function of infinite class. For the implementation of the algorithm, we used the statistical softwareRand the results obtained were compared to the traditional fuzzyC–means method, proposed by Bezdek [1].
- Open Access
- 1 September 2023
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 57 (5) , 2941-2950
Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization
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 September 2023
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 57 (5) , 2941-2950
Open AccessDislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization
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.
- Open Access
Fuzzy Clustering by Hyperbolic Smoothing
We propose a novel method for building fuzzy clusters of large data sets, using a smoothing numerical approach. The usual sum-of-squares criterion is relaxed so the search for good fuzzy partitions is made on a continuous space, rather than a combinatorial space as in classical methods \cite{Hartigan}. The smoothing allows a conversion from a strongly non-differentiable problem into differentiable subproblems of optimization without constraints of low dimension, by using a differentiable function of infinite class. For the implementation of the algorithm we used the statistical software $R$ and the results obtained were compared to the traditional fuzzy $C$--means method, proposed by Bezdek.Open AccessFuzzy Clustering by Hyperbolic Smoothing
We propose a novel method for building fuzzy clusters of large data sets, using a smoothing numerical approach. The usual sum-of-squares criterion is relaxed so the search for good fuzzy partitions is made on a continuous space, rather than a combinatorial space as in classical methods \cite{Hartigan}. The smoothing allows a conversion from a strongly non-differentiable problem into differentiable subproblems of optimization without constraints of low dimension, by using a differentiable function of infinite class. For the implementation of the algorithm we used the statistical software $R$ and the results obtained were compared to the traditional fuzzy $C$--means method, proposed by Bezdek. - 1 March 2020
- Published by Elsevier in Knowledge-Based Systems
- Vol. 191, 105226
Accelerated hyperbolic smoothing method for solving the multisource Fermat–Weber and k-Median problems
- 1 March 2020
- Published by Elsevier in Knowledge-Based Systems
- Vol. 191, 105226
Accelerated hyperbolic smoothing method for solving the multisource Fermat–Weber and k-Median problems
- Open Access
- 1 June 2016
- Published by IOP Publishing in Environmental Research Letters
- Vol. 11 (6) , 064012
A model for the data extrapolation of greenhouse gas emissions in the Brazilian hydroelectric system
Home Search Collections Journals About Contact us My IOPscience You may also be interested in: Estimating greenhouse gas emissions from future Amazonian hydroelectric reservoirs Felipe A M de Faria, Paulina Jaramillo, Henrique O Sawakuchi et al. Enhanced greenhouse gas emission from exposed sediments along a hydroelectric reservoir during an extreme drought event Hyojin Jin, Tae Kyung Yoon, Seung-Hoon Lee et al. Greenhouse gas emissions from Brazil's Amazonian hydroelectric dams Philip M Fearnside How to quantify uncertainty and variability in life cycle assessment: the case of greenhouse gas emissions of gas power generation in the US M Hauck, Z J N Steinmann, I J Laurenzi et al. Whole farm quantification of GHG emissions within smallholder farms in developing countries Matthias Seebauer Impacts of European livestock production: nitrogen, sulphur, phosphorus and greenhouse gas emissions, land-use, water eutrophication and biodiversity Adrian Leip, Gilles Billen, Josette Garnier et al. An approach for verifying biogenic greenhouse gas emissions inventories with atmospheric CO2 concentration data Stephen M Ogle, Kenneth Davis, Thomas Lauvaux et al. A process-based model of methane consumption by upland soils A F Sabrekov, M V Glagolev, P K Alekseychik et al.
- 1 June 2016
- Published by IOP Publishing in Environmental Research Letters
- Vol. 11 (6) , 064012
Open AccessA model for the data extrapolation of greenhouse gas emissions in the Brazilian hydroelectric system
Home Search Collections Journals About Contact us My IOPscience You may also be interested in: Estimating greenhouse gas emissions from future Amazonian hydroelectric reservoirs Felipe A M de Faria, Paulina Jaramillo, Henrique O Sawakuchi et al. Enhanced greenhouse gas emission from exposed sediments along a hydroelectric reservoir during an extreme drought event Hyojin Jin, Tae Kyung Yoon, Seung-Hoon Lee et al. Greenhouse gas emissions from Brazil's Amazonian hydroelectric dams Philip M Fearnside How to quantify uncertainty and variability in life cycle assessment: the case of greenhouse gas emissions of gas power generation in the US M Hauck, Z J N Steinmann, I J Laurenzi et al. Whole farm quantification of GHG emissions within smallholder farms in developing countries Matthias Seebauer Impacts of European livestock production: nitrogen, sulphur, phosphorus and greenhouse gas emissions, land-use, water eutrophication and biodiversity Adrian Leip, Gilles Billen, Josette Garnier et al. An approach for verifying biogenic greenhouse gas emissions inventories with atmospheric CO2 concentration data Stephen M Ogle, Kenneth Davis, Thomas Lauvaux et al. A process-based model of methane consumption by upland soils A F Sabrekov, M V Glagolev, P K Alekseychik et al.
- 12 January 2016
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 50 (1) , 157-173
A geometric perspective of the Weiszfeld algorithm for solving the Fermat−Weber problem
The Fermat−Weber problem is a classical location problem that has the Weiszfeld algorithm as its main iterative solution method. This article presents a geometric interpretation of its local convergence for the particular case of three points, with the solution constrained to be an interior point, which is fundamental to the present geometric interpretation. This constraint, on the other hand, implies that the weights associated to each point must obey triangle inequalities. The eigenvalues analysis is developed considering that all weights have the same value, which simplifies calculation and explanation, but the generalization of this analysis is straightforward, as commented in the text. Step-size scaling is also considered for accelerating the convergence rate. The accompanying eigenvalues analysis determines step-size multiplier ranges that ensure convergence. Moreover, the eigenvalues depend on a parameter that is computed based on the sample points configuration.
- 12 January 2016
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 50 (1) , 157-173
A geometric perspective of the Weiszfeld algorithm for solving the Fermat−Weber problem
The Fermat−Weber problem is a classical location problem that has the Weiszfeld algorithm as its main iterative solution method. This article presents a geometric interpretation of its local convergence for the particular case of three points, with the solution constrained to be an interior point, which is fundamental to the present geometric interpretation. This constraint, on the other hand, implies that the weights associated to each point must obey triangle inequalities. The eigenvalues analysis is developed considering that all weights have the same value, which simplifies calculation and explanation, but the generalization of this analysis is straightforward, as commented in the text. Step-size scaling is also considered for accelerating the convergence rate. The accompanying eigenvalues analysis determines step-size multiplier ranges that ensure convergence. Moreover, the eigenvalues depend on a parameter that is computed based on the sample points configuration.
- 9 November 2014
- Published by Springer Nature in Journal of Heuristics
- Vol. 22 (4) , 649-664
Flying elephants: a general method for solving non-differentiable problems
- 9 November 2014
- Published by Springer Nature in Journal of Heuristics
- Vol. 22 (4) , 649-664
Flying elephants: a general method for solving non-differentiable problems