Pages that link to "Item:Q4017641"

The following pages link to On the Solution of Large Quadratic Programming Problems with Bound Constraints (Q4017641):

Displaying 50 items.

• An active set algorithm for nonlinear optimization with polyhedral constraints (Q341314) (← links)
• Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization (Q344922) (← links)
• A new solver for the elastic normal contact problem using conjugate gradients, deflation, and an FFT-based preconditioner (Q348456) (← links)
• A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization (Q396257) (← links)
• The bound-constrained conjugate gradient method for non-negative matrices (Q463008) (← links)
• Large correlation analysis (Q547968) (← links)
• An accurate active set Newton algorithm for large scale bound constrained optimization. (Q548593) (← links)
• An active set strategy based on the multiplier function or the gradient. (Q622855) (← links)
• Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints (Q626646) (← links)
• A multivariate spectral projected gradient method for bound constrained optimization (Q629482) (← links)
• Numerical solutions of the \(m\)-membranes problem (Q635084) (← links)
• Modified active set projected spectral gradient method for bound constrained optimization (Q638841) (← links)
• An effective branch-and-bound algorithm for convex quadratic integer programming (Q715081) (← links)
• Impulse noise removal by an adaptive trust-region method (Q780152) (← links)
• Monotone projected gradient methods for large-scale box-constrained quadratic programming (Q862715) (← links)
• A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q870176) (← links)
• A projected Newton-CG method for nonnegative astronomical image deblurring (Q937181) (← links)
• Solving bound constrained optimization via a new nonmonotone spectral projected gradient method (Q941611) (← links)
• Sensitivity analysis of the strain criterion for multidimensional scaling (Q959142) (← links)
• A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
• An active set quasi-Newton method with projected search for bound constrained minimization (Q980100) (← links)
• An algorithm for the fast solution of symmetric linear complementarity problems (Q998634) (← links)
• Components identification based method for box constrained variational inequality problems with almost linear functions (Q1014895) (← links)
• A class of collinear scaling algorithms for bound-constrained optimization: Derivation and computational results (Q1026441) (← links)
• A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems (Q1321811) (← links)
• A new trust region algorithm for bound constrained minimization (Q1337095) (← links)
• A decomposition method for large-scale box constrained optimization (Q1644498) (← links)
• Error in the reconstruction of nonsparse images (Q1720910) (← links)
• Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (Q1754299) (← links)
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming (Q1770257) (← links)
• Nonmonotone strategy for minimization of quadratics with simple constraints. (Q1771833) (← links)
• On a gradient-based algorithm for sparse signal reconstruction in the signal/measurements domain (Q1793419) (← links)
• A neural network model with bounded-weights for pattern classification (Q1883892) (← links)
• An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems (Q1908927) (← links)
• Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization (Q1915809) (← links)
• A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines (Q1919811) (← links)
• An active set feasible method for large-scale minimization problems with bound constraints (Q1928749) (← links)
• Robust regression for mixed Poisson-Gaussian model (Q1989941) (← links)
• LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
• Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming (Q2156911) (← links)
• Phase-field numerical strategies for deviatoric driven fractures (Q2175069) (← links)
• An augmented Lagrangian filter method (Q2216190) (← links)
• ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration (Q2284080) (← links)
• A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization (Q2340521) (← links)
• A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization (Q2358024) (← links)
• Interior-point solver for large-scale quadratic programming problems with bound constraints (Q2370027) (← links)
• A class of collinear scaling algorithms for bound-constrained optimization: convergence theorems (Q2371881) (← links)
• Total variation-penalized Poisson likelihood estimation for ill-posed problems (Q2391072) (← links)
• A Mumford-Shah-type approach to simultaneous reconstruction and segmentation for emission tomography problems with Poisson statistics (Q2398393) (← links)
• Reconstruction of sparse signals in impulsive disturbance environments (Q2399059) (← links)