Pages that link to "Item:Q3771973"
From MaRDI portal
The following pages link to Convex quadratic programming with one constraint and bounded variables (Q3771973):
Displayed 28 items.
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables (Q319990) (← links)
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- Algorithms for the solution of quadratic knapsack problems (Q806968) (← links)
- Competitive facility location model with concave demand (Q877034) (← links)
- Convex programming with single separable constraint and bounded variables (Q885824) (← links)
- Efficient solution approaches for a discrete multi-facility competitive interaction model (Q1026599) (← links)
- Cost minimization of a multiple section power cable supplying several remote telecom equipment (Q1039917) (← links)
- On the continuous quadratic knapsack problem (Q1194858) (← links)
- A simplicial decomposition method for the transit equilibrium assignment problem (Q1308665) (← links)
- A general descent framework for the monotone variational inequality problem (Q1315420) (← links)
- Gauss-Seidel method for least-distance problems (Q1321271) (← links)
- A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods (Q1338143) (← links)
- The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
- New infeasible interior-point algorithm based on monomial method (Q1919774) (← links)
- On the long-only minimum variance portfolio under single factor model (Q2060386) (← links)
- Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
- Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem (Q2077958) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint (Q2491532) (← links)
- Statistical process control optimization with variable sampling interval and nonlinear expected loss (Q2514642) (← links)
- Solution of some convex separable resource allocation and production planning problems with bounds on the variables (Q3008595) (← links)
- A branch and bound algorithm for constrained least squares (Q3135469) (← links)
- Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables (Q3445459) (← links)
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints (Q3559429) (← links)
- On the numerical solution of certain boundary control problems for vibrating media in one space-dimension (Q4327924) (← links)
- A two-phase method for solving continuous rank-one quadratic knapsack problems (Q5054022) (← links)