An active set method for bound-constrained optimization

Cites Work

Unnamed Item
Unnamed Item
A limited memory quasi-Newton trust-region method for box constrained optimization
Algorithms for bound constrained quadratic programming problems
A class of methods for solving large, convex quadratic programs subject to box constraints
Estimation of the optimal constants and the thickness of thin films using unconstrained optimization
Representations of quasi-Newton matrices and their use in limited memory methods
A proportioning based algorithm with rate of convergence for bound constrained quadratic programming
Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
Large-scale active-set box-constrained optimization method with spectral projected gradients
On the convergence of projected gradient processes to singular critical points
LMBOPT: a limited memory method for bound-constrained optimization
CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
A two-stage active-set algorithm for bound-constrained optimization
On efficiently combining limited-memory and trust-region techniques
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
An effective algorithm for minimization
Minimization of functions having Lipschitz continuous first partial derivatives
A New Active Set Algorithm for Box Constrained Optimization
Algorithm 851
Projected gradient methods for linearly constrained problems
Two-Point Step Size Gradient Methods
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
On the Solution of Large Quadratic Programming Problems with Bound Constraints
Numerical Optimization
Box Constrained Quadratic Programming with Proportioning and Projections
Nonmonotone Spectral Projected Gradient Methods on Convex Sets
Projected Newton Methods for Optimization Problems with Simple Constraints
A Limited Memory Algorithm for Bound Constrained Optimization
A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
Gradient projection methods for quadratic programs and applications in training support vector machines
Algorithm 813
The cyclic Barzilai-–Borwein method for unconstrained optimization
Convergence Conditions for Ascent Methods
On Steepest Descent
The conjugate gradient method in extremal problems
Minimization algorithms based on supervisor and searcher cooperation

This page was built for publication: An active set method for bound-constrained optimization