Keyword: programming: quadratic

Found 433 papers in total
Duality and solutions for quadratic programming over single non‐homogeneous quadratic constraint
Duality and solutions for quadratic programming over single non‐homogeneous quadratic constraint
2012,
This paper extends and completes the discussion by Xing et al. (Canonical dual...
On reduction of duality gap in quadratic knapsack problems
On reduction of duality gap in quadratic knapsack problems
2012,
We investigate in this paper the duality gap between quadratic knapsack problem and...
A multiple‐drawer medication layout problem in automated dispensing cabinets
A multiple‐drawer medication layout problem in automated dispensing cabinets
2012,
In this paper we investigate the problem of locating medications in automated...
Active‐set Newton methods for mathematical programs with vanishing constraints
Active‐set Newton methods for mathematical programs with vanishing constraints
2012,
Mathematical programs with vanishing constraints constitute a new class of difficult...
On the convergence of trust region algorithms for unconstrained minimization without derivatives
On the convergence of trust region algorithms for unconstrained minimization without derivatives
2012,
We consider iterative trust region algorithms for the unconstrained minimization of an...
A hybrid GRASP‐tabu search metaheuristic for a Four‐Layer Location‐Routing Problem
A hybrid GRASP‐tabu search metaheuristic for a Four‐Layer Location‐Routing Problem
2012,
The location‐routing problem simultaneously considers location, allocation, and...
Developing a chance‐constrained free replicability hull model for supplier selection
Developing a chance‐constrained free replicability hull model for supplier selection
2012,
Selecting appropriate suppliers has strategic significance for every company. The Free...
An inexact spectral bundle method for convex quadratic semidefinite programming
An inexact spectral bundle method for convex quadratic semidefinite programming
2012,
We present an inexact spectral bundle method for solving convex quadratic semidefinite...
Three insertion heuristics and a justification improvement heuristic for two‐dimensional bin packing with guillotine cuts
Three insertion heuristics and a justification improvement heuristic for two‐dimensional bin packing with guillotine cuts
2013,
The problem of packing two‐dimensional items into two‐dimensional bins...
Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition
Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition
2012,
In this paper, we establish global optimality conditions for quadratic optimization...
The Effects of Adding Input Redundancies in Linear Quadratic Regulator Problems
The Effects of Adding Input Redundancies in Linear Quadratic Regulator Problems
2011,
This paper investigates the effects of adding input redundancies repeatedly into...
Global Optimality Conditions and Optimization Methods for Quadratic Knapsack Problems
Global Optimality Conditions and Optimization Methods for Quadratic Knapsack Problems
2011,
The quadratic knapsack problem ( QKP ) maximizes a quadratic objective function...
On Solving Large‐Scale Finite Minimax Problems Using Exponential Smoothing
On Solving Large‐Scale Finite Minimax Problems Using Exponential Smoothing
2011,
This paper focuses on finite minimax problems with many functions, and their solution...
Maximizing Strictly Convex Quadratic Functions with Bounded Perturbations
Maximizing Strictly Convex Quadratic Functions with Bounded Perturbations
2011,
The problem of maximizing f ˜ = f + p over some convex subset D of the n...
Switching Stepsize Strategies for Sequential Quadratic Programming
Switching Stepsize Strategies for Sequential Quadratic Programming
2011,
A Sequential Quadratic Programming (in short, SQP) algorithm is presented for solving...
State‐Feedback, Finite‐Horizon, Cost Density‐Shaping Control for the Linear Quadratic Gaussian Framework
State‐Feedback, Finite‐Horizon, Cost Density‐Shaping Control for the Linear Quadratic Gaussian Framework
2011,
A Multiple‐Cumulant Cost Density‐Shaping (MCCDS) control is proposed for...
Obtaining a Planar Graph by Vertex Deletion
Obtaining a Planar Graph by Vertex Deletion
2012,
In the k ‐ Apex problem the task is to find at most k vertices whose deletion...
Think co(mpletely)positive ! Matrix properties, examples and a clustered bibliography on copositive optimization
Think co(mpletely)positive ! Matrix properties, examples and a clustered bibliography on copositive optimization
2012,
Copositive optimization is a quickly expanding scientific research domain with...
An improved algorithm to test copositivity
An improved algorithm to test copositivity
2012,
Copositivity plays a role in combinatorial and nonconvex quadratic optimization....
Improvements by analyzing the efficient frontier in DEA
Improvements by analyzing the efficient frontier in DEA
2012,
In this paper, we suggest four types of improvements for making inefficient DMUs...
An optimization method to estimate models with store‐level data: A case study
An optimization method to estimate models with store‐level data: A case study
2012,
The quality of the estimation of a latent segment model when only store‐level...
A Level‐3 Reformulation‐Linearization Technique‐Based Bound for the Quadratic Assignment Problem
A Level‐3 Reformulation‐Linearization Technique‐Based Bound for the Quadratic Assignment Problem
2012,
We apply the level‐3 reformulation‐linearization technique (RLT3) to the...
A complete characterization of strong duality in nonconvex optimization with a single constraint
A complete characterization of strong duality in nonconvex optimization with a single constraint
2012,
We first establish sufficient conditions ensuring strong duality for cone constrained...
On duality gap in binary quadratic programming
On duality gap in binary quadratic programming
2012,
We investigate in this paper the duality gap between the binary quadratic optimization...
Papers per page: