Pages that link to "Item:Q1122320"
From MaRDI portal
The following pages link to Algorithms for bound constrained quadratic programming problems (Q1122320):
Displaying 50 items.
- On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems (Q268305) (← links)
- A limited memory quasi-Newton trust-region method for box constrained optimization (Q269370) (← links)
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables (Q319990) (← links)
- A Gauss-Seidel type solver for the fast computation of input-constrained control systems (Q345014) (← links)
- An efficient gradient method using the Yuan steplength (Q480934) (← links)
- Primal-dual active-set methods for large-scale optimization (Q493264) (← links)
- Large correlation analysis (Q547968) (← links)
- A direct active set algorithm for large sparse quadratic programs with simple bounds (Q583116) (← links)
- On iterative algorithms for linear least squares problems with bound constraints (Q756372) (← links)
- An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
- A convergent decomposition method for box-constrained optimization problems (Q839804) (← links)
- Newton-KKT interior-point methods for indefinite quadratic programming (Q885826) (← links)
- Merging of Bézier curves with box constraints (Q898952) (← links)
- A unified method for a class of convex separable nonlinear knapsack problems (Q930930) (← links)
- On solving \(L_{q}\)-penalized regressions (Q933880) (← links)
- A hybrid algorithm for solving linear inequalities in a least squares sense (Q1014358) (← links)
- On the continuous quadratic knapsack problem (Q1194858) (← links)
- A new trust region algorithm for bound constrained minimization (Q1337095) (← links)
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds (Q1341568) (← links)
- Family of projected descent methods for optimization problems with simple bounds (Q1364228) (← links)
- A trust-region-approach for solving a parameter estimation problem from the biotechnology area (Q1417606) (← links)
- Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming (Q1770257) (← links)
- Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization (Q1777447) (← links)
- The adventures of a simple algorithm (Q1863543) (← links)
- A parallel relaxation method for quadratic programming problems with interval constraints (Q1900763) (← links)
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems (Q1908927) (← links)
- An active set feasible method for large-scale minimization problems with bound constraints (Q1928749) (← links)
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization (Q1935275) (← links)
- Steplength selection in gradient projection methods for box-constrained quadratic programs (Q2009551) (← links)
- Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient (Q2082555) (← 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)
- 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)
- Modified combined relaxation method for general monotone equilibrium problems in Hilbert spaces (Q2370069) (← links)
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization (Q2448155) (← links)
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds (Q2492668) (← links)
- Modulus-Type Inner Outer Iteration Methods for Nonnegative Constrained Least Squares Problems (Q2827061) (← links)
- Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves (Q2832889) (← links)
- On the convergence of an active-set method for ℓ<sub>1</sub>minimization (Q2905351) (← links)
- A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds (Q2945124) (← links)
- A Solver for Nonconvex Bound-Constrained Quadratic Optimization (Q3454512) (← links)
- OPTIMAL TREATMENT PLANNING IN RADIOTHERAPY BASED ON BOLTZMANN TRANSPORT CALCULATIONS (Q3521623) (← links)
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints (Q3559429) (← links)
- IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS (Q3560109) (← links)
- Convergence of the EDIIS Algorithm for Nonlinear Equations (Q4613510) (← links)
- Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← links)
- A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables (Q4687242) (← links)
