A Newton's method for the continuous quadratic knapsack problem
From MaRDI portal
Publication:892383
DOI10.1007/S12532-014-0066-YzbMATH Open1328.65135OpenAlexW2018984203MaRDI QIDQ892383FDOQ892383
Authors: Roberto Cominetti, Walter F. Mascarenhas, Paulo José da Silva e Silva 
Publication date: 19 November 2015
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-014-0066-y
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
convergencecomplexitydualitynumerical experimentquadratic programsemismooth Newtoncontinuous quadratic knapsacksimplex projections
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Complexity and performance of numerical algorithms (65Y20) Methods of quasi-Newton type (90C53) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- Mersenne twister
- Algorithm 813
- An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines
- Validation of subgradient optimization
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- On Floyd and Rivest's SELECT algorithm
- A polynomially bounded algorithm for a singly constrained quadratic program
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- On the continuous quadratic knapsack problem
- Quadratic resource allocation with generalized upper bounds
- An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- On linear-time algorithms for the continuous quadratic Knapsack problem
- A Parallel Projection for the Multicommodity Network Model
- SIMD-oriented fast Mersenne twister: a 128-bit pseudorandom number generator
- Quasi-Newton Updates with Bounds
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Computational development of a lagrangian dual approach for quadratic networks
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- Semismooth support vector machines.
- An O(n) algorithm for quadratic knapsack problems
Cited In (24)
- On the paper ``Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- A primal-dual partial inverse algorithm for constrained monotone inclusions: applications to stochastic programming and mean field games
- A penalty algorithm for solving convex separable knapsack problems
- Projection onto a polyhedron that exploits sparsity
- An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
- A two-phase method for solving continuous rank-one quadratic knapsack problems
- Fast projection onto the simplex and the \(l_1\) ball
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- An efficient Hessian based algorithm for singly linearly and box constrained least squares regression
- Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
- An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem
- On the continuous quadratic knapsack problem
- Title not available (Why is that?)
- Solving the continuous nonlinear resource allocation problem with an interior point method
- Random activations in primal-dual splittings for monotone inclusions with a priori information
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time
- Minimum variance allocation among constrained intervals
- Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
- On linear-time algorithms for the continuous quadratic Knapsack problem
Uses Software
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)
