代码搜索:optimization

找到约 10,000 项符合「optimization」的源代码

代码结果 10,000
www.eeworm.com/read/459172/1573019

c dsputil_mmi.c

/* * MMI optimized DSP utils * Copyright (c) 2000, 2001 Fabrice Bellard. * * MMI optimization by Leon van Stuivenberg * clear_blocks_mmi() by BroadQ * * This file is part of FFmpeg. * * FFmpe
www.eeworm.com/read/457216/1599682

m ex_4_5.m

% Exercise 4.5: Show the equivalence of 3 convex problem formations % From Boyd & Vandenberghe, "Convex Optimization" % Jo雔le Skaf - 08/17/05 % % Shows the equivalence of the following 3 problems: % 1
www.eeworm.com/read/457216/1599692

m ex_4_27.m

% Exercise 4.27: Matrix fractional minimization using second-order cone programming % From Boyd & Vandenberghe, "Convex Optimization" % Jo雔le Skaf - 09/26/05 % % Shows the equivalence of the following
www.eeworm.com/read/457216/1599694

m fastest_mixing_mc.m

% Section 4.6.3: Find the fastest mixing Markov chain on a graph % Boyd & Vandenberghe "Convex Optimization" % Jo雔le Skaf - 09/26/05 % % The 'fastest mixing Markov chain problem' is to find a transiti
www.eeworm.com/read/457216/1599695

m cantilever_beam.m

% Exercise 4.31: Design of a cantilever beam (GP) % Boyd & Vandenberghe "Convex Optimization" % Almir Mutapcic - 01/30/06 % Updated to use GP mode 02/08/06 % (a figure is generated) % % We have
www.eeworm.com/read/457216/1599712

m ex_5_39.m

% Exercise 5.39: SDP relaxations of the two-way partitioning problem % Boyd & Vandenberghe. "Convex Optimization" % Jo雔le Skaf - 09/07/05 % (a figure is generated) % % Compares the optimal values of:
www.eeworm.com/read/457216/1599725

m floor_plan_graphs.m

% Solve a floor planning problem given graphs H & V % Section 8.8.1/2, Example 8.7, Boyd & Vandenberghe "Convex Optimization" % Joelle Skaf - 11/13/05 % (a figure is generated) % % Rectangles aligned
www.eeworm.com/read/457216/1599733

m min_vol_elp_finite_set.m

% Minimum volume ellipsoid covering a finite set % Section 8.4.1, Boyd & Vandenberghe "Convex Optimization" % Almir Mutapcic - 10/05 % (a figure is generated) % % Given a finite set of points x_i in R
www.eeworm.com/read/457216/1599749

m eucl_proj_cone1.m

% Euclidean projection on the nonnegative orthant % Section 8.1.1, Boyd & Vandenberghe "Convex Optimization" % Joelle Skaf - 10/07/05 % % The projection of x0 on the proper cone K = R+^n is given by %
www.eeworm.com/read/247605/4476395

pcf win.pcf

# Enable FPO (Frame Pointer Omission) optimization for 5-15% improved # performance. paramList = string.split(platform.cc.args['release']) # see if it is in the list if '/Oy-' in paramList: