A penalty algorithm for solving convex separable knapsack problems (Q2660092): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2019.124855 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2986871914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonlinear knapsack problem - algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the continuous nonlinear resource allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic resource allocation with generalized upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton's method for the continuous quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear-time algorithms for the continuous quadratic Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breakpoint searching algorithms for the continuous quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable fixing algorithms for the continuous quadratic Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the continuous quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized knapsack problem with variable coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the continuous nonlinear resource allocation problem with an interior point method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mirror descent and nonlinear projected subgradient methods for convex optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions / rank
 
Normal rank

Latest revision as of 21:00, 24 July 2024

scientific article
Language Label Description Also known as
English
A penalty algorithm for solving convex separable knapsack problems
scientific article

    Statements

    A penalty algorithm for solving convex separable knapsack problems (English)
    0 references
    0 references
    0 references
    29 March 2021
    0 references
    separable knapsack problem
    0 references
    exterior projections
    0 references
    gradient method
    0 references
    Bregman distances
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references