Pages that link to "Item:Q319183"
From MaRDI portal
The following pages link to Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183):
Displaying 33 items.
- Fast projection onto the simplex and the \(l_1\) ball (Q304269) (← links)
- A breakpoint search approach for convex resource allocation problems with bounded variables (Q691476) (← links)
- Relaxation-based algorithms for minimax optimization problems with resource allocation applications (Q1332312) (← links)
- Solving the continuous nonlinear resource allocation problem with an interior point method (Q1785268) (← links)
- A Newton-type algorithm for solving problems of search theory (Q1953229) (← links)
- Resource allocation problems in decentralized energy management (Q2014593) (← links)
- On the optimal design of the randomized unbiased Monte Carlo estimators (Q2060580) (← links)
- A feasibility-ensured Lagrangian heuristic for general decomposable problems (Q2068837) (← links)
- Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
- Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem (Q2077958) (← links)
- On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming (Q2136507) (← links)
- Solving nested-constraint resource allocation problems with an interior point method (Q2183209) (← links)
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time (Q2364490) (← links)
- Minimum variance allocation among constrained intervals (Q2423792) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- A penalty algorithm for solving convex separable knapsack problems (Q2660092) (← links)
- A fast algorithm for quadratic resource allocation problems with nested constraints (Q2669547) (← links)
- Algorithms for separable nonlinear resource allocation problems (Q2770087) (← links)
- A decomposition algorithm for nested resource allocation problems (Q2810553) (← links)
- Addendum: A Finite Algorithm for Solving Nonlinear Allocation Problems (Q3677527) (← links)
- COMPUTING OPTIMAL ALLOCATIONS FOR DISCRETE‐TIME NONLINEAR NATURAL RESOURCE MODELS (Q4248888) (← links)
- A Level-Set Method for Convex Optimization with a Feasible Solution Path (Q4562247) (← links)
- The Nonlinear Resource Allocation Problem (Q4897079) (← links)
- Allocating resources via price management systems: a dynamic programming-based approach (Q5018825) (← links)
- A two-phase method for solving continuous rank-one quadratic knapsack problems (Q5054022) (← links)
- A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints (Q5085487) (← links)
- An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives (Q5085488) (← links)
- On a Reduction for a Class of Resource Allocation Problems (Q5087712) (← links)
- A centre–free approach for resource allocation with lower bounds (Q5348382) (← links)
- Resource allocation problems with expensive function evaluations (Q6106771) (← links)
- On the paper ``Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem'' (Q6555200) (← links)
- Continuous equality knapsack with probit-style objectives (Q6614696) (← links)
- A distributed primal-dual hybrid gradient algorithm for fair resource allocation (Q6668156) (← links)
