LOGIN REGISTER (FREE TRIAL) myTOMLAB
 Products TOMLAB Base Module Solvers clsSolve conSolve cutPlane DualSolve expSolve glbDirect glbFast glbSolve glcCluster glcDirect glcFast glcSolve goalSolve infLinSolve infSolve L1LinSolve L1Solve linRatSolve lpSimplex lsei milpSolve minlpSolve mipSolve multiMin multiMINLP nlpSolve pdco pdsco QLD qpSolve slsSolve sTrustr Tfmin Tfzero Tlsqr Tnnls ucSolve TOMLAB /MINOS TOMLAB /NPSOL TOMLAB /DNOPT TOMLAB /SNOPT TOMLAB /SOL TOMLAB /CGO TOMLAB /CPLEX TOMLAB /GUROBI TOMLAB /MINLP TOMLAB /MIPNLP TOMLAB /MISQP TOMLAB /PENSDP TOMLAB /PENBMI TOMLAB /KNITRO TOMLAB /OQNLP TOMLAB /CONOPT TOMLAB /PROPT TOMLAB /NLPQL TOMLAB /LGO TOMLAB /LGO-MINLP TOMLAB /GP TOMLAB /GENO TOMLAB /MAD TOMLAB /MIDACO

# QLD

Solves convex quadratic programming problems.

## Main features

• QL solves quadratic programming problems with a positive definite objective function matrix and linear equality and inequality constraints.

• The algorithm is an implementation of the dual method of Goldfarb and Idnani and a modification of the original implementation of Powell. Initially, the algorithm computes a solution of the unconstrained problem by performing a Cholesky decomposition and by solving the triangular system. In an iterative way, violated constraints are added to a working set and a minimum with respect to the new subsystem with one additional constraint is calculated. Whenever necessary, a constraint is dropped from the working set. The internal matrix transformations are performed in numerically stable way.

Tomlab © 1989-2018. All rights reserved.    Last updated: May 24, 2018. Site map. Privacy Policy