Pages that link to "Item:Q922953"
From MaRDI portal
The following pages link to An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds (Q922953):
Displaying 50 items.
- An efficient global algorithm for a class of indefinite separable quadratic programs (Q304230) (← 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)
- Alternating direction method of multipliers for sparse principal component analysis (Q457552) (← links)
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints (Q513719) (← links)
- Comparison of several fast algorithms for projection onto an ellipsoid (Q515784) (← links)
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305) (← links)
- A breakpoint search approach for convex resource allocation problems with bounded variables (Q691476) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- Algorithms for the solution of quadratic knapsack problems (Q806968) (← links)
- Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← links)
- A convergent decomposition method for box-constrained optimization problems (Q839804) (← links)
- Convex programming with single separable constraint and bounded variables (Q885824) (← links)
- A Newton's method for the continuous quadratic knapsack problem (Q892383) (← links)
- Variable fixing algorithms for the continuous quadratic Knapsack problem (Q927220) (← links)
- Cost minimization of a multiple section power cable supplying several remote telecom equipment (Q1039917) (← links)
- Quadratic problems defined on a convex hull of points (Q1102708) (← links)
- Local minima for indefinite quadratic knapsack problems (Q1186274) (← links)
- On the continuous quadratic knapsack problem (Q1194858) (← links)
- Computation of a trust region step (Q1198611) (← links)
- Capacity planning in manufacturing and computer networks (Q1278227) (← links)
- On Newton's method for Huber's robust M-estimation problems in linear regression (Q1279695) (← links)
- A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals (Q1296022) (← links)
- Gauss-Seidel method for least-distance problems (Q1321271) (← links)
- Quadratic resource allocation with generalized upper bounds (Q1376263) (← links)
- An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\) (Q1411525) (← links)
- The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
- Nonlinear integer programming for optimal allocation in stratified sampling (Q1610189) (← links)
- Solving the continuous nonlinear resource allocation problem with an interior point method (Q1785268) (← links)
- Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines (Q1904957) (← links)
- A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines (Q1919811) (← links)
- Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
- Fast computation of global solutions to the single-period unit commitment problem (Q2082175) (← links)
- Application of the dual active set algorithm to quadratic network optimization (Q2366828) (← links)
- Decision model and analysis for investment interest expense deduction and allocation (Q2379558) (← links)
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization (Q2408897) (← links)
- Minimum variance allocation among constrained intervals (Q2423792) (← links)
- Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution (Q2424763) (← links)
- Issues in the implementation of the DSD algorithm for the traffic assignment problem (Q2433525) (← links)
- Finding the projection onto the intersection of a closed half-space and a variable box (Q2450616) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Breakpoint searching algorithms for the continuous quadratic knapsack problem (Q2465658) (← links)
- An improved gradient projection-based decomposition technique for support vector machines (Q2468369) (← links)
- On linear-time algorithms for the continuous quadratic Knapsack problem (Q2471117) (← links)
- A relaxed projection method for general integer quadratic knapsack problem. (Q2477123) (← links)
- Linear programming with variable matrix entries (Q2488219) (← links)
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds (Q2492668) (← links)
- Efficient optimization of support vector machine learning parameters for unbalanced datasets (Q2503014) (← links)
- A class of mathematical programs with equilibrium constraints: a smooth algorithm and applications to contact problems (Q2575248) (← links)
