Evaluating bound-constrained minimization software
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1694901 (Why is no real title available?)
- scientific article; zbMATH DE number 107545 (Why is no real title available?)
- A Limited Memory Algorithm for Bound Constrained Optimization
- A New Active Set Algorithm for Box Constrained Optimization
- Algorithm 778: L-BFGS-B
- Algorithm 813
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Benchmarking Derivative-Free Optimization Algorithms
- Benchmarking optimization software with performance profiles.
- CUTE
- CUTEr and SifDec
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Linux device drivers. Translared from the American original by Matthias Kalle Dalheimer
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- Remark on ``Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- Trust Region Methods
Cited in
(14)- On the global convergence of a general class of augmented Lagrangian methods
- A two-stage active-set algorithm for bound-constrained optimization
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- 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
- The use of quadratic regularization with a cubic descent condition for unconstrained optimization
- An active set feasible method for large-scale minimization problems with bound constraints
- Algebraic rules for quadratic regularization of Newton's method
- Algebraic rules for computing the regularization parameter of the Levenberg-Marquardt method
- On regularization and active-set methods with complexity for constrained optimization
- On the use of third-order models with fourth-order regularization for unconstrained optimization
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- A unified approach for smoothing approximations to the exact _1-penalty for inequality-constrained optimization
Describes a project that uses
Uses Software
This page was built for publication: Evaluating bound-constrained minimization software
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928747)
