An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds

DOI10.1007/BF01585748zbMath0711.90061OpenAlexW2061211758MaRDI QIDQ922953

Publication date: 1990

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

composed objective function finite break-points linear-quadratic program piecewise linear monotone non-decreasing function singly constrained quadratic program

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Neural blind deconvolution with Poisson data, Application of the dual active set algorithm to quadratic network optimization, A convergent decomposition method for box-constrained optimization problems, 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, Quadratic problems defined on a convex hull of points, Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines, On the symmetric quadratic eigenvalue complementarity problem, Gradient projection methods for quadratic programs and applications in training support vector machines, 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, A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines, 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, A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems, Minimum variance allocation among constrained intervals, Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution, Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints, An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints, Issues in the implementation of the DSD algorithm for the traffic assignment problem, An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\), Alternating direction method of multipliers for sparse principal component analysis, 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, Local minima for indefinite quadratic knapsack problems, Breakpoint searching algorithms for the continuous quadratic knapsack problem, Using quadratic programming to solve high multiplicity scheduling problems on parallel machines, 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, An improved gradient projection-based decomposition technique for support vector machines, On linear-time algorithms for the continuous quadratic Knapsack problem, On the working set selection in gradient projection-based decomposition techniques for support vector machines, On the continuous quadratic knapsack problem, Fast algorithm for singly linearly constrained quadratic programs with box-like constraints, Comparison of several fast algorithms for projection onto an ellipsoid, Computation of a trust region step, A relaxed projection method for general integer quadratic knapsack problem., A breakpoint search approach for convex resource allocation problems with bounded variables, Simple solution methods for separable mixed linear and quadratic knapsack problem, Linear programming with variable matrix entries, New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds, Nonlinear optimization and support vector machines, Efficient optimization of support vector machine learning parameters for unbalanced datasets, Solving the continuous nonlinear resource allocation problem with an interior point method, Nonlinear optimization and support vector machines, A pegging algorithm for the nonlinear resource allocation problem, Computing Ground States of Bose--Einstein Condensates with Higher Order Interaction via a Regularized Density Function Formulation, On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex, Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions, A parallel decomposition algorithm for training multiclass kernel-based vector machines, Capacity planning in manufacturing and computer networks, On Newton's method for Huber's robust M-estimation problems in linear regression, Variable fixing method by weighted average for the continuous quadratic knapsack problem, Cost minimization of a multiple section power cable supplying several remote telecom equipment, Fast computation of global solutions to the single-period unit commitment problem, A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals, A class of mathematical programs with equilibrium constraints: a smooth algorithm and applications to contact problems, A branch and bound algorithm for constrained least squares, The nonlinear knapsack problem - algorithms and applications, Algorithms for the solution of quadratic knapsack problems, Exact algorithm for concave knapsack problems: linear underestimation and partition method, An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem, Gauss-Seidel method for least-distance problems, Nonlinear integer programming for optimal allocation in stratified sampling

Uses Software

LINDO

Cites Work