TOMLAB OPTIMIZATION LOGO TOMLAB OPTIMIZATION AREA top banner
  # 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 /SNOPT
*TOMLAB /SOL
*TOMLAB /CGO
*TOMLAB /Xpress
*TOMLAB /CPLEX
*TOMLAB /GUROBI
*TOMLAB /MINLP
*TOMLAB /PENSDP
*TOMLAB /PENBMI
*TOMLAB /KNITRO
*TOMLAB /OQNLP
*TOMLAB /CONOPT
*TOMLAB /PROPT
*TOMLAB /NLPQL
*TOMLAB /LGO
*TOMLAB /GP
*TOMLAB /GENO
*TOMLAB /MAD
*TOMLAB /MIPNLP
*TOMLAB /MISQP
*TOMLAB /MIDACO
*TOMLAB /LGO-MINLP
*Coming Products

L1Solve

Solves sparse L1 approximation problems, with linear and nonlinear constraints.

Main features

  • Reformulates the constrained L1 problem into a general nonlinear program, where the L1 residuals are included among the nonlinear constraints. The sparsity of the Jacobian of the residuals are thereby exploited, as this Jacobian is part of the nonlinear constraint Jacobian after the reformulation.
     
  • Any sparse nonlinear TOMLAB solver may be used to solve the nonlinear program formulation. Recommended is to use SNOPT.
     

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