Pages that link to "Item:Q1928749"

The following pages link to An active set feasible method for large-scale minimization problems with bound constraints (Q1928749):

Displaying 10 items.

• A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization (Q396257) (← links)
• Dual approaches for a specific class of integer nonlinear programming problems (Q510937) (← links)
• Combinatorial optimal control of semilinear elliptic PDEs (Q721947) (← links)
• An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
• An augmented Lagrangian method exploiting an active-set strategy and second-order information (Q2139257) (← links)
• A novel projected gradient-like method for optimization problems with simple constraints (Q2190861) (← links)
• A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
• A two-stage active-set algorithm for bound-constrained optimization (Q2359771) (← links)
• A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares (Q2796799) (← links)
• Efficient Nonnegative Matrix Factorization Via Modified Monotone Barzilai-Borwein Method with Adaptive Step Sizes Strategy (Q6049032) (← links)