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 /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 /PROPT
*TOMLAB /NLPQL
*TOMLAB /LGO
*TOMLAB /LGO-MINLP
*TOMLAB /GP
*TOMLAB /GENO
*TOMLAB /MAD
*TOMLAB /MIDACO

infSolve

Solves sparse minimax problems, with linear and nonlinear constraints. The minimax residuals may or may not include absolute values.

Main features

  • Reformulates the constrained minimax problem into a general nonlinear program, where the minimax 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-2022. All rights reserved.    Last updated: Oct 3, 2022. Site map. Privacy Policy