Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
From MaRDI portal
Publication:2077958
DOI10.1016/j.ejor.2021.11.027zbMath1495.65084OpenAlexW3216679860MaRDI QIDQ2077958
Publication date: 23 February 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.11.027
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items
Integrating train service route design with passenger flow allocation for an urban rail transit line
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- Algorithms for the solution of quadratic knapsack problems
- A Newton's method for the continuous quadratic knapsack problem
- On a discrete nonlinear and nonseparable knapsack problem
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- Quadratic resource allocation with generalized upper bounds
- The nonlinear knapsack problem - algorithms and applications
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
- Solving nested-constraint resource allocation problems with an interior point method
- A library for continuous convex separable quadratic knapsack problems
- A survey on the continuous nonlinear resource allocation problem
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- Multiplier and gradient methods
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- Convex quadratic programming with one constraint and bounded variables
- A New and Efficient Algorithm for a Class of Portfolio Selection Problems
- Quadratic knapsack problems
- Solving Large Sparse Nonlinear Programs Using GRG
- Exact Solution of the Quadratic Knapsack Problem
- Projected Newton Methods for Optimization Problems with Simple Constraints
- An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem
- Practical Augmented Lagrangian Methods for Constrained Optimization
- Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
- Benchmarking optimization software with performance profiles.
