A polynomially bounded algorithm for a singly constrained quadratic program

From MaRDI portal

Publication:3899825

Jump to:navigation, search

DOI10.1007/BF01588328zbMath0452.90054OpenAlexW1987755233MaRDI QIDQ3899825

H. Lall, Jeffrey L. Kennington, Richard V. Helgason

Publication date: 1980

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01588328

zbMATH Keywords

polynomial algorithm linear interpolation binary search Kuhn-Tucker conditions singly constrained quadratic program

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20)

Related Items

The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm, Application of the dual active set algorithm to quadratic network optimization, Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables, An incremental primal-dual method for generalized networks, An efficient global algorithm for a class of indefinite separable quadratic programs, Decision model and analysis for investment interest expense deduction and allocation, Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies, On the solution of multidimensional convex separable continuous knapsack problem with bounded variables, Shadow method for convex programming with application for Navy credit sea/shore rotation problem, Comparative study of two fast algorithms for projecting a point to the standard simplex, A heuristic solution procedure for multicommodity integer flows, The equal flow problem, Applying steepest-edge techniques to a network primal-dual algorithm, Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function, Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian, Quadratic resource allocation with generalized upper bounds, Algorithms for bound constrained quadratic programming problems, An optimal subgradient algorithm for large-scale bound-constrained convex optimization, Convex programming with single separable constraint and bounded variables, A Newton's method for the continuous quadratic knapsack problem, Minimum variance allocation among constrained intervals, Convex quadratic programming with one constraint and bounded variables, On properties of multi-dimensional statistical tables, Issues in the implementation of the DSD algorithm for the traffic assignment problem, Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm, Unnamed Item, A two-phase method for solving continuous rank-one quadratic knapsack problems, On a discrete nonlinear and nonseparable knapsack problem, An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds, The geometric properties of a class of nonsymmetric cones, Variable fixing algorithms for the continuous quadratic Knapsack problem, Finding the projection onto the intersection of a closed half-space and a variable box, A survey on the continuous nonlinear resource allocation problem, Minimizing a stochastic convex function subject to stochastic constraints and some applications, Local minima for indefinite quadratic knapsack problems, Breakpoint searching algorithms for the continuous quadratic knapsack problem, Solution of some convex separable resource allocation and production planning problems with bounds on the 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, On the continuous quadratic knapsack problem, Fast algorithm for singly linearly constrained quadratic programs with box-like constraints, Approximation algorithms for indefinite quadratic programming, A relaxed projection method for general integer quadratic knapsack problem., A breakpoint search approach for convex resource allocation problems with bounded variables, Convergent Lagrangian heuristics for nonlinear minimum cost network flows, Simple solution methods for separable mixed linear and quadratic knapsack problem, 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, On the solution of concave knapsack problems, A pegging algorithm for the nonlinear resource allocation problem, Application and Evaluation of the Signal Traffic Control Strategy TUC in Chania, An efficient Hessian based algorithm for singly linearly and box constrained least squares regression, On the long-only minimum variance portfolio under single factor model, A polynomial algorithm for minimum quadratic cost flow problems, Capacity planning in manufacturing and computer networks, Variable fixing method by weighted average for the continuous quadratic knapsack problem, A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals, An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems, A class of mathematical programs with equilibrium constraints: a smooth algorithm and applications to contact problems, An O(n) algorithm for quadratic knapsack problems, Solving embedded generalized network problems, Unnamed Item, The stochastic linear continuous type knapsack problem: A generalized P model, B-Subdifferentials of the Projection onto the Generalized Simplex, Projections onto order simplexes, The nonlinear knapsack problem - algorithms and applications, An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem, An \(O(n^ 2)\) active set method for solving a certain parametric quadratic program, Nonlinear integer programming for optimal allocation in stratified sampling

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3899825&oldid=17548225"