代码搜索：Solver
找到约 5,733 项符合「Solver」的源代码
代码结果 5,733
www.eeworm.com/read/193277/8242002
m reduce_bilinear_branching_variables.m
function p = reduce_bilinear_branching_variables(p);
if p.solver.lowersolver.objective.quadratic.convex
% Setup quadratic
Q_ = p.Q;
for i = 1:size(p.bilinears,1)
if p.c(p.bili
www.eeworm.com/read/415218/11080229
m spgdemo.m
function spgdemo(interactive)
%DEMO Demonstrates the use of the SPGL1 solver
%
% See also SPGL1.
% demo.m
% $Id: spgdemo.m 1079 2008-08-20 21:34:15Z ewout78 $
%
% -------------------------
www.eeworm.com/read/265827/11252792
html structsquarelist.html
Othello Solver: SquareList struct Reference
www.eeworm.com/read/265827/11252820
html group__mac.html
Othello Solver: Macros, constants, globals &a
www.eeworm.com/read/265706/11256135
m mp_lp.m
function [xout, lambdaout, howout, success] = mp_lp(f,A,b,VLB,VUB,x0,N,verbosein)
% MP_LP Linear program solver.
% Calls bp() from BPMPD package to solve linear program if available.
% Otherwise
www.eeworm.com/read/247527/12652879
m vectorized_objective.m
function y = vectorized_objective(x,p1,p2,p3)
%VECTORIZED_OBJECTIVE Objective function for PATTERNSEARCH solver
% Copyright 2004 The MathWorks, Inc.
% $Revision: 1.1 $ $Date: 2004/01/14 15:3
www.eeworm.com/read/237302/13969466
h bend.h
/*
* bend.h - ray-bending solver interface
*
* Jun Korenaga, MIT/WHOI
* January 1999
*/
#ifndef _TOMO_BEND_H_
#define _TOMO_BEND_H_
#include // from mconv
#include
#include "
www.eeworm.com/read/387853/8650996
m band_solve.m
%
% Written by M. Harper Langston - 5/10/00
% harper@cims.nyu.edu
%
% For this sparse LU solver of Ax = b, A has band s.
% For example, the following matrix has band s = 1
%
% x x 0 0 0 0
% x
www.eeworm.com/read/180494/9305174
m example6_6.m
%目标函数
function F = tracklsq(input)
a=input(1);
b=input(2);
opt = simset('solver','ode5','SrcWorkspace','Current');
[tout,xout,yout] = sim('trackoptim',[0 5],opt);
%计算误差信号
F = yout-1;
%调