Turn on suggestions

Auto-suggest helps you quickly narrow down your search results by suggesting possible matches as you type.

Showing results for

Options

- RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Mute
- Printer Friendly Page

🔒 This topic is **solved** and **locked**.
Need further help from the community? Please
sign in and ask a **new** question.

- Mark as New
- Bookmark
- Subscribe
- Mute
- RSS Feed
- Permalink
- Report Inappropriate Content

Posted 12-20-2016 08:39 AM
(1095 views)

Firstly Kudos to SAS team for providing the wonderful procedure for general optimization (single and multiobjective) procedure Proc OPTLSO. I have worked in almost all software, this procedure seems to be the most powerful and general solver that I know of.

I have a hard nonlinear and nonsmooth opbjective function with linear and nonlinear constraints. The true global optimum for my problem is 26.35. However proc optlso returns 27.45. When I change the population size from 300 to 250, I get the true optimum of 26.35. When I change the population size to 200 I dont get the optimal solution. Here are my questions:

- What is the best strategy to get global optimum "every" time when I run the program ? Is there a best practice ? Changing population size I'm assuming is not ideal.
- How o set the seed to random number generator based on clock or something like it ? Will this improve chances of getting the global optimum ? Default seed is 1, I would like to change the seed every time a global solver is started.
- Would increasing nglobal and nlocal help improve the chance of getting global optimum ?

proc optlso ABSFCONV= 1e-20 primalout = solution variables = vardata lincon = lindata nlincon = condata objective = objdata POPSIZE = 300 logfreq = 50 NGLOBAL = 20 nlocal = 20 ; run;

1 ACCEPTED SOLUTION

Accepted Solutions

- Mark as New
- Bookmark
- Subscribe
- Mute
- RSS Feed
- Permalink
- Report Inappropriate Content

Though PROC OPTLSO does conduct a global search of the feasible region using a GA and LHS, it does not currently attempt to calculate a global optimality certificate such as one might find in a branch and bound algorithm. Typically the computation of such certificates either require much stronger assumptions on the objective and constraint functions and/or significantly longer running time. So unfortunately there is no way to guarantee the returned point is globally optimal. However, there are many things we can try to increase the probability that a global optimal point is found such as increasing popsize, nlocal, and/or nglobal, as you suggest. In general I have found that increasing popsize tends to be preferrable, but as you pointed out it is not guaranteed to improve the objective.

If you use seed=0, a random seed will be generated each time. One possibility is to run with (or without) seed=0 and perform a small grid search over a set of popsizes (something similar could be added to search on nglobal/nlocal). For example:

%let popsize=200; %macro loopSolve(ntimes); proc delete data=pall; %do i=1 %to &ntimes.; %let popsize = %eval(&popsize. + 10*&i.); proc optlso

/* your other options here */ popsize=&popsize. seed=0 primalout=pout; performance nthreads=2; run; data pout; set pout; _sol_=&i.; run; proc append base=pall data=pout; run; %end; %mend; %loopSolve(10); proc transpose data=pall out=pallrow (drop=_label_ _name_); by _sol_; var _value_; id _id_; run; proc print data=pallrow; run;

I've attached a documentation example using the above code. Hopefully this help and please let us know if you have more questions.

Best,

--Josh

2 REPLIES 2

- Mark as New
- Bookmark
- Subscribe
- Mute
- RSS Feed
- Permalink
- Report Inappropriate Content

Though PROC OPTLSO does conduct a global search of the feasible region using a GA and LHS, it does not currently attempt to calculate a global optimality certificate such as one might find in a branch and bound algorithm. Typically the computation of such certificates either require much stronger assumptions on the objective and constraint functions and/or significantly longer running time. So unfortunately there is no way to guarantee the returned point is globally optimal. However, there are many things we can try to increase the probability that a global optimal point is found such as increasing popsize, nlocal, and/or nglobal, as you suggest. In general I have found that increasing popsize tends to be preferrable, but as you pointed out it is not guaranteed to improve the objective.

If you use seed=0, a random seed will be generated each time. One possibility is to run with (or without) seed=0 and perform a small grid search over a set of popsizes (something similar could be added to search on nglobal/nlocal). For example:

%let popsize=200; %macro loopSolve(ntimes); proc delete data=pall; %do i=1 %to &ntimes.; %let popsize = %eval(&popsize. + 10*&i.); proc optlso

/* your other options here */ popsize=&popsize. seed=0 primalout=pout; performance nthreads=2; run; data pout; set pout; _sol_=&i.; run; proc append base=pall data=pout; run; %end; %mend; %loopSolve(10); proc transpose data=pall out=pallrow (drop=_label_ _name_); by _sol_; var _value_; id _id_; run; proc print data=pallrow; run;

I've attached a documentation example using the above code. Hopefully this help and please let us know if you have more questions.

Best,

--Josh

- Mark as New
- Bookmark
- Subscribe
- Mute
- RSS Feed
- Permalink
- Report Inappropriate Content

**Don't miss out on SAS Innovate - Register now for the FREE Livestream!**

Can't make it to Vegas? No problem! Watch our general sessions LIVE or on-demand starting April 17th. Hear from SAS execs, best-selling author Adam Grant, Hot Ones host Sean Evans, top tech journalist Kara Swisher, AI expert Cassie Kozyrkov, and the mind-blowing dance crew iLuminate! Plus, get access to over 20 breakout sessions.

Multiple Linear Regression in SAS

Learn how to run multiple linear regression models with and without interactions, presented by SAS user Alex Chaplin.

Find more tutorials on the SAS Users YouTube channel.