Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
From MaRDI portal
Publication:2077958
Recommendations
- The nonlinear knapsack problem - algorithms and applications
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- A survey on the continuous nonlinear resource allocation problem
- Algorithms for separable nonlinear resource allocation problems
- A pegging algorithm for the nonlinear resource allocation problem
Cites work
- A library for continuous convex separable quadratic knapsack problems
- A New and Efficient Algorithm for a Class of Portfolio Selection Problems
- A Newton's method for the continuous quadratic knapsack problem
- A survey on the continuous nonlinear resource allocation problem
- Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- Algorithms for the solution of quadratic knapsack problems
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
- Benchmarking optimization software with performance profiles.
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- Convex quadratic programming with one constraint and bounded variables
- Exact Solution of the Quadratic Knapsack Problem
- scientific article; zbMATH DE number 6263683 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- Multiplier and gradient methods
- On a discrete nonlinear and nonseparable knapsack problem
- Practical augmented Lagrangian methods for constrained optimization
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Quadratic knapsack problems
- Quadratic resource allocation with generalized upper bounds
- Solving Large Sparse Nonlinear Programs Using GRG
- Solving nested-constraint resource allocation problems with an interior point method
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- The nonlinear knapsack problem - algorithms and applications
- Variable fixing algorithms for the continuous quadratic Knapsack problem
Cited in
(5)- Solving the continuous nonlinear resource allocation problem with an interior point method
- Integrating train service route design with passenger flow allocation for an urban rail transit line
- On the paper ``Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
- A distributed primal-dual hybrid gradient algorithm for fair resource allocation
- Accelerated double-sketching subspace Newton
This page was built for publication: Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2077958)
