Ernesto G. Birgin

According to our database1, Ernesto G. Birgin authored at least 69 papers between 2000 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



Complexity and performance of an Augmented Lagrangian algorithm.
Optim. Methods Softw., 2020

On the use of third-order models with fourth-order regularization for unconstrained optimization.
Optim. Lett., 2020

Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact.
Math. Comput., 2020

Models for the two-dimensional rectangular single large placement problem with guillotine cuts and constrained pattern.
Int. Trans. Oper. Res., 2020

The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers.
Int. Trans. Oper. Res., 2020

Metaheuristics for the Online Printing Shop Scheduling Problem.
CoRR, 2020

Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem.
Comput. Oper. Res., 2020

A filtered beam search method for the <i>m</i>-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs.
Comput. Oper. Res., 2020

Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization.
Comput. Optim. Appl., 2020

A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids.
Eur. J. Oper. Res., 2019

A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization.
Comput. Optim. Appl., 2019

On Regularization and Active-set Methods with Complexity for Constrained Optimization.
SIAM J. Optim., 2018

On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors.
Math. Comput., 2018

Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points.
Comput. Optim. Appl., 2018

The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization.
SIAM J. Optim., 2017

On the minimization of possibly discontinuous functions by means of pointwise approximations.
Optim. Lett., 2017

Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models.
Math. Program., 2017

A nonlinear programming model with implicit variables for packing ellipsoids.
J. Glob. Optim., 2017

Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models.
SIAM J. Optim., 2016

Packing ellipsoids by nonlinear optimization.
J. Glob. Optim., 2016

Two-stage two-dimensional guillotine cutting stock problems with usable leftover.
Int. Trans. Oper. Res., 2016

On the application of an Augmented Lagrangian algorithm to some portfolio problems.
EURO J. Comput. Optim., 2016

Sequential equality-constrained optimization for nonlinear programming.
Comput. Optim. Appl., 2016

Assessing the reliability of general-purpose Inexact Restoration methods.
J. Comput. Appl. Math., 2015

Metaheuristics for large-scale instances of the linear ordering problem.
Expert Syst. Appl., 2015

List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility.
Eur. J. Oper. Res., 2015

Optimality properties of an Augmented Lagrangian method on infeasible problems.
Comput. Optim. Appl., 2015

A MILP model for an extended version of the Flexible Job Shop Problem.
Optim. Lett., 2014

MIP models for two-dimensional non-guillotine cutting problems with usable leftovers.
J. Oper. Res. Soc., 2014

Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming.
J. Glob. Optim., 2014

Practical augmented Lagrangian methods for constrained optimization.
Fundamentals of algorithms 10, SIAM, ISBN: 978-1-611-97335-8, 2014

Symmetry-breaking constraints for packing identical rectangles within polyhedra.
Optim. Lett., 2013

Packing circles within ellipses.
Int. Trans. Oper. Res., 2013

Deterministic and stochastic global optimization techniques for planar covering with ellipses problems.
Eur. J. Oper. Res., 2013

The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems.
Optim. Methods Softw., 2012

Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm.
J. Oper. Res. Soc., 2012

Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization.
Comput. Optim. Appl., 2012

Evaluating bound-constrained minimization software.
Comput. Optim. Appl., 2012

Outer Trust-Region Method for Constrained Optimization.
J. Optim. Theory Appl., 2011

Low order-value approach for solving VaR-constrained optimization problems.
J. Glob. Optim., 2011

Partial spectral projected gradient method with active-set strategy for linearly constrained optimization.
Numer. Algorithms, 2010

Global minimization using an Augmented Lagrangian method with variable lower-level constraints.
Math. Program., 2010

An effective recursive partitioning approach for the packing of identical rectangles in a rectangle.
J. Oper. Res. Soc., 2010

Continuous GRASP with a local active-set method for bound-constrained global optimization.
J. Glob. Optim., 2010

New and improved results for packing identical unitary radius circles within triangles, rectangles and strips.
Comput. Oper. Res., 2010

Comput. Optim. Appl., 2010

Second-order negative-curvature methods for box-constrained and general constrained optimization.
Comput. Optim. Appl., 2010

Orthogonal packing of identical rectangles within isotropic convex regions.
Comput. Ind. Eng., 2010

Dykstra's Algorithm and Robust Stopping Criteria.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Marcos Raydan: Spectral Projected Gradient Methods.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Practical Augmented Lagrangian Methods.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

PACKMOL: A package for building initial configurations for molecular dynamics simulations.
J. Comput. Chem., 2009

Improving ultimate convergence of an augmented Lagrangian method.
Optim. Methods Softw., 2008

Augmented Lagrangian methods under the constant positive linear dependence constraint qualification.
Math. Program., 2008

Minimizing the object dimensions in circle and sphere packing problems.
Comput. Oper. Res., 2008

Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization.
Comput. Optim. Appl., 2008

On Augmented Lagrangian Methods with General Lower-Level Constraints.
SIAM J. Optim., 2007

Method of sentinels for packing items within arbitrary convex regions.
J. Oper. Res. Soc., 2006

Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization.
Comput. Oper. Res., 2006

Robust Stopping Criteria for Dykstra's Algorithm.
SIAM J. Sci. Comput., 2005

A note on an <i>L</i>-approach for solving the manufacturer's pallet loading problem.
J. Oper. Res. Soc., 2005

Optimizing the packing of cylinders into a rectangular container: A nonlinear approach.
Eur. J. Oper. Res., 2005

Numerical Comparison of Augmented Lagrangian Algorithms for Nonconvex Problems.
Comput. Optim. Appl., 2005

Globally Convergent Inexact Quasi-Newton Methods for Solving Nonlinear Systems.
Numer. Algorithms, 2003

Solution of Bounded Nonlinear Systems of Equations Using Homotopies with Inexact Restoration.
Int. J. Comput. Math., 2003

Minimization subproblems and heuristics for an applied clustering problem.
Eur. J. Oper. Res., 2003

Large-Scale Active-Set Box-Constrained Optimization Method with Spectral Projected Gradients.
Comput. Optim. Appl., 2002

Algorithm 813: SPG - Software for Convex-Constrained Optimization.
ACM Trans. Math. Softw., 2001

Nonmonotone Spectral Projected Gradient Methods on Convex Sets.
SIAM J. Optim., 2000