A Newton's method for the continuous quadratic knapsack problem (Q892383): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SPG / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MersenneTwister / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SFMT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NAPHEAP / rank
 
Normal rank
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.1007/s12532-014-0066-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018984203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 813 / 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: Quasi-Newton Updates with Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources / 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: Semismooth support vector machines. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomially bounded algorithm for a singly constrained quadratic program / rank
 
Normal rank
Property / cites work
 
Property / cites work: About strongly polynomial time algorithms for quadratic optimization over submodular constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Floyd and Rivest's SELECT algorithm / 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: An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mersenne twister / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Massively Parallel Algorithms for Singly Constrained Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the continuous quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3504257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Projection for the Multicommodity Network Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational development of a lagrangian dual approach for quadratic networks / rank
 
Normal rank

Latest revision as of 03:08, 11 July 2024

scientific article
Language Label Description Also known as
English
A Newton's method for the continuous quadratic knapsack problem
scientific article

    Statements

    A Newton's method for the continuous quadratic knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    19 November 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    continuous quadratic knapsack
    0 references
    simplex projections
    0 references
    semismooth Newton
    0 references
    duality
    0 references
    convergence
    0 references
    quadratic program
    0 references
    complexity
    0 references
    numerical experiment
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references