Pages that link to "Item:Q2471117"

The following pages link to On linear-time algorithms for the continuous quadratic Knapsack problem (Q2471117):

Displaying 16 items.

• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
• A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
• Fast algorithm for singly linearly constrained quadratic programs with box-like constraints (Q513719) (← links)
• Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
• A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training (Q711381) (← links)
• A Newton's method for the continuous quadratic knapsack problem (Q892383) (← links)
• Variable fixing algorithms for the continuous quadratic Knapsack problem (Q927220) (← links)
• Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411) (← links)
• Multimaterial topology optimization by volume constrained Allen-Cahn system and regularized projected steepest descent method (Q1667260) (← links)
• Fast projections onto mixed-norm balls with applications (Q1944995) (← links)
• Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
• On the convergence of inexact block coordinate descent methods for constrained optimization (Q2356093) (← links)
• Minimum variance allocation among constrained intervals (Q2423792) (← links)
• A penalty algorithm for solving convex separable knapsack problems (Q2660092) (← links)
• On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms (Q2800370) (← links)
• The descent algorithm for solving the symmetric eigenvalue complementarity problem (Q6097703) (← links)