Convex quadratic programming with one constraint and bounded variables
From MaRDI portal
Publication:3771973
DOI10.1007/BF02591992zbMath0633.90057OpenAlexW1965159235MaRDI QIDQ3771973
Jean-Pierre Dussault, B. Lemaire, Jacques A. Ferland
Publication date: 1986
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02591992
projectionexact line searchlinear equality constraintbounded variablesconvex quadratic problemseparable programunit step-size
Related Items
A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods ⋮ Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables ⋮ 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 ⋮ New infeasible interior-point algorithm based on monomial method ⋮ Competitive facility location model with concave demand ⋮ Convex programming with single separable constraint and bounded variables ⋮ A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems ⋮ On the numerical solution of certain boundary control problems for vibrating media in one space-dimension ⋮ A two-phase method for solving continuous rank-one quadratic knapsack problems ⋮ A survey on the continuous nonlinear resource allocation 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 ⋮ On the continuous quadratic knapsack problem ⋮ 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 ⋮ Statistical process control optimization with variable sampling interval and nonlinear expected loss ⋮ On the long-only minimum variance portfolio under single factor model ⋮ Efficient solution approaches for a discrete multi-facility competitive interaction model ⋮ 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 ⋮ Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem ⋮ A simplicial decomposition method for the transit equilibrium assignment problem ⋮ A branch and bound algorithm for constrained least squares ⋮ The nonlinear knapsack problem - algorithms and applications ⋮ A general descent framework for the monotone variational inequality problem ⋮ Algorithms for the solution of quadratic knapsack problems ⋮ Gauss-Seidel method for least-distance problems
Cites Work
- Unnamed Item
- Unnamed Item
- A New and Efficient Algorithm for a Class of Portfolio Selection Problems
- A polynomially bounded algorithm for a singly constrained quadratic program
- On the Goldstein-Levitin-Polyak gradient projection method
- Finding the nearest point in A polytope
- Convex programming in Hilbert space
- Convex Analysis
- Monotone solutions of the parametric linear complementarity problem
This page was built for publication: Convex quadratic programming with one constraint and bounded variables
