A polynomially bounded algorithm for a singly constrained quadratic program
From MaRDI portal
Publication:3899825
DOI10.1007/BF01588328zbMath0452.90054MaRDI QIDQ3899825
Richard V. Helgason, Jeffrey L. Kennington, H. Lall
Publication date: 1980
Published in: Mathematical Programming (Search for Journal in Brave)
polynomial algorithm; linear interpolation; binary search; Kuhn-Tucker conditions; singly constrained quadratic program
Related Items
A pegging algorithm for the nonlinear resource allocation problem, Approximation algorithms for indefinite quadratic programming, A breakpoint search approach for convex resource allocation problems with bounded variables, Simple solution methods for separable mixed linear and quadratic knapsack problem, A polynomial algorithm for minimum quadratic cost flow problems, An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems, An O(n) algorithm for quadratic knapsack problems, The stochastic linear continuous type knapsack problem: A generalized P model, Convex programming with single separable constraint and bounded variables, Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm, On a discrete nonlinear and nonseparable knapsack problem, An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds, Variable fixing algorithms for the continuous quadratic Knapsack problem, Solving embedded generalized network problems, Projections onto order simplexes, The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm, The equal flow problem, Algorithms for bound constrained quadratic programming problems, Local minima for indefinite quadratic knapsack problems, On the continuous quadratic knapsack problem, Capacity planning in manufacturing and computer networks, A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals, An \(O(n^ 2)\) active set method for solving a certain parametric quadratic program, An incremental primal-dual method for generalized networks, Applying steepest-edge techniques to a network primal-dual algorithm, Quadratic resource allocation with generalized upper bounds, On properties of multi-dimensional statistical tables, The nonlinear knapsack problem - algorithms and applications, Nonlinear integer programming for optimal allocation in stratified sampling, A heuristic solution procedure for multicommodity integer flows, On the solution of concave knapsack problems, Application of the dual active set algorithm to quadratic network optimization, Decision model and analysis for investment interest expense deduction and allocation, Issues in the implementation of the DSD algorithm for the traffic assignment problem, A survey on the continuous nonlinear resource allocation problem, Breakpoint searching algorithms for the continuous quadratic knapsack problem, A relaxed projection method for general integer quadratic knapsack problem., Convergent Lagrangian heuristics for nonlinear minimum cost network flows, An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint, New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds, A class of mathematical programs with equilibrium constraints: a smooth algorithm and applications to contact problems, Shadow method for convex programming with application for Navy credit sea/shore rotation problem, Solution of some convex separable resource allocation and production planning problems with bounds on the variables, Application and Evaluation of the Signal Traffic Control Strategy TUC in Chania, Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables, Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints, IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS, Convex quadratic programming with one constraint and bounded variables
Cites Work
- Unnamed Item
- Unnamed Item
- The Theory of Search: Optimum Distribution of Search Effort
- Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
- Technical Note—Allocation of Effort Resources among Competing Activities
- An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
- Validation of subgradient optimization
- On an Allocation Problem with Multistage Constraints
- A Problem in Optimum Allocation
