Search
New Code
Excel Add-in for DB2 1.7
wolfSSL 4.0.0
EntityDAC Express 2.2
SecureBridge 9.1
C# HTML to PDF 2019.6.5
PHP Ecommerce Script 3.6
Devart SSIS Data Flow Components 1.11
dbForge Data Compare for PostgreSQL 3.2.15
OrgChart JS 4.9.7
iScripts CyberMatch 1.3.3
AnyGantt JS Gantt Charts 8.7.0
Database Workbench Pro 5.6.8
SentiMask SDK Trial 2.0.193121
dbForge Studio for SQL Server 5.8
ODBC Driver for ASE 2.1.2
Top Code
VisualNEO Web 2018.12.15
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
Code Listing by Bapi Chatterjee

Code 1-7 of 7   






The script steepestdescent.m optimizes a general multi variable real valued function using steepest descent method. During the iterations if optimum step length is not possible then it takes a fixed step length as 0.001. For the theory any good book on optimization techniques can be consulted. This script is also useful in checking whether a given function is convex or concave and hence globally optimizable.



This script is capable of solving a convex quadratic programming problem by Wolf's method. For the convergence of the algorithm it is necessary that either Hessian of the objective function be positive definite or positive semidefinite Hessian...



The code is written to find one mixed Nash equilibrium strategy apart from all pure Nash equilibria in a bimatrix or general sum two person matrix game. It is based upon the algorithm presented by O.L. Mangasarian in 1964. It uses quadprog to...



The script quasi_newton_dfp.m optimizes a general multi variable real valued function using DFP quasi Newton method. During the iterations if optimum step length is not possible then it takes a fixed step length as 1. For the theory any good book...



This script may be easily converted to a function which could be an extremely useful subroutine in optimization problems to check whether the objective function is globally convex. It may also be used to derive the expressions for gradient and...



The zsum.m finds one mixed strategy solution in a zero sum game in which no saddle point is present



It uses an optimization formulation of n-person non-co-operative games as described in the paper "An Optimization Formulation to Compute Nash Equilibrium in finite Games" presented by the author, available at...