On the Solution of Large Quadratic Programming Problems with Bound Constraints
From MaRDI portal
Publication:4017641
DOI10.1137/0801008zbMath0752.90053OpenAlexW2026289804MaRDI QIDQ4017641
Gerardo Toraldo, Jorge J. Moré
Publication date: 16 January 1993
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0801008
conjugate gradient methodobstacle problemgradient projection methodelastic-plastic torsion problemjournal bearing problems
Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization, A new trust region algorithm for bound constrained minimization, A neural network model with bounded-weights for pattern classification, Interior-point solver for large-scale quadratic programming problems with bound constraints, An MCMC method for uncertainty quantification in nonnegativity constrained inverse problems, A class of collinear scaling algorithms for bound-constrained optimization: convergence theorems, On the convergence of an active-set method for ℓ1minimization, A Solver for Nonconvex Bound-Constrained Quadratic Optimization, LMBOPT: a limited memory method for bound-constrained optimization, A decomposition method for large-scale box constrained optimization, Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming, Total variation-penalized Poisson likelihood estimation for ill-posed problems, An active set algorithm for nonlinear optimization with polyhedral constraints, Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization, Monotone projected gradient methods for large-scale box-constrained quadratic programming, An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, A new solver for the elastic normal contact problem using conjugate gradients, deflation, and an FFT-based preconditioner, A Mumford-Shah-type approach to simultaneous reconstruction and segmentation for emission tomography problems with Poisson statistics, Reconstruction of sparse signals in impulsive disturbance environments, A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization, Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization, A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines, Phase-field numerical strategies for deviatoric driven fractures, A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds, An active set feasible method for large-scale minimization problems with bound constraints, A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization, A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions, Using Krylov subspace and spectral methods for solving complementarity problems in many-body contact dynamics simulation, An active set strategy based on the multiplier function or the gradient., On the stationarity for nonlinear optimization problems with polyhedral constraints, Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints, A multivariate spectral projected gradient method for bound constrained optimization, MCMC Algorithms for Computational UQ of Nonnegativity Constrained Linear Inverse Problems, Numerical solutions of the \(m\)-membranes problem, Modified active set projected spectral gradient method for bound constrained optimization, Convergence of the EDIIS Algorithm for Nonlinear Equations, An augmented Lagrangian filter method, The bound-constrained conjugate gradient method for non-negative matrices, Error in the reconstruction of nonsparse images, An accurate active set conjugate gradient algorithm with project search for bound constrained optimization, A projected Newton-CG method for nonnegative astronomical image deblurring, A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization, Solving bound constrained optimization via a new nonmonotone spectral projected gradient method, A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization, Tikhonov regularized Poisson likelihood estimation: theoretical justification and a computational method, Robust regression for mixed Poisson-Gaussian model, PNKH-B: A Projected Newton--Krylov Method for Large-Scale Bound-Constrained Optimization, Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm, Sensitivity analysis of the strain criterion for multidimensional scaling, A coordinate gradient descent method for nonsmooth separable minimization, Large correlation analysis, An accurate active set Newton algorithm for large scale bound constrained optimization., Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming, Nonmonotone strategy for minimization of quadratics with simple constraints., An active set quasi-Newton method with projected search for bound constrained minimization, On using exterior penalty approaches for solving linear programming problems, An effective branch-and-bound algorithm for convex quadratic integer programming, A filter-trust-region method for simple-bound constrained optimization, A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables, Projected Barzilai–Borwein method for large-scale nonnegative image restoration, ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration, An algorithm for the fast solution of symmetric linear complementarity problems, On a gradient-based algorithm for sparse signal reconstruction in the signal/measurements domain, Flexible complementarity solvers for large-scale applications, Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization, Components identification based method for box constrained variational inequality problems with almost linear functions, Modulus-Type Inner Outer Iteration Methods for Nonnegative Constrained Least Squares Problems, A class of collinear scaling algorithms for bound-constrained optimization: Derivation and computational results, Numerical methods for nonlinear equations, Impulse noise removal by an adaptive trust-region method, AN ADAPTIVE GRADIENT ALGORITHM FOR LARGE-SCALE NONLINEAR BOUND CONSTRAINED OPTIMIZATION, An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming, A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization, A trust region method based on a new affine scaling technique for simple bounded optimization, A non-monotonic method for large-scale non-negative least squares, A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
