Pages that link to "Item:Q922953"

The following pages link to An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds (Q922953):

Displaying 21 items.

• A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters (Q2693785) (← links)
• Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions (Q2821800) (← links)
• On the symmetric quadratic eigenvalue complementarity problem (Q2926052) (← links)
• A parallel decomposition algorithm for training multiclass kernel-based vector machines (Q3093054) (← links)
• A branch and bound algorithm for constrained least squares (Q3135469) (← 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)
• An algorithm for quadratic optimization with one quadratic constraint and bounds on the variables (Q4209867) (← links)
• Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian (Q5077165) (← links)
• Computing Ground States of Bose--Einstein Condensates with Higher Order Interaction via a Regularized Density Function Formulation (Q5204005) (← links)
• An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (Q5270754) (← links)
• Gradient projection methods for quadratic programs and applications in training support vector machines (Q5317754) (← 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)
• A pegging algorithm for the nonlinear resource allocation problem (Q5959400) (← links)
• On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex (Q5963696) (← links)
• Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (Q6166654) (← links)
• An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints (Q6166655) (← links)
• Competitive Resource Allocation Among Urban Congestion Areas in a Modern Big City (Q6495225) (← links)