A Newton's method for the continuous quadratic knapsack problem
From MaRDI portal
Publication:892383
Recommendations
- On the continuous quadratic knapsack problem
- An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
- A two-phase method for solving continuous rank-one quadratic knapsack problems
- On linear-time algorithms for the continuous quadratic Knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- New algorithm for quadratic integer knapsack problems
- Approximation of the quadratic knapsack problem
- Approximation of the quadratic knapsack problem
- A conic approximation method for the 0-1 quadratic knapsack problem
- A Closed-Form Solution To A Class Of Quadratic Knapsack Problems
Cites work
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- A Parallel Projection for the Multicommodity Network Model
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- A polynomially bounded algorithm for a singly constrained quadratic program
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- Algorithm 813
- An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines
- An O(n) algorithm for quadratic knapsack problems
- An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- Computational development of a lagrangian dual approach for quadratic networks
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- Mersenne twister
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On Floyd and Rivest's SELECT algorithm
- On linear-time algorithms for the continuous quadratic Knapsack problem
- On the continuous quadratic knapsack problem
- Quadratic resource allocation with generalized upper bounds
- Quasi-Newton Updates with Bounds
- SIMD-oriented fast Mersenne twister: a 128-bit pseudorandom number generator
- Semismooth support vector machines.
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
- Validation of subgradient optimization
- Variable fixing algorithms for the continuous quadratic Knapsack problem
Cited in
(25)- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
- On linear-time algorithms for the continuous quadratic Knapsack problem
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- On the paper ``Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
- Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time
- On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex
- A penalty algorithm for solving convex separable knapsack problems
- Solving the continuous nonlinear resource allocation problem with an interior point method
- A primal-dual partial inverse algorithm for constrained monotone inclusions: applications to stochastic programming and mean field games
- Projection onto a polyhedron that exploits sparsity
- Fast projection onto the simplex and the \(l_1\) ball
- A two-phase method for solving continuous rank-one quadratic knapsack problems
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
- Random activations in primal-dual splittings for monotone inclusions with a priori information
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- On the continuous quadratic knapsack problem
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- Minimum variance allocation among constrained intervals
- scientific article; zbMATH DE number 6836465 (Why is no real title available?)
- Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian
- An efficient Hessian based algorithm for singly linearly and box constrained least squares regression
- An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
This page was built for publication: A Newton's method for the continuous quadratic knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892383)
