Convex quadratic programming with one constraint and bounded variables

Recommendations

An algorithm for quadratic optimization with one quadratic constraint and bounds on the variables
Bound constrained quadratic programming via piecewise quadratic functions
Convex programming with single separable constraint and bounded variables
A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables
An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds

Cites work

A New and Efficient Algorithm for a Class of Portfolio Selection Problems
A polynomially bounded algorithm for a singly constrained quadratic program
Convex Analysis
Convex programming in Hilbert space
Finding the nearest point in A polytope
scientific article; zbMATH DE number 3768853 (Why is no real title available?)
scientific article; zbMATH DE number 3257595 (Why is no real title available?)
Monotone solutions of the parametric linear complementarity problem
On the Goldstein-Levitin-Polyak gradient projection method

Cited in

(35)

Efficient solution approaches for a discrete multi-facility competitive interaction model
Cost minimization of a multiple section power cable supplying several remote telecom equipment
On the continuous quadratic knapsack problem
A simplicial decomposition method for the transit equilibrium assignment problem
A general descent framework for the monotone variational inequality problem
Gauss-Seidel method for least-distance problems
A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
The nonlinear knapsack problem - algorithms and applications
New infeasible interior-point algorithm based on monomial method
On the long-only minimum variance portfolio under single factor model
Variable fixing method by weighted average for the continuous quadratic knapsack problem
Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
Boundedness of a type of iterative sequences in two-dimensional quadratic programming
Quadratic optimization over one first-order cone
A survey on the continuous nonlinear resource allocation problem
Constrained 0-1 quadratic programming: basic approaches and extensions
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
Solution of some convex separable resource allocation and production planning problems with bounds on the variables
A branch and bound algorithm for constrained least squares
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
Optimal iterative QP and QPQC algorithms
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
An algorithm for quadratic optimization with one quadratic constraint and bounds on the variables
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 class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
Convex optimization approach to a single quadratically constrained quadratic minimization problem
Simple solution methods for separable mixed linear and quadratic knapsack problem
Algorithms for the solution of quadratic knapsack problems
Competitive facility location model with concave demand
Convex programming with single separable constraint and bounded variables
An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds

This page was built for publication: Convex quadratic programming with one constraint and bounded variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3771973)