VLDB 2026 Research / reviewers in the wild / expert
Ernesto G. Birgin
dblp:21/829
· DBLP profile ↗
10ranked-venue papers
7as first author
3since 2021 · last 2025
0000-0002-7466-7663ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 8 · 6 first-author · 2 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | A first-order regularized algorithm with complexity properties for the unconstrained and the convexly constrained low order-value optimization problem
G. Q. Álvarez, Ernesto G. Birgin, José Mario Martínez |
J. Glob. Optim. | 2 |
| 2023 | A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers
Ernesto G. Birgin, Oberlan Christo Romão, Débora P. Ronconi |
Expert Syst. Appl. | 1 |
| 2022 | On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
V. S. Amaral, Roberto Andreani, Ernesto G. Birgin, Diaulas S. Marcondes, José Mario Martínez |
J. Glob. Optim. | 3 |
| 2017 | A nonlinear programming model with implicit variables for packing ellipsoids
Ernesto G. Birgin, Rafael D. Lobato, José Mario Martínez |
J. Glob. Optim. | 1 |
| 2016 | Packing ellipsoids by nonlinear optimization
Ernesto G. Birgin, Rafael D. Lobato, José Mario Martínez |
J. Glob. Optim. | 1 |
| 2015 | Metaheuristics for large-scale instances of the linear ordering problem
Celso S. Sakuraba, Débora P. Ronconi, Ernesto G. Birgin, Mutsunori Yagiura |
Expert Syst. Appl. | 3 |
| 2014 | Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
Ernesto G. Birgin, José Mario Martínez, Leandro da Fonseca Prudente |
J. Glob. Optim. | 1 |
| 2011 | Low order-value approach for solving VaR-constrained optimization problems
Ernesto G. Birgin, Luis Felipe Bueno, Natasa Krejic, José Mario Martínez |
J. Glob. Optim. | 1 |
| 2010 | Continuous GRASP with a local active-set method for bound-constrained global optimization
Ernesto G. Birgin, Erico M. Gozzi, Mauricio G. C. Resende, Ricardo Martins de Abreu Silva |
J. Glob. Optim. | 1 |
| 2001 | Algorithm 813: SPG - Software for Convex-Constrained OptimizationabstractFortran 77 software implementing the SPG method is introduced. SPG is a nonmonotone projected gradient algorithm for solving large-scale convex-constrained optimization problems. It combines the classical projected gradient method with the spectral gradient choice of steplength and a nonmonotone line-search strategy. The user provides objective function and gradient values, and projections onto the feasible set. Some recent numerical tests are reported on very large location problems, indicating that SPG is substantially more efficient than existing general-purpose software on problems for which projections can be computed efficiently. Ernesto G. Birgin, José Mario Martínez, Marcos Raydan |
ACM Trans. Math. Softw. | 1 |