The following pages link to Ernesto G. Birgin (Q65722):
Displaying 50 items.
- Secant Acceleration of Sequential Residual Methods for Solving Large-Scale Nonlinear Systems of Equations (Q65749) (← links)
- dfsaneacc (Q65750) (← links)
- (Q194916) (redirect page) (← links)
- On the application of an augmented Lagrangian algorithm to some portfolio problems (Q285925) (← links)
- Packing ellipsoids by nonlinear optimization (Q312475) (← links)
- List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility (Q320008) (← links)
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization (Q429499) (← links)
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (Q526842) (← links)
- Outer trust-region method for constrained optimization (Q637557) (← links)
- Low order-value approach for solving var-constrained optimization problems (Q656968) (← links)
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points (Q683332) (← links)
- Continuous GRASP with a local active-set method for bound-constrained global optimization (Q708907) (← links)
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Q742114) (← links)
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization (Q849145) (← links)
- Local convergence of an inexact-restoration method and numerical experiments (Q850815) (← links)
- Estimation of the optimal constants and the thickness of thin films using unconstrained optimization (Q1306089) (← links)
- Globally convergent inexact quasi-Newton methods for solving nonlinear systems (Q1397929) (← links)
- Estimation of optical parameters of very thin films (Q1412335) (← links)
- Constrained optimization with integer and continuous variables using inexact restoration and projected gradients (Q1653960) (← links)
- On the minimization of possibly discontinuous functions by means of pointwise approximations (Q1686551) (← links)
- Large-scale active-set box-constrained optimization method with spectral projected gradients (Q1812088) (← links)
- Minimization subproblems and heuristics for an applied clustering problem (Q1869508) (← links)
- Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate. (Q1872927) (← links)
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach (Q1887860) (← links)
- Evaluating bound-constrained minimization software (Q1928747) (← links)
- Global minimization using an augmented Lagrangian method with variable lower-level constraints (Q1960193) (← links)
- On the solution of linearly constrained optimization problems by means of barrier algorithms (Q1979175) (← links)
- A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids (Q1991149) (← links)
- Metaheuristics for the online printing shop scheduling problem (Q2030284) (← links)
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
- Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients (Q2114826) (← links)
- Inexact restoration for derivative-free expensive function minimization and applications (Q2122038) (← links)
- Block coordinate descent for smooth nonconvex constrained minimization (Q2162523) (← links)
- On the use of third-order models with fourth-order regularization for unconstrained optimization (Q2182770) (← links)
- On constrained optimization with nonconvex regularization (Q2225521) (← links)
- Deterministic and stochastic global optimization techniques for planar covering with ellipses problems (Q2253403) (← links)
- Assessing the reliability of general-purpose inexact restoration methods (Q2255712) (← links)
- An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem (Q2301011) (← links)
- A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs (Q2337385) (← links)
- Optimality properties of an augmented Lagrangian method on infeasible problems (Q2352419) (← links)
- Sequential equality-constrained optimization for nonlinear programming (Q2374366) (← links)
- Second-order negative-curvature methods for box-constrained and general constrained optimization (Q2379692) (← links)
- A nonlinear programming model with implicit variables for packing ellipsoids (Q2399478) (← links)
- A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization (Q2419564) (← links)
- A MILP model for an extended version of the flexible job shop problem (Q2448209) (← links)
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification (Q2467167) (← links)
- Minimizing the object dimensions in circle and sphere packing problems (Q2468491) (← links)
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization (Q2479826) (← links)
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems (Q2487472) (← links)
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization (Q2496055) (← links)
