Galligani I., Ruggiero V.: Numerical solution of equality-constrained quadratic program- ming problem on vector-parallel computers, Optimization Methods & Software 2, (1993) 233-247.I. Galligani and V. Ruggiero, Numerical solution of equality-constrained quadratic programming problem on vector-...
A discretization of the problem leads to a bound-constrained quadratic programming problem. For a solver-based version of this example, see Bound-Constrained Quadratic Programming, Solver-Based. Problem Definition Consider building a circus tent to cover a square lot. The tent has five poles ...
the shape of a circus tent by solving a quadratic optimization problem. The tent is formed from heavy, elastic material, and settles into a shape that has minimum potential energy subject to constraints. A discretization of the problem leads to a bound-constrained quadratic programming problem. ...
Nonconvexprogramming,quadraticallyconstrainedquadraticprogramming,quadratic assignmentproblem,polynomialsolvability,strongduality MR(2000)SubjectClassification 49N15,90C20,90C27 1 Introduction Thequadraticassignmentproblem(QAP) torialoptimizationformulatedasfollows: (cf.[1-6])isoneofthegreatchallengesincombina- QAP(...
indefinite quadratic problemsThe author considers different classes of nonconvex quadratic problems that can be solved in polynomial time. He presents an algorithm for the problem of minimizing the product of two linear functions over a polyhedron P in Rn. The complexity of the algorithm depends on...
Quadratically constrained linear maximisation... Learn more about optimization, fmincon Optimization Toolbox
This method is due to and familiar to the Quadratic Assignment experts, even if it took some time to realize that most approaches to the problem could be interpreted in these terms, whereas it does not appear to be widely known outside this community. Since the technique is completely ...
With the help of an easily constructed convex underestimator of the objective function, a lower bound is obtained by solving a convex quadratic programming problem. Three variants using exhaustive, adaptive and w -subdivision are discussed. Computational results are presented for problems with 10鈥 ...
The paper presents an overview of methods for solving an ill-posed problem of constrained convex quadratic minimization based on the Fejér-type iterative methods, which widely use the ideas and approaches developed in the works of I. I. Eremin, the founder of the Ural research school of mathe...
A quasi-Newtonian method for solving equality constrained convex quadratic programming problems is presented. By using the argument Lagrange function to convert the constrained programming problem to the unconstrained programming, step-length is determined by Armijo's rule.A quasi-Newtonian method is used...