On the numerical solution of bound constrained optimization problems
From MaRDI portal
Recommendations
- New algorithms for maximization of concave functions with box constraints
- An active set strategy based on the multiplier function or the gradient.
- An active set limited memory BFGS algorithm for bound constrained optimization
- An accurate active set Newton algorithm for large scale bound constrained optimization.
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
Cited in
(11)- Nonmonotone strategy for minimization of quadratics with simple constraints.
- A comparison of solution approaches for the numerical treatment of or-constrained optimization problems
- A subspace-accelerated split Bregman method for sparse data recovery with joint _1-type regularizers
- A solver for nonconvex bound-constrained quadratic optimization
- Numerical experiments with algorithms for bound constrained quadratic programming in mechanics
- On regularization and active-set methods with complexity for constrained optimization
- A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables
- scientific article; zbMATH DE number 954686 (Why is no real title available?)
- A reduced-space algorithm for minimizing _1-regularized convex functions
- On the Numerical Solution of Constrained Least-Squares Problems
- On the stationarity for nonlinear optimization problems with polyhedral constraints
This page was built for publication: On the numerical solution of bound constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733676)
