Evaluating bound-constrained minimization software
From MaRDI portal
Publication:1928747
DOI10.1007/s10589-012-9466-yzbMath1258.90067OpenAlexW2033337644MaRDI QIDQ1928747
Ernesto G. Birgin, Jan M. Gentil
Publication date: 4 January 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-012-9466-y
Related Items
A two-stage active-set algorithm for bound-constrained optimization, Algebraic rules for computing the regularization parameter of the Levenberg-Marquardt method, On the use of third-order models with fourth-order regularization for unconstrained optimization, An active set feasible method for large-scale minimization problems with bound constraints, A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization, On the construction of quadratic models for derivative-free trust-region algorithms, An active-set projected trust region algorithm for box constrained optimization problems, On Regularization and Active-set Methods with Complexity for Constrained Optimization, Algebraic rules for quadratic regularization of Newton's method, The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization, A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Remark on “algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization”
- A New Active Set Algorithm for Box Constrained Optimization
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- Algorithm 778: L-BFGS-B
- CUTE
- Trust Region Methods
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Limited Memory Algorithm for Bound Constrained Optimization
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- Benchmarking Derivative-Free Optimization Algorithms
- Algorithm 813
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- CUTEr and SifDec
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- Benchmarking optimization software with performance profiles.
