Algorithms for bound constrained quadratic programming problems
From MaRDI portal
Publication:1122320
DOI10.1007/BF01396045zbMath0675.65061OpenAlexW1981648990MaRDI QIDQ1122320
Gerardo Toraldo, Jorge J. Moré
Publication date: 1989
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133360
algorithmnumerical resultsquadratic programminggradient projection methodactive set strategiesnumber of iterations
Related Items
A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization, On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems, A limited memory quasi-Newton trust-region method for box constrained optimization, Newton projection method as applied to assembly simulation, A new trust region algorithm for bound constrained minimization, Interior-point solver for large-scale quadratic programming problems with bound constraints, Modified combined relaxation method for general monotone equilibrium problems in Hilbert spaces, On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds, A convergent decomposition method for box-constrained optimization problems, 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, Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies, On the solution of multidimensional convex separable continuous knapsack problem with bounded variables, A parallel relaxation method for quadratic programming problems with interval constraints, Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming, Family of projected descent methods for optimization problems with simple bounds, A Gauss-Seidel type solver for the fast computation of input-constrained control systems, An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds, Newton-KKT interior-point methods for indefinite quadratic programming, An active set feasible method for large-scale minimization problems with bound constraints, An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization, Merging of Bézier curves with box constraints, OPTIMAL TREATMENT PLANNING IN RADIOTHERAPY BASED ON BOLTZMANN TRANSPORT CALCULATIONS, A trust-region-approach for solving a parameter estimation problem from the biotechnology area, Convergence of the EDIIS Algorithm for Nonlinear Equations, An accurate active set conjugate gradient algorithm with project search for bound constrained optimization, A unified method for a class of convex separable nonlinear knapsack problems, An efficient gradient method using the Yuan steplength, On solving \(L_{q}\)-penalized regressions, Primal-dual active-set methods for large-scale optimization, Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints, IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS, Global solution of non-convex quadratically constrained quadratic programs, On the continuous quadratic knapsack problem, Globally solving nonconvex quadratic programming problems via completely positive programming, Steplength selection in gradient projection methods for box-constrained quadratic programs, Large correlation analysis, Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming, New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds, Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization, A direct active set algorithm for large sparse quadratic programs with simple bounds, Combined relaxation method for monotone equilibrium problems, A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables, A hybrid algorithm for solving linear inequalities in a least squares sense, On iterative algorithms for linear least squares problems with bound constraints, Modulus-Type Inner Outer Iteration Methods for Nonnegative Constrained Least Squares Problems, Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves, Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient, An active-set algorithmic framework for non-convex optimization problems over the simplex, Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property, The adventures of a simple algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An O(n) algorithm for quadratic knapsack problems
- Solving the minimal least squares problem subject to bounds on the variables
- An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems
- Projections onto order simplexes
- A direct method for sparse least squares problems with lower and upper bounds
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
- A class of methods for solving large, convex quadratic programs subject to box constraints
- On the convergence of projected gradient processes to singular critical points
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- Computing a Trust Region Step
- Normal solutions of linear programs
- Projected gradient methods for linearly constrained problems
- On Linear Restricted and Interval Least-Squares Problems
- Quasi-Newton Updates with Bounds
- On the Identification of Active Constraints
- A polynomially bounded algorithm for a singly constrained quadratic program
- Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
- On the Goldstein-Levitin-Polyak gradient projection method
- Projected Newton Methods for Optimization Problems with Simple Constraints
