Close category search window
 

Optimization with Scilab, present and future

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Baudin, M. ; Scilab Consortium, DIGITEO, Rocquencourt, France ; Steer, S.

We present in this paper an overview of optimization algorithms available in the Scilab software. We focus on the user's point of view, that is, we have to minimize or maximize an objective function and must find a solver suitable for the problem. The aim of this paper is to give a simple but accurate view of what problems can be solved by Scilab and what behavior can be expected for those solvers. For each solver, we analyze the type of problems that it can solve as well as its advantages and limitations. In order to compare the respective performances of the algorithms, we use the CUTEr library, which is available in Scilab. Numerical experiments are presented, which indicates that there is no cure-for-all solvers.

Published in:
Open-source Software for Scientific Computation (OSSC), 2009 IEEE International Workshop on

Date of Conference: 18-20 Sept. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.