On the Solution of Large Quadratic Programming Problems with Bound Constraints

DOI10.1137/0801008zbMATH Open0752.90053OpenAlexW2026289804MaRDI QIDQ4017641FDOQ4017641

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

Recommendations

• Algorithms for bound constrained quadratic programming problems
• A class of methods for solving large, convex quadratic programs subject to box constraints
• Numerical experiments with algorithms for bound constrained quadratic programming in mechanics
• A quadratic programming algorithm
• Projected gradient methods for linearly constrained problems

zbMATH Keywords

obstacle problemconjugate gradient methodgradient projection methodelastic-plastic torsion problemjournal bearing problems

Mathematics Subject Classification ID

Quadratic programming (90C20) Large-scale problems in mathematical programming (90C06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cited In (91)

• MCMC Algorithms for Computational UQ of Nonnegativity Constrained Linear Inverse Problems
• An augmented Lagrangian filter method
• Reconstruction of sparse signals in impulsive disturbance environments
• A random active set method for strictly convex quadratic problem with simple bounds
• Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming
• Title not available (Why is that?)
• Mixed energy method for solution of quadratic programming problems
• Complexity of a projected Newton-CG method for optimization with bounds
• Phase-field numerical strategies for deviatoric driven fractures
• Title not available (Why is that?)
• An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
• A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions
• Optimal algorithms for large sparse quadratic programming problems with uniformly bounded spectrum
• An active set method for bound-constrained optimization
• Gradient damage modeling of brittle fracture in an explicit dynamics context
• An accurate active set conjugate gradient algorithm with project search for bound constrained optimization
• ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration
• On the stationarity for nonlinear optimization problems with polyhedral constraints
• Convergence of the EDIIS Algorithm for Nonlinear Equations
• A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds
• A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
• A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
• Sensitivity analysis of the strain criterion for multidimensional scaling
• A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• A decomposition method for large-scale box constrained optimization
• Large correlation analysis
• A non-monotonic method for large-scale non-negative least squares
• An active set algorithm for nonlinear optimization with polyhedral constraints
• An active set strategy based on the multiplier function or the gradient.
• Numerical analysis of leaving-face parameters in bound-constrained quadratic minimization
• On a gradient-based algorithm for sparse signal reconstruction in the signal/measurements domain
• Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization
• An accurate active set Newton algorithm for large scale bound constrained optimization.
• Total variation-penalized Poisson likelihood estimation for ill-posed problems
• An active set quasi-Newton method with projected search for bound constrained minimization
• Using Krylov subspace and spectral methods for solving complementarity problems in many-body contact dynamics simulation
• Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
• On the convergence of an active-set method for ℓ₁minimization
• An MCMC method for uncertainty quantification in nonnegativity constrained inverse problems
• A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
• A projected Newton-CG method for nonnegative astronomical image deblurring
• An active set feasible method for large-scale minimization problems with bound constraints
• A Mumford-Shah-type approach to simultaneous reconstruction and segmentation for emission tomography problems with Poisson statistics
• Title not available (Why is that?)
• A multivariate spectral projected gradient method for bound constrained optimization
• Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
• Projector preconditioning for partially bound-constrained quadratic 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
• Projected Barzilai-Borwein method for large-scale nonnegative image restoration
• The bound-constrained conjugate gradient method for non-negative matrices
• A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables
• Flexible complementarity solvers for large-scale applications
• A class of collinear scaling algorithms for bound-constrained optimization: Derivation and computational results
• Numerical solutions of the \(m\)-membranes problem
• Numerical methods for nonlinear equations
• Modified active set projected spectral gradient method for bound constrained optimization
• Robust regression for mixed Poisson-Gaussian model
• Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
• A neural network model with bounded-weights for pattern classification
• PNKH-B: A Projected Newton--Krylov Method for Large-Scale Bound-Constrained Optimization
• Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
• LMBOPT: a limited memory method for bound-constrained optimization
• A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
• Tikhonov regularized Poisson likelihood estimation: theoretical justification and a computational method
• An adaptive gradient algorithm for large-scale nonlinear bound constrained optimization
• Impulse noise removal by an adaptive trust-region method
• An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming
• A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
• A new solver for the elastic normal contact problem using conjugate gradients, deflation, and an FFT-based preconditioner
• A trust region method based on a new affine scaling technique for simple bounded optimization
• Large quadratic programming problems generated by rigid body simulation
• A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
• A Solver for Nonconvex Bound-Constrained Quadratic Optimization
• Solving bound constrained optimization via a new nonmonotone spectral projected gradient method
• A filter-trust-region method for simple-bound constrained optimization
• A new trust region algorithm for bound constrained minimization
• An algorithm for the fast solution of symmetric linear complementarity problems
• A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization
• On using exterior penalty approaches for solving linear programming problems
• A class of methods for solving large, convex quadratic programs subject to box constraints
• Interior-point solver for large-scale quadratic programming problems with bound constraints
• A class of collinear scaling algorithms for bound-constrained optimization: convergence theorems
• Nonmonotone strategy for minimization of quadratics with simple constraints.
• An iterative working-set method for large-scale nonconvex quadratic programming
• Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
• Monotone projected gradient methods for large-scale box-constrained quadratic programming
• Error in the reconstruction of nonsparse images
• An effective branch-and-bound algorithm for convex quadratic integer programming
• A coordinate gradient descent method for nonsmooth separable minimization

This page was built for publication: On the Solution of Large Quadratic Programming Problems with Bound Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4017641)