Home  |  About Us  |  Link To Us  |  FAQ  |  Contact

# Steepest descent method 1.0

Date Added: April 21, 2013  |  Visits: 175

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.

 Requirements: No special requirements Platforms: Matlab Keyword: Checking,  Concave,  Consulted,  Convex,  Fixed,  Globally,  Length,  Multi,  Optimizable,  Optimization,  Takes,  Techniques,  Theory,  Valued,  Variable Users rating: 0/10

 License: Freeware Size: 10 KB
USER REVIEWS
 More Reviews or Write Review
STEEPEST DESCENT METHOD RELATED
 Development Tools  -  NSGA - II: A multi-objective optimization algorithm 1.0 NSGA-II is a very famous multi-objective optimization algorithm. I submitted an example previously and wanted to make this submission useful to others by creating it as a function. Even though this function is very specific to benchmark problems,... 10 KB Development Tools  -  Inverse Distance Weighted (IDW) or Simple Moving Average (SMA) INTERPOLATION 1.0 This function computes at (Xi,Yi) unknown locations the IDW (w P=1, Q=1 yields interpolation at one point --> P>1, Q=1 yields interpolation at a vector of points --> P>1, Q>1 yields interpolation at a (ir)regular grid of... 10 KB Development Tools  -  Multi-Objective Optimizaion using Evolutionary Algorithm 1.0 Conventional optimization algorithms using linear and non-linear programming sometimes have difficulty in finding the global optima or in case of multi-objective optimization, the pareto front. A lot of research has now been directed towards... 368.64 KB Libraries  -  lx_lib structural memory library 20060226-1 lx_lib handles memory allocations as structures, keeping important information such as the remaining allocated space and the length of the used string internal to each variable (or descriptor). Much of it was initially inspired by Dan Bernsteins... 24.58 KB Libraries  -  lx_lib 20050906 lx_lib handles memory allocations as structures, keeping important information such as the remaining allocated space and the length of the used string internal to each variable (or descriptor). Installation: Run make to build the library. To... Backup Utilities  -  Toolwiz Care FREE 1.0.0.72 Toolwiz Care Free is a freeware tool set designed to speed up slow PCs. With multi-functional optimization suite, this software provides a collection of tools that includes System Checkup,System Cleanup,System Speedup,and 40+ powerful tools to... 3.4 MB Development Editors  -  jMetal 4.0 jMetal is designed as an object-oriented Java-based framework that is specially aimed at the development, experimentation, and study of metaheuristics for solving multi-objective optimization problems. Metal stands for Metaheuristic Algorithms in... Programming  -  Opt4J 2.6 Java framework for applying meta-heuristic (multi-objective) optimization algorithms like an Evolutionary Algorithm, Particle Swarm Optimizer, Differential Evolution, or Simulated Annealing to arbitrary optimization problems.(visit:... 2.05 MB Development Tools  -  Pareto Front 1.0 Identifying the Pareto Front from a set of points in a multi-objective space is the most important and also the most time-consuming task in multi-objective optimization. Usually, this is done through so called nondominated sorting. In this... 10 KB Development Tools  -  Constrained MOO using GA 1.0 This code is a demo of using Genetic Algorithms (GA) to solve a simple constrained multi-objective optimization (MOO) problem.The objective is to find the pareto front of the MOO problem defined as follows: Maximize: f1(X) = 2*x1 + 3*x2 f2(X) =... 10 KB