Pages that link to "Item:Q2492668"
From MaRDI portal
The following pages link to New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds (Q2492668):
Displaying 27 items.
- Scaling techniques for gradient projection-type methods in astronomical image deblurring (Q2868153) (← links)
- A parallel decomposition algorithm for training multiclass kernel-based vector machines (Q3093054) (← links)
- A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems (Q3462304) (← links)
- IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS (Q3560109) (← links)
- A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables (Q4687242) (← links)
- (Q4998894) (← links)
- Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property (Q5013590) (← links)
- Sparse Approximations with Interior Point Methods (Q5044994) (← links)
- A two-phase method for solving continuous rank-one quadratic knapsack problems (Q5054022) (← links)
- Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian (Q5077165) (← links)
- On a Reduction for a Class of Resource Allocation Problems (Q5087712) (← links)
- Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems (Q5094911) (← links)
- Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds (Q5110558) (← links)
- Communication-Efficient Property Preservation in Tracer Transport (Q5230587) (← links)
- An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (Q5270754) (← links)
- On the working set selection in gradient projection-based decomposition techniques for support vector machines (Q5717544) (← links)
- Neural blind deconvolution with Poisson data (Q5886388) (← links)
- Nonlinear optimization and support vector machines (Q5915690) (← links)
- Nonlinear optimization and support vector machines (Q5918754) (← links)
- On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex (Q5963696) (← links)
- Robust enhanced indexation optimization with sparse industry Layout constraint (Q6065610) (← links)
- An easily implementable algorithm for efficient projection onto the ordered weighted \(\ell_1\) norm ball (Q6151014) (← links)
- A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations (Q6165597) (← links)
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints (Q6166655) (← links)
- An overview of nonlinear optimization (Q6200213) (← links)
- Optimization-based, property-preserving algorithm for passive tracer transport (Q6202620) (← links)
- An active set method for bound-constrained optimization (Q6661109) (← links)
