RunMat
  • Pricing
RunMat
GitHub
GitHub
Sign inTry in browser
DesktopRuntimePhysicsCADAdministrationAgent

Get RunMat updates

New releases, guides and examples.

Product+
  • Runtime
  • GPU
  • Parallel
  • Compile
  • Interop and MEX
  • Simulation
  • MCAD
  • ECAD
  • Enterprise
  • AI integrations
  • Pricing
  • Download
Math+
  • Signal processing
  • Linear algebra
  • Statistics
  • Curve fitting
  • Differential equations
  • Control systems
  • Optimization
  • Finance
  • Data and tables
  • Plotting
Physics+
  • Simulation overview
  • Structural
  • Thermal
  • Electromagnetic
  • Joule heating
  • Thermal stress
  • Acoustics
  • Fluid flow
  • Conjugate heat transfer
  • Fluid–structure
  • What is FEA
Industries+
  • Aerospace
  • Automotive and transportation
  • Defense
  • Electronics and semiconductors
  • Energy
  • Industrial machinery
  • Life sciences
  • Quantitative finance
Learn+
  • Guides
  • Docs
  • Function reference
  • Language reference
  • Migration guide
  • Changelog
  • MATLAB Online
  • MATLAB AI agent
  • For students
Compare+
  • RunMat vs MATLAB
  • RunMat vs Ansys
  • RunMat vs SOLIDWORKS
  • RunMat vs Altium
  • RunMat vs Cadence
  • RunMat vs COMSOL
  • RunMat vs Python
  • RunMat vs Julia
  • RunMat vs Physics AI
  • RunMat vs Octave
  • Benchmarks
  • MATLAB alternatives
  • All comparisons
Company+
  • About
  • Blog
  • Contact
  • Source code↗
  • License
  • Privacy
  • Terms

Product

  • Runtime
  • GPU
  • Parallel
  • Compile
  • Interop and MEX
  • Simulation
  • MCAD
  • ECAD
  • Enterprise
  • AI integrations
  • Pricing
  • Download

Math

  • Signal processing
  • Linear algebra
  • Statistics
  • Curve fitting
  • Differential equations
  • Control systems
  • Optimization
  • Finance
  • Data and tables
  • Plotting

Physics

  • Simulation overview
  • Structural
  • Thermal
  • Electromagnetic
  • Joule heating
  • Thermal stress
  • Acoustics
  • Fluid flow
  • Conjugate heat transfer
  • Fluid–structure
  • What is FEA

Industries

  • Aerospace
  • Automotive and transportation
  • Defense
  • Electronics and semiconductors
  • Energy
  • Industrial machinery
  • Life sciences
  • Quantitative finance

Learn

  • Guides
  • Docs
  • Function reference
  • Language reference
  • Migration guide
  • Changelog
  • MATLAB Online
  • MATLAB AI agent
  • For students

Compare

  • RunMat vs MATLAB
  • RunMat vs Ansys
  • RunMat vs SOLIDWORKS
  • RunMat vs Altium
  • RunMat vs Cadence
  • RunMat vs COMSOL
  • RunMat vs Python
  • RunMat vs Julia
  • RunMat vs Physics AI
  • RunMat vs Octave
  • Benchmarks
  • MATLAB alternatives
  • All comparisons

Company

  • About
  • Blog
  • Contact
  • Source code↗
  • License
  • Privacy
  • Terms
GitHubXLinkedIn

© Dystr, Inc. · RunMat v0.7.1, Nov 17, 2026

RunMat® is a registered trademark of Dystr, Inc. MATLAB® is a registered trademark of The MathWorks, Inc. RunMat is not affiliated with, endorsed by, or sponsored by The MathWorks, Inc.

/
See all docs
Builtin Reference
    • acceptancesa
    • annealingboltz
    • annealingfast
    • coneprog
    • crossoverarithmetic
    • crossoverheuristic
    • crossoverintermediate
    • crossoverlaplace
    • crossoverscattered
    • crossoversinglepoint
    • crossovertwopoint
    • eqnproblem
    • EquationProblem.solve
    • EquationProblem.subsasgn
    • EquationProblem.subsref
    • evaluate
    • fgoalattain
    • fitscalingprop
    • fitscalingrank
    • fitscalingshiftlinear
    • fitscalingtop
    • fminbnd
    • fmincon
    • fminimax
    • fminsearch
    • fminunc
    • fseminf
    • fsolve
    • fzero
    • ga
    • gacreationlinearfeasible
    • gacreationnonlinearfeasible
    • gacreationsobol
    • gacreationuniform
    • gacreationuniformint
    • gaplotbestf
    • gaplotbestindiv
    • gaplotdistance
    • gaplotexpectation
    • gaplotgenealogy
    • gaplotmaxconstr
    • gaplotrange
    • gaplotscorediversity
    • gaplotscores
    • gaplotselection
    • gaplotstopping
    • integerConstraint
    • integral
    • intlinprog
    • linprog
    • lsqcurvefit
    • lsqlin
    • LsqlinWarmStart.subsasgn
    • LsqlinWarmStart.subsref
    • lsqnonlin
    • lsqnonneg
    • mutationadaptfeasible
    • mutationgaussian
    • mutationpositivebasis
    • mutationpower
    • mutationuniform
    • optimexpr
    • optimget
    • OptimizationConstraint.evaluate
    • OptimizationConstraint.subsasgn
    • OptimizationConstraint.subsref
    • OptimizationExitflag.double
    • OptimizationExitflag.eq
    • OptimizationExitflag.ne
    • OptimizationExitflag.string
    • OptimizationExpression.acos
    • OptimizationExpression.acosh
    • OptimizationExpression.acot
    • OptimizationExpression.acoth
    • OptimizationExpression.acsc
    • OptimizationExpression.acsch
    • OptimizationExpression.asec
    • OptimizationExpression.asech
    • OptimizationExpression.asin
    • OptimizationExpression.asinh
    • OptimizationExpression.atan
    • OptimizationExpression.atanh
    • OptimizationExpression.cat
    • OptimizationExpression.cos
    • OptimizationExpression.cosh
    • OptimizationExpression.cot
    • OptimizationExpression.coth
    • OptimizationExpression.csc
    • OptimizationExpression.csch
    • OptimizationExpression.ctranspose
    • OptimizationExpression.cumprod
    • OptimizationExpression.cumsum
    • OptimizationExpression.diag
    • OptimizationExpression.diff
    • OptimizationExpression.dot
    • OptimizationExpression.eq
    • OptimizationExpression.evaluate
    • OptimizationExpression.exp
    • OptimizationExpression.ge
    • OptimizationExpression.horzcat
    • OptimizationExpression.ldivide
    • OptimizationExpression.le
    • OptimizationExpression.log
    • OptimizationExpression.mean
    • OptimizationExpression.minus
    • OptimizationExpression.mldivide
    • OptimizationExpression.mpower
    • OptimizationExpression.mrdivide
    • OptimizationExpression.mtimes
    • OptimizationExpression.norm
    • OptimizationExpression.plus
    • OptimizationExpression.power
    • OptimizationExpression.prod
    • OptimizationExpression.rdivide
    • OptimizationExpression.reshape
    • OptimizationExpression.sec
    • OptimizationExpression.sech
    • OptimizationExpression.sin
    • OptimizationExpression.sinh
    • OptimizationExpression.sqrt
    • OptimizationExpression.subsasgn
    • OptimizationExpression.subsref
    • OptimizationExpression.sum
    • OptimizationExpression.tan
    • OptimizationExpression.tanh
    • OptimizationExpression.times
    • OptimizationExpression.trace
    • OptimizationExpression.transpose
    • OptimizationExpression.uminus
    • OptimizationExpression.uplus
    • OptimizationExpression.vertcat
    • OptimizationExpression.zeros
    • OptimizationExpression.zerosLike
    • OptimizationProblem.solve
    • OptimizationProblem.subsasgn
    • OptimizationProblem.subsref
    • OptimizationVariable.subsasgn
    • OptimizationVariable.subsref
    • optimoptions
    • optimplotconstrviolation
    • optimplotfirstorderopt
    • optimplotfunccount
    • optimplotfval
    • optimplotfvalconstr
    • optimplotmilp
    • optimplotstepsize
    • optimplotx
    • optimproblem
    • optimset
    • optimvar
    • optimwarmstart
    • particleswarm
    • patternsearch
    • psplotbestf
    • psplotbestx
    • psplotfuncount
    • psplotmaxconstr
    • psplotmeshsize
    • pswcreationuniform
    • pswplotbestf
    • quad
    • quadprog
    • QuadprogWarmStart.subsasgn
    • QuadprogWarmStart.subsref
    • saplotbestf
    • saplotbestx
    • saplotf
    • saplotstopping
    • saplottemperature
    • saplotx
    • savemilpsolutions
    • secondordercone
    • selectionremainder
    • selectionroulette
    • selectionstochunif
    • selectiontournament
    • selectionuniform
    • simulannealbnd
    • solve
    • surrogateopt
    • surrogateoptplot
    • temperatureboltz
    • temperatureexp
    • temperaturefast

fseminf — Find a local minimum subject to finite and semi-infinite constraints.

fseminf uses adaptive one- or two-dimensional constraint interpolation and genuine working-set sequential quadratic programming. Mesh generations and their constraint/multiplier identities are refreshed at accepted points before first-order or termination publication.

Syntax

[x,fval,exitflag,output,lambda] = fseminf(fun,x0,ntheta,seminfcon)
[...] = fseminf(fun,x0,ntheta,seminfcon,A,b)
[...] = fseminf(fun,x0,ntheta,seminfcon,A,b,Aeq,beq)
[...] = fseminf(fun,x0,ntheta,seminfcon,A,b,Aeq,beq,lb,ub)
[...] = fseminf(fun,x0,ntheta,seminfcon,A,b,Aeq,beq,lb,ub,options)
[...] = fseminf(problem)

Inputs

fun
Type
Any
Required
Yes
Default
—
Description
Scalar objective; optional analytic gradient.
x0
Type
Any
Required
Yes
Default
—
Description
Finite real double starting array; shape preserved.
ntheta
Type
Any
Required
Yes
Default
—
Description
Positive integer-valued double number of infinite constraint families.
seminfcon
Type
Any
Required
Yes
Default
—
Description
[c,ceq,K1,...,Kntheta,S] = seminfcon(x,S).
A
Type
Any
Required
Yes
Default
—
Description
Linear inequality matrix or [].
b
Type
Any
Required
Yes
Default
—
Description
Inequality RHS or [].
Aeq
Type
Any
Required
Yes
Default
—
Description
Linear equality matrix or [].
beq
Type
Any
Required
Yes
Default
—
Description
Equality RHS or [].
lb
Type
Any
Required
Yes
Default
—
Description
Lower bounds or [].
ub
Type
Any
Required
Yes
Default
—
Description
Upper bounds or [].
options
Type
Any
Required
Yes
Default
—
Description
Canonical fseminf options or [].
problem
Type
Any
Required
Yes
Default
—
Description
objective,x0,ntheta,seminfcon,solver='fseminf',options; optional finite constraints and bounds.
NameTypeRequiredDefaultDescription
funAnyYes—Scalar objective; optional analytic gradient.
x0AnyYes—Finite real double starting array; shape preserved.
nthetaAnyYes—Positive integer-valued double number of infinite constraint families.
seminfconAnyYes—[c,ceq,K1,...,Kntheta,S] = seminfcon(x,S).
AAnyYes—Linear inequality matrix or [].
bAnyYes—Inequality RHS or [].
AeqAnyYes—Linear equality matrix or [].
beqAnyYes—Equality RHS or [].
lbAnyYes—Lower bounds or [].
ubAnyYes—Upper bounds or [].
optionsAnyYes—Canonical fseminf options or [].
problemAnyYes—objective,x0,ntheta,seminfcon,solver='fseminf',options; optional finite constraints and bounds.

Returns

x
Type
Any
Description
Last accepted original-shaped point.
fval
Type
Any
Description
Actual objective at x or [] before evaluation.
exitflag
Type
Any
Description
1 KKT; 4 feasible small direction; 5 feasible directional derivative; 0 limit; -1 observer; -2 local infeasibility.
output
Type
Any
Description
Honest iterations, actual calls, step, residuals and termination description.
lambda
Type
Any
Description
Finite constraints and bounds only; excludes internal interpolated-peak rows.
NameTypeDescription
xAnyLast accepted original-shaped point.
fvalAnyActual objective at x or [] before evaluation.
exitflagAny1 KKT; 4 feasible small direction; 5 feasible directional derivative; 0 limit; -1 observer; -2 local infeasibility.
outputAnyHonest iterations, actual calls, step, residuals and termination description.
lambdaAnyFinite constraints and bounds only; excludes internal interpolated-peak rows.

Returned values from fseminf depend on how many outputs the caller requests.

Errors

RunMat:fseminf:InvalidArgument
When
Invalid input, callback carrier or unsupported option.
Message
fseminf: invalid argument
IdentifierWhenMessage
RunMat:fseminf:InvalidArgumentInvalid input, callback carrier or unsupported option.fseminf: invalid argument

Calling forms and data

Use fseminf(fun,x0,ntheta,seminfcon), optionally followed by complete A/b, Aeq/beq and lb/ub pairs, then options. Empty pairs omit finite constraints and empty bounds omit their side. The scalar problem structure requires objective,x0,ntheta,seminfcon,solver='fseminf',options, with optional Aineq,bineq,Aeq,beq,lb,ub.

Numeric problem inputs and numeric callback results are real host double data. x0 is finite and nonempty, ntheta is a positive integer-valued double scalar, and every callback and returned x preserves the original x0 shape. Linear matrices multiply column-major x(:). Sparse, single, native-integer/logical and explicit device problem data are not silently converted into documented double data.

Bounds may contain correctly signed infinities but not NaN. Shorter nonempty bound arrays constrain leading components and warn; remaining coordinates are unbounded. Starting points are clipped to consistent bounds. Inconsistent bounds return original x0, fval=[] and a local infeasibility exit, without invoking the objective or constraints.

Semi-infinite callback

fun returns a real scalar f. SpecifyObjectiveGradient=true requests [f,g], with one gradient element per variable. seminfcon has signature [c,ceq,K1,...,Kntheta,S]=seminfcon(x,S). c<=0 and ceq=0 are finite vector constraints with fixed cardinalities. Their gradients and every semi-infinite gradient use the selected finite-difference owner; no analytic infinite-family Jacobian contract is invented.

The initial S is an ntheta-by-2 NaN matrix. Each returned Ki is a nonempty finite double vector or matrix sampled on a fixed interval or rectangle, and returned S reports the actual positive sampling intervals. A vector uses S(i,1) only; its dormant second interval is not read. Matrix columns use S(i,1), rows use S(i,2). The origin and physical domain must remain fixed across x and mesh recommendations.

S supplied to subsequent accepted-point refreshes recommends refinement or coarsening, not a mandatory data shape. A callback may ignore the recommendation; the solver remaximizes the actual returned interpolant and never pretends the requested mesh was produced. Trial/probe callbacks receive accepted actual intervals. If they return a different sampling of the same fixed physical domain, interpolation evaluates the same frozen physical peak identities on that actual mesh; the row generation is not retargeted. Accepted-point refreshes remaximize the new grid and remap row identities before any KKT publication.

The functions must be continuous in x and their one or two independent family variables. The numerical discretization is not a proof of feasibility between arbitrary unseen features in the original callback function. Provide initial sampling appropriate to those functions and verify a result on independently meaningful domain data.

Numerical algorithm and ownership

Each sampled cell uses adjacent quadratic or cubic one-dimensional/tensor interpolation. Bernstein coefficient bounds and cooperative subdivision locate continuous interpolant maxima, including off-grid peaks; sampled-node maxima are not substituted for the semi-infinite problem. Quadratic/cubic and held-out interpolation defects drive refinement recommendations; safely inactive dense families may coarsen. An exactly resolved off-grid peak is not treated as a sampling error.

One genuine constrained SQP major step uses the current interpolated peak constraints, original finite rows and bounds. A primal working-set quadratic mechanism adds blocking inequalities and removes rows with negative duals. Independent original-model KKT residuals, nonlinear feasibility, dual signs and complementarity govern first-order publication. Incompatible linearizations use the existing single-elastic-variable maximum-violation restoration rather than an unconstrained fixed penalty.

Before any initial or accepted-point KKT check, the accepted raw samples are remaximized and any recommended same-x mesh callback is charged and evaluated. The objective value and analytic gradient are reused only at that exact x. New constraint Jacobians use typed constraints-only probes, which cannot supply an objective value. Every actual objective and constraint invocation is counted separately; these probes do not replay fun.

Opaque mesh generations stamp both accepted points and linearizations. Finite rows retain identity; only exactly matched physical peak identities receive warm duals. A warm remap is never an optimality certificate. Old-generation models are invalidated before asynchronous refresh, and no historical mesh archive or per-probe invocation-context copy is retained. Ordinary finite constrained solvers keep their existing domains unchanged.

Changing peak rows do not receive an invalid cross-generation Lagrangian BFGS secant. The existing positive-semidefinite step model is retained across these refreshes. This can be slower than a tuned implementation and is not a claim of MATLAB-identical iteration history or performance.

Supported options and defaults

ConstraintTolerance/TolCon defaults to 1e-6; OptimalityTolerance defaults to 1e-6; FunctionTolerance defaults to 1e-4; StepTolerance/TolX defaults to 1e-4. These tolerances are nonnegative. Legacy TolFun supplies both function and optimality roles; a conflicting explicit modern value is rejected. Function stopping measures the actual objective directional derivative at a feasible accepted model.

MaxIterations/MaxIter defaults to 400 and MaxFunctionEvaluations/MaxFunEvals to 100*numel(x0); both permit zero. A complete derivative sweep and trial respect the hard evaluated-point budget. Same-x mesh refreshes can reuse fun but are real charged constraint evaluations. output.funcCount records evaluated points, with separate actual objectiveCallCount and constraintCallCount.

MaxSQPIter is a positive inner working-set iteration limit, defaulting to 10*max(numberOfVariables,numberOfInequalities+numberOfBounds). TolConSQP is a positive inner constraint tolerance, default 1e-6. They control the actual quadratic mechanism rather than merely being accepted metadata.

FiniteDifferenceType/FinDiffType is forward by default or central. FiniteDifferenceStepSize/FinDiffRelStep is a finite positive floating scalar or vector, with a scalar factor expanded to all variables. TypicalX is a finite positive floating vector with one element per variable. Empty defaults are sqrt(eps) for forward factors, eps^(1/3) for central factors and unit TypicalX.

Forward steps use sign(x), with sign(0)=1, times the relative factor and max(abs(x),TypicalX). Central steps omit that sign. DiffMinChange defaults to 0 and DiffMaxChange to Inf and clamp the absolute nominal magnitude. Actual representable bound-feasible offsets own the denominators; unusable offsets or overflowing central spans refuse before callbacks. Fixed coordinates use feasible-direction differences, not invented full objective derivatives.

RelLineSrchBnd is [] by default or a finite nonnegative scalar limiting each displacement by that factor times max(abs(x),TypicalX). RelLineSrchBndDuration is a positive count, default 1, of major iterations for which the bound applies. Bounds are checked before trial callbacks.

Diagnostics and FunValCheck accept on/off, default off. Diagnostics emits actual model/call information. FunValCheck=on errors for complex, Inf or NaN objective/constraint results. With it off, only actual undefined numerical trials may trigger smaller trials; invalid carriers, callback exceptions and cancellation remain typed errors.

Display accepts off, none, iter, iter-detailed, notify, notify-detailed, final and final-detailed; default final. Detailed display includes real tolerance information. OutputFcn accepts a handle or cell of handles; PlotFcn (legacy PlotFcns) accepts handles, names or cells. init/iter/done callbacks use the original execution context and may request stop without replaying objective data.

All seven predefined plots are real shared callbacks: optimplotx, optimplotfunccount, optimplotfval, optimplotfvalconstr, optimplotconstrviolation, optimplotstepsize and optimplotfirstorderopt. The best-feasible plot uses feasibility tolerance 1e-6 and distinct feasible/infeasible colors. Plotting requires plot-core and UI authority; it never silently succeeds without a graphics implementation.

Unsupported nonempty options are rejected. There is no accepted Algorithm, UseParallel or SpecifyConstraintGradient placeholder for this solver. Native-integer scalar options and explicit device option readback use their named RunMat extensions; these do not broaden the strict double problem/callback data boundary.

Outputs and execution

Up to five outputs are [x,fval,exitflag,output,lambda]. They use the last accepted original state without callback replay. fval is [] before any accepted objective value. Lambda is [] until a real independent estimate is available; otherwise lower,upper,ineqlin,eqlin,ineqnonlin,eqnonlin preserve original finite row/variable identities and exclude generated interpolated-peak rows.

Exitflag 1 requires current-mesh independent nonlinear KKT success; 4 means a feasible small direction or allowed step; 5 means a feasible small objective directional derivative; 0 is a hard iteration/evaluated-point limit; -1 is observer stop; -2 is local restoration failure, not a global nonlinear infeasibility proof. Unreliable numerical geometry raises an error instead of inventing an undocumented success or zero-gradient fallback.

output contains iterations,funcCount,lssteplength,stepsize,algorithm,constrviolation,firstorderopt,message plus separate actual objectiveCallCount/constraintCallCount. Requested output 4 also captures wallclocktime through the original admitted Clock port; fewer outputs do not read the clock. No ambient clock or runtime context is manufactured.

This is a cooperative host numerical solver on native and WebAssembly targets. Callback effects, cancellation, service authority and output roots remain those of the original invocation. Finite host-memory execution refuses before solver work because dynamic interpolation/factorization/graphics workspaces have no complete finite bound. No GPU optimizer, distributed execution or global minimum certificate is claimed.

Examples

Resolve an infinite-family peak between samples

fun=@(x)(x-1)^2;
options=optimoptions('fseminf','Display','off');
[x,fval,flag]=fseminf(fun,0.2,1,@family,[],[],[],[],0,2,options)
function [c,ceq,K,S]=family(x,S)
if isnan(S(1,1)); S=[0.25 0]; end
t=0:S(1,1):1; c=[]; ceq=[]; K=x-0.5-(t-0.5).^2;
end

Return the original point for inconsistent bounds

[x,fval,flag]=fseminf(@(x)error('objective must not run'),3,1,@never,[],[],[],[],4,2)
function [c,ceq,K,S]=never(x,S)
error('constraint must not run'); c=[]; ceq=[]; K=[];
end

Using fseminf with coding agents

Open a RunMat example with live inputs, then ask the agent to explain how fseminf changes the result.

Run a small fseminf example, explain the result, then change one input and compare the output.

Related Math functions

Optim

acceptancesa · annealingboltz · annealingfast · coneprog · crossoverarithmetic · crossoverheuristic · crossoverintermediate · crossoverlaplace · crossoverscattered · crossoversinglepoint · crossovertwopoint · eqnproblem · EquationProblem.solve · EquationProblem.subsasgn · EquationProblem.subsref · evaluate · fgoalattain · fitscalingprop · fitscalingrank · fitscalingshiftlinear · fitscalingtop · fminbnd · fmincon · fminimax · fminsearch · fminunc · fsolve · fzero · ga · gacreationlinearfeasible · gacreationnonlinearfeasible · gacreationsobol · gacreationuniform · gacreationuniformint · gaplotbestf · gaplotbestindiv · gaplotdistance · gaplotexpectation · gaplotgenealogy · gaplotmaxconstr · gaplotrange · gaplotscorediversity · gaplotscores · gaplotselection · gaplotstopping · integerConstraint · integral · intlinprog · linprog · lsqcurvefit · lsqlin · LsqlinWarmStart.subsasgn · LsqlinWarmStart.subsref · lsqnonlin · lsqnonneg · mutationadaptfeasible · mutationgaussian · mutationpositivebasis · mutationpower · mutationuniform · optimexpr · optimget · OptimizationConstraint.evaluate · OptimizationConstraint.subsasgn · OptimizationConstraint.subsref · OptimizationExitflag.double · OptimizationExitflag.eq · OptimizationExitflag.ne · OptimizationExitflag.string · OptimizationExpression.acos · OptimizationExpression.acosh · OptimizationExpression.acot · OptimizationExpression.acoth · OptimizationExpression.acsc · OptimizationExpression.acsch · OptimizationExpression.asec · OptimizationExpression.asech · OptimizationExpression.asin · OptimizationExpression.asinh · OptimizationExpression.atan · OptimizationExpression.atanh · OptimizationExpression.cat · OptimizationExpression.cos · OptimizationExpression.cosh · OptimizationExpression.cot · OptimizationExpression.coth · OptimizationExpression.csc · OptimizationExpression.csch · OptimizationExpression.ctranspose · OptimizationExpression.cumprod · OptimizationExpression.cumsum · OptimizationExpression.diag · OptimizationExpression.diff · OptimizationExpression.dot · OptimizationExpression.eq · OptimizationExpression.evaluate · OptimizationExpression.exp · OptimizationExpression.ge · OptimizationExpression.horzcat · OptimizationExpression.ldivide · OptimizationExpression.le · OptimizationExpression.log · OptimizationExpression.mean · OptimizationExpression.minus · OptimizationExpression.mldivide · OptimizationExpression.mpower · OptimizationExpression.mrdivide · OptimizationExpression.mtimes · OptimizationExpression.norm · OptimizationExpression.plus · OptimizationExpression.power · OptimizationExpression.prod · OptimizationExpression.rdivide · OptimizationExpression.reshape · OptimizationExpression.sec · OptimizationExpression.sech · OptimizationExpression.sin · OptimizationExpression.sinh · OptimizationExpression.sqrt · OptimizationExpression.subsasgn · OptimizationExpression.subsref · OptimizationExpression.sum · OptimizationExpression.tan · OptimizationExpression.tanh · OptimizationExpression.times · OptimizationExpression.trace · OptimizationExpression.transpose · OptimizationExpression.uminus · OptimizationExpression.uplus · OptimizationExpression.vertcat · OptimizationExpression.zeros · OptimizationExpression.zerosLike · OptimizationProblem.solve · OptimizationProblem.subsasgn · OptimizationProblem.subsref · OptimizationVariable.subsasgn · OptimizationVariable.subsref · optimoptions · optimplotconstrviolation · optimplotfirstorderopt · optimplotfunccount · optimplotfval · optimplotfvalconstr · optimplotmilp · optimplotstepsize · optimplotx · optimproblem · optimset · optimvar · optimwarmstart · particleswarm · patternsearch · psplotbestf · psplotbestx · psplotfuncount · psplotmaxconstr · psplotmeshsize · pswcreationuniform · pswplotbestf · quad · quadprog · QuadprogWarmStart.subsasgn · QuadprogWarmStart.subsref · saplotbestf · saplotbestx · saplotf · saplotstopping · saplottemperature · saplotx · savemilpsolutions · secondordercone · selectionremainder · selectionroulette · selectionstochunif · selectiontournament · selectionuniform · simulannealbnd · solve · surrogateopt · surrogateoptplot · temperatureboltz · temperatureexp · temperaturefast

Elementwise

abs · angle · besselj · bsxfun · complex · conj · double · eps · erf · erfcinv · exp · expm1 · flintmax · gamma · gammaln · heaviside · hypot · imag · int16 · int32 · int64 · int8 · intmax · intmin · ldivide · log · log10 · log1p · log2 · minus · nextpow2 · plus · pow2 · power · rdivide · real · realmax · realmin · realsqrt · rescale · sign · single · sqrt · times · typecast · uint16 · uint32 · uint64 · uint8

Trigonometry

acos · acosd · acosh · acotd · acscd · asecd · asin · asind · asinh · atan · atan2 · atan2d · atand · atanh · cos · cosd · cosh · cospi · deg2rad · pol2cart · rad2deg · sin · sind · sinh · sinpi · tan · tand · tanh

Reduction

all · any · bounds · cummax · cummin · cumprod · cumsum · cumtrapz · diff · gradient · max · maxk · mean · median · min · mink · movmax · movmean · movmedian · movmin · movprod · movstd · movsum · movvar · nnz · prod · rms · std · sum · trapz · var

Structure

bandwidth · isdiag · ishermitian · issymmetric · istril · istriu · symrcm

Bitwise

bitand · bitcmp · bitget · bitor · bitset · bitshift · bitxor · swapbytes

Signal

blackman · butter · buttord · cheb2ord · conv · conv2 · deconv · downsample · envelope · filter · filtfilt · fir1 · freqz · gauspuls · hamming · hann · hilbert · periodogram · pulstran · pwelch · rectpuls · resample · sawtooth · sinc · spectrogram · square · tripuls · unwrap · upsample · zplane

Rounding

ceil · fix · floor · mod · rem · round

Factor

chol · decomposition · decomposition.ctranspose · decomposition.mldivide · decomposition.mrdivide · decomposition.mtimes · decomposition.rdivide · decomposition.subsref · decomposition.times · decomposition.uminus · decomposition.uplus · eig · eigs · gmres · ichol · ilu · lu · ordeig · ordqz · ordschur · pcg · qr · qz · rsf2csf · schur · svd

Solve

cond · det · inv · linsolve · norm · null · pinv · rank · rcond · rref · vecnorm

Ops

cross · ctranspose · dot · mldivide · mpower · mrdivide · mtimes · pagemtimes · pagetranspose · trace · transpose

Symbolic

digits · int · limit · piecewise · sym · syms · vpa

Discrete

factor · factorial · gcd · isprime · lcm · primes

Fft

fft · fft2 · fftn · fftshift · ifft · ifft2 · ifftn · ifftshift

Interpolation

griddedInterpolant · griddedInterpolant.subsref · interp1 · interp1q · interp2 · pchip · ppval · spline

Integer Division

idivide

Ode

ode15s · ode23 · ode45 · odeset

Poly

poly · polyder · polyfit · polyint · polyval · roots

Source you can read

Every RunMat function's source is public. Read exactly how fseminf is executed, line by line, in Rust.

  • View the source for fseminf in Rust on GitHub
  • Learn how the RunMat runtime works
  • Found a bug? Open an issue with a minimal reproduction.

About RunMat

RunMat is a runtime that executes MATLAB-syntax code fast on any GPU. The runtime is free for individuals, including freelancers; students and faculty at an academic institution, for teaching or research there; contributors to an open-source project, for work on that project; organizations with 250 or fewer people and US$10M or less in annual revenue; and anyone, for non-production use. See runmat.com/license.

  • RunMat automatically optimizes your math for GPU execution on Apple, Nvidia, and AMD hardware. No code changes needed. Simulations that took hours now take minutes.
  • Start running code in seconds. RunMat runs in the browser, on the desktop, or from the CLI. No license server, no IT ticket.

Getting started · Benchmarks · Pricing

Download RunMat

Download RunMat for full performance, or use RunMat in your browser for zero setup.

Download RunMatOpen Sandbox
On this page
  • Syntax
  • Inputs
  • Returns
  • Errors
  • Calling forms and data
  • Semi-infinite callback
  • Numerical algorithm and ownership
  • Supported options and defaults
  • Outputs and execution
  • Examples
  • Resolve an infinite-family peak between samples
  • Return the original point for inconsistent bounds
  • Using fseminf with coding agents
  • Related Math functions
  • Optim
  • Elementwise
  • Trigonometry
  • Reduction
  • Structure
  • Bitwise
  • Signal
  • Rounding
  • Factor
  • Solve
  • Ops
  • Symbolic
  • Discrete
  • Fft
  • Interpolation
  • Integer Division
  • Ode
  • Poly
  • Source you can read
  • About RunMat