/doc/html/MDO_2optimizationModule_2optimizers_2algorithms_2cfsqp_2cfsqp_8cpp_source.html
HTML | 3685 lines | 3665 code | 17 blank | 3 comment | 0 complexity | c0689c9577a54c554473a0e4cb82b0ab MD5 | raw file
Possible License(s): GPL-2.0, BSD-3-Clause
Large files files are truncated, but you can click here to view the full file
- <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
- <html xmlns="http://www.w3.org/1999/xhtml">
- <head>
- <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
- <title>WindTurbineMDO: MDO/optimizationModule/optimizers/algorithms/cfsqp/cfsqp.cpp Source File</title>
- <link href="tabs.css" rel="stylesheet" type="text/css"/>
- <link href="doxygen.css" rel="stylesheet" type="text/css" />
- <link href="navtree.css" rel="stylesheet" type="text/css"/>
- <script type="text/javascript" src="jquery.js"></script>
- <script type="text/javascript" src="resize.js"></script>
- <script type="text/javascript" src="navtree.js"></script>
- <script type="text/javascript">
- $(document).ready(initResizable);
- </script>
- <link href="search/search.css" rel="stylesheet" type="text/css"/>
- <script type="text/javascript" src="search/search.js"></script>
- <script type="text/javascript">
- $(document).ready(function() { searchBox.OnSelectItem(0); });
- </script>
- </head>
- <body>
- <div id="top"><!-- do not remove this div! -->
- <div id="titlearea">
- <table cellspacing="0" cellpadding="0">
- <tbody>
- <tr style="height: 56px;">
-
-
- <td style="padding-left: 0.5em;">
- <div id="projectname">WindTurbineMDO
-
- </div>
-
- </td>
-
-
-
- </tr>
- </tbody>
- </table>
- </div>
- <!-- Generated by Doxygen 1.7.5.1 -->
- <script type="text/javascript">
- var searchBox = new SearchBox("searchBox", "search",false,'Search');
- </script>
- <div id="navrow1" class="tabs">
- <ul class="tablist">
- <li><a href="index.html"><span>Main Page</span></a></li>
- <li><a href="namespaces.html"><span>Namespaces</span></a></li>
- <li><a href="annotated.html"><span>Classes</span></a></li>
- <li class="current"><a href="files.html"><span>Files</span></a></li>
- <li>
- <div id="MSearchBox" class="MSearchBoxInactive">
- <span class="left">
- <img id="MSearchSelect" src="search/mag_sel.png"
- onmouseover="return searchBox.OnSearchSelectShow()"
- onmouseout="return searchBox.OnSearchSelectHide()"
- alt=""/>
- <input type="text" id="MSearchField" value="Search" accesskey="S"
- onfocus="searchBox.OnSearchFieldFocus(true)"
- onblur="searchBox.OnSearchFieldFocus(false)"
- onkeyup="searchBox.OnSearchFieldChange(event)"/>
- </span><span class="right">
- <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
- </span>
- </div>
- </li>
- </ul>
- </div>
- <div id="navrow2" class="tabs2">
- <ul class="tablist">
- <li><a href="files.html"><span>File List</span></a></li>
- <li><a href="globals.html"><span>File Members</span></a></li>
- </ul>
- </div>
- </div>
- <div id="side-nav" class="ui-resizable side-nav-resizable">
- <div id="nav-tree">
- <div id="nav-tree-contents">
- </div>
- </div>
- <div id="splitbar" style="-moz-user-select:none;"
- class="ui-resizable-handle">
- </div>
- </div>
- <script type="text/javascript">
- initNavTree('MDO_2optimizationModule_2optimizers_2algorithms_2cfsqp_2cfsqp_8cpp.html','');
- </script>
- <div id="doc-content">
- <div class="header">
- <div class="headertitle">
- <div class="title">MDO/optimizationModule/optimizers/algorithms/cfsqp/cfsqp.cpp</div> </div>
- </div>
- <div class="contents">
- <a href="MDO_2optimizationModule_2optimizers_2algorithms_2cfsqp_2cfsqp_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001
- <a name="l00002"></a>00002 <span class="preprocessor">#ifndef CFSQP_CPP_CPP</span>
- <a name="l00003"></a><a class="code" href="MDO_2optimizationModule_2optimizers_2algorithms_2cfsqp_2cfsqp_8cpp.html#af791052d1d17d3b41c21a794f22138c1">00003</a> <span class="preprocessor"></span><span class="preprocessor">#define CFSQP_CPP_CPP</span>
- <a name="l00004"></a>00004 <span class="preprocessor"></span>
- <a name="l00005"></a>00005 <span class="preprocessor">#include "cfsqp.h"</span>
- <a name="l00006"></a>00006 <span class="preprocessor">#include <iostream></span>
- <a name="l00007"></a>00007
- <a name="l00008"></a><a class="code" href="namespaceCFSQP.html#a60dd043f981fac3b61cdb866f31bb3f4">00008</a> <span class="keywordtype">void</span> <a class="code" href="MDO_2optimizationModule_2optimizers_2algorithms_2cfsqp_2cfsqp_8cpp.html#a64476f78960179a7111056bd22da3cf6">cfsqp_Class_objextive_function</a>(<span class="keywordtype">int</span> <a class="code" href="namespaceTIMEALG.html#ae9d8839642dc910d1e2b4d262f22673d">nparam</a>, <span class="keywordtype">int</span> objIndex, <span class="keywordtype">double</span> *x, <span class="keywordtype">double</span> *objVal,<span class="keywordtype">void</span> *userData)
- <a name="l00009"></a>00009 {
- <a name="l00010"></a>00010 <a class="code" href="structCFSQP_1_1cfsqpUserData.html">cfsqpUserData</a>* myData=<span class="keyword">reinterpret_cast<</span><a class="code" href="structCFSQP_1_1cfsqpUserData.html">cfsqpUserData</a>*<span class="keyword">></span>(userData);
- <a name="l00011"></a>00011
- <a name="l00012"></a>00012 myData-><a class="code" href="structCFSQP_1_1cfsqpUserData.html#ae556e181b10d90f0a8f3dcb2ad4444b8">algData</a>->pointer_to_obj(nparam,objIndex,x,objVal,myData-><a class="code" href="structCFSQP_1_1cfsqpUserData.html#a49d440ce7b9ff36b03c47eb36a35c11f">userData</a>);
- <a name="l00013"></a>00013 }
- <a name="l00014"></a>00014
- <a name="l00015"></a><a class="code" href="namespaceCFSQP.html#afe41a0db574a90be7ed5afd9f93f4653">00015</a> <span class="keywordtype">void</span> <a class="code" href="MDO_2optimizationModule_2optimizers_2algorithms_2cfsqp_2cfsqp_8cpp.html#ad7e640458e5dff82c525d8e61953ad68">cfsqp_Class_constraint_function</a>(<span class="keywordtype">int</span> <a class="code" href="namespaceTIMEALG.html#ae9d8839642dc910d1e2b4d262f22673d">nparam</a>, <span class="keywordtype">int</span> constrIndex, <span class="keywordtype">double</span> *x, <span class="keywordtype">double</span> *constrVal,<span class="keywordtype">void</span> *userData)
- <a name="l00016"></a>00016 {
- <a name="l00017"></a>00017 <a class="code" href="structCFSQP_1_1cfsqpUserData.html">cfsqpUserData</a>* myData=<span class="keyword">reinterpret_cast<</span><a class="code" href="structCFSQP_1_1cfsqpUserData.html">cfsqpUserData</a>*<span class="keyword">></span>(userData);
- <a name="l00018"></a>00018
- <a name="l00019"></a>00019 myData-><a class="code" href="structCFSQP_1_1cfsqpUserData.html#ae556e181b10d90f0a8f3dcb2ad4444b8">algData</a>->pointer_to_constr(nparam,constrIndex,x,constrVal,myData-><a class="code" href="structCFSQP_1_1cfsqpUserData.html#a49d440ce7b9ff36b03c47eb36a35c11f">userData</a>);
- <a name="l00020"></a>00020 }
- <a name="l00021"></a>00021
- <a name="l00022"></a><a class="code" href="namespaceCFSQP.html#ad738b54ab98b2b309f79e34a5a53d1dd">00022</a> <span class="keywordtype">void</span> <a class="code" href="MDO_2optimizationModule_2optimizers_2algorithms_2cfsqp_2cfsqp_8cpp.html#ad7a31f5c7cfcf55f20b3bc639675f8d2">cfsqp_Class_objextive_gradient</a>(<span class="keywordtype">int</span> <a class="code" href="namespaceTIMEALG.html#ae9d8839642dc910d1e2b4d262f22673d">nparam</a>, <span class="keywordtype">int</span> objIndex, <span class="keywordtype">double</span> *x, <span class="keywordtype">double</span> *objVal, <span class="keywordtype">void</span> (*dummy)(<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">double</span>*,<span class="keywordtype">double</span>*,<span class="keywordtype">void</span>*),<span class="keywordtype">void</span> *userData)
- <a name="l00023"></a>00023 {
- <a name="l00024"></a>00024 <a class="code" href="structCFSQP_1_1cfsqpUserData.html">cfsqpUserData</a>* myData=<span class="keyword">reinterpret_cast<</span><a class="code" href="structCFSQP_1_1cfsqpUserData.html">cfsqpUserData</a>*<span class="keyword">></span>(userData);
- <a name="l00025"></a>00025
- <a name="l00026"></a>00026 <span class="keywordflow">if</span>(myData-><a class="code" href="structCFSQP_1_1cfsqpUserData.html#ae556e181b10d90f0a8f3dcb2ad4444b8">algData</a>->pointer_to_gradob==NULL)
- <a name="l00027"></a>00027 myData-><a class="code" href="structCFSQP_1_1cfsqpUserData.html#ae556e181b10d90f0a8f3dcb2ad4444b8">algData</a>->grobfd(nparam,objIndex,x,objVal,dummy,myData);
- <a name="l00028"></a>00028 <span class="keywordflow">else</span>
- <a name="l00029"></a>00029 myData-><a class="code" href="structCFSQP_1_1cfsqpUserData.html#ae556e181b10d90f0a8f3dcb2ad4444b8">algData</a>->pointer_to_gradob(nparam,objIndex,x,objVal,dummy,myData-><a class="code" href="structCFSQP_1_1cfsqpUserData.html#a49d440ce7b9ff36b03c47eb36a35c11f">userData</a>);
- <a name="l00030"></a>00030 }
- <a name="l00031"></a>00031
- <a name="l00032"></a><a class="code" href="namespaceCFSQP.html#a6a1abfdc5ce3202301327fb47ec7492b">00032</a> <span class="keywordtype">void</span> <a class="code" href="MDO_2optimizationModule_2optimizers_2algorithms_2cfsqp_2cfsqp_8cpp.html#a2f78a6303e6c89591d1fc69ff9008f8d">cfsqp_Class_constraint_gradient</a>(<span class="keywordtype">int</span> nparam, <span class="keywordtype">int</span> constrIndex, <span class="keywordtype">double</span> *x, <span class="keywordtype">double</span> *constrVal, <span class="keywordtype">void</span> (*dummy)(<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">double</span>*,<span class="keywordtype">double</span>*,<span class="keywordtype">void</span>*),<span class="keywordtype">void</span> *userData)
- <a name="l00033"></a>00033 {
- <a name="l00034"></a>00034 <a class="code" href="structCFSQP_1_1cfsqpUserData.html">cfsqpUserData</a>* myData=<span class="keyword">reinterpret_cast<</span><a class="code" href="structCFSQP_1_1cfsqpUserData.html">cfsqpUserData</a>*<span class="keyword">></span>(userData);
- <a name="l00035"></a>00035
- <a name="l00036"></a>00036 <span class="keywordflow">if</span>(myData-><a class="code" href="structCFSQP_1_1cfsqpUserData.html#ae556e181b10d90f0a8f3dcb2ad4444b8">algData</a>->pointer_to_gradcn==NULL)
- <a name="l00037"></a>00037 myData-><a class="code" href="structCFSQP_1_1cfsqpUserData.html#ae556e181b10d90f0a8f3dcb2ad4444b8">algData</a>->grcnfd(nparam,constrIndex,x,constrVal,dummy,myData);
- <a name="l00038"></a>00038 <span class="keywordflow">else</span>
- <a name="l00039"></a>00039 myData-><a class="code" href="structCFSQP_1_1cfsqpUserData.html#ae556e181b10d90f0a8f3dcb2ad4444b8">algData</a>->pointer_to_gradcn(nparam,constrIndex,x,constrVal,dummy,myData-><a class="code" href="structCFSQP_1_1cfsqpUserData.html#a49d440ce7b9ff36b03c47eb36a35c11f">userData</a>);
- <a name="l00040"></a>00040 }
- <a name="l00041"></a>00041
- <a name="l00042"></a><a class="code" href="classcfsqp__Class.html#a4af7f509987b602c75e78d4f59eec035">00042</a> <span class="keywordtype">void</span> <a class="code" href="classcfsqp__Class.html#a4af7f509987b602c75e78d4f59eec035">cfsqp_Class::cfsqp</a>(<span class="keywordtype">int</span> nparam,<span class="keywordtype">int</span> nf,<span class="keywordtype">int</span> nfsr,<span class="keywordtype">int</span> nineqn,<span class="keywordtype">int</span> nineq,<span class="keywordtype">int</span> neqn,<span class="keywordtype">int</span> neq,<span class="keywordtype">int</span> ncsrl,<span class="keywordtype">int</span> ncsrn,<span class="keywordtype">int</span> *mesh_pts,<span class="keywordtype">int</span> mode,<span class="keywordtype">int</span> iprint,<span class="keywordtype">int</span> miter,<span class="keywordtype">int</span> *inform,<span class="keywordtype">double</span> bigbnd,<span class="keywordtype">double</span> eps,<span class="keywordtype">double</span> epseqn,<span class="keywordtype">double</span> udelta,<span class="keywordtype">double</span> *bl,<span class="keywordtype">double</span> *bu,<span class="keywordtype">double</span> *x,<span class="keywordtype">double</span> *f,<span class="keywordtype">double</span> *g,<span class="keywordtype">double</span> *<a class="code" href="timoshenko_8cpp.html#a8a13241405abac2c1c971fe9cf1cf6ac">lambda</a>,<span class="keywordtype">void</span> (*obj)(<span class="keywordtype">int</span>, <span class="keywordtype">int</span>, <span class="keywordtype">double</span> *, <span class="keywordtype">double</span> *,<span class="keywordtype">void</span> *),<span class="keywordtype">void</span> (*constr)(<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">double</span> *,<span class="keywordtype">double</span> *,<span class="keywordtype">void</span> *),<span class="keywordtype">void</span> (*gradob)(<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">double</span> *,<span class="keywordtype">double</span> *,<span class="keywordtype">void</span> (*)(<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">double</span> *,<span class="keywordtype">double</span> *,<span class="keywordtype">void</span> *),<span class="keywordtype">void</span> *),<span class="keywordtype">void</span> (*gradcn)(<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">double</span> *,<span class="keywordtype">double</span> *,<span class="keywordtype">void</span> (*)(<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">double</span> *,<span class="keywordtype">double</span> *,<span class="keywordtype">void</span> *),<span class="keywordtype">void</span> *),<span class="keywordtype">void</span> *cd)
- <a name="l00043"></a>00043 {
- <a name="l00044"></a>00044 cfsqpUserData myData;
- <a name="l00045"></a>00045 myData.userData=cd;
- <a name="l00046"></a>00046 myData.algData=<span class="keyword">this</span>;
- <a name="l00047"></a>00047
- <a name="l00048"></a>00048 this->pointer_to_obj=obj;
- <a name="l00049"></a>00049 this->pointer_to_constr=constr;
- <a name="l00050"></a>00050 this->pointer_to_gradob=gradob;
- <a name="l00051"></a>00051 this->pointer_to_gradcn=gradcn;
- <a name="l00052"></a>00052
- <a name="l00053"></a>00053 cfsqp_Class::cfsqpCall(
- <a name="l00054"></a>00054 nparam,nf,nfsr,nineqn,nineq,neqn,neq,ncsrl,ncsrn,mesh_pts,mode,iprint,miter,inform,bigbnd
- <a name="l00055"></a>00055 ,eps,epseqn,udelta,bl,bu,x,f,g,lambda,&<a class="code" href="MDO_2optimizationModule_2optimizers_2algorithms_2cfsqp_2cfsqp_8cpp.html#a64476f78960179a7111056bd22da3cf6">cfsqp_Class_objextive_function</a>
- <a name="l00056"></a>00056 ,&<a class="code" href="MDO_2optimizationModule_2optimizers_2algorithms_2cfsqp_2cfsqp_8cpp.html#ad7e640458e5dff82c525d8e61953ad68">cfsqp_Class_constraint_function</a>,&<a class="code" href="MDO_2optimizationModule_2optimizers_2algorithms_2cfsqp_2cfsqp_8cpp.html#ad7a31f5c7cfcf55f20b3bc639675f8d2">cfsqp_Class_objextive_gradient</a>
- <a name="l00057"></a>00057 ,&<a class="code" href="MDO_2optimizationModule_2optimizers_2algorithms_2cfsqp_2cfsqp_8cpp.html#a2f78a6303e6c89591d1fc69ff9008f8d">cfsqp_Class_constraint_gradient</a>,&myData);
- <a name="l00058"></a>00058 }
- <a name="l00059"></a>00059
- <a name="l00060"></a>00060 <span class="keywordtype">void</span> cfsqp_Class::cfsqpCall(<span class="keywordtype">int</span> nparam,<span class="keywordtype">int</span> nf,<span class="keywordtype">int</span> nfsr,<span class="keywordtype">int</span> nineqn,<span class="keywordtype">int</span> nineq,<span class="keywordtype">int</span> neqn,<span class="keywordtype">int</span> neq,<span class="keywordtype">int</span> ncsrl,<span class="keywordtype">int</span> ncsrn,<span class="keywordtype">int</span> *mesh_pts,<span class="keywordtype">int</span> mode,<span class="keywordtype">int</span> iprint,<span class="keywordtype">int</span> miter,<span class="keywordtype">int</span> *inform,<span class="keywordtype">double</span> bigbnd,<span class="keywordtype">double</span> eps,<span class="keywordtype">double</span> epseqn,<span class="keywordtype">double</span> udelta,<span class="keywordtype">double</span> *bl,<span class="keywordtype">double</span> *bu,<span class="keywordtype">double</span> *x,<span class="keywordtype">double</span> *f,<span class="keywordtype">double</span> *g,<span class="keywordtype">double</span> *lambda,<span class="keywordtype">void</span> (*obj)(<span class="keywordtype">int</span>, <span class="keywordtype">int</span>, <span class="keywordtype">double</span> *, <span class="keywordtype">double</span> *,<span class="keywordtype">void</span> *),<span class="keywordtype">void</span> (*constr)(<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">double</span> *,<span class="keywordtype">double</span> *,<span class="keywordtype">void</span> *),<span class="keywordtype">void</span> (*gradob)(<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">double</span> *,<span class="keywordtype">double</span> *,<span class="keywordtype">void</span> (*)(<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">double</span> *,<span class="keywordtype">double</span> *,<span class="keywordtype">void</span> *),<span class="keywordtype">void</span> *),<span class="keywordtype">void</span> (*gradcn)(<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">double</span> *,<span class="keywordtype">double</span> *,<span class="keywordtype">void</span> (*)(<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">double</span> *,<span class="keywordtype">double</span> *,<span class="keywordtype">void</span> *),<span class="keywordtype">void</span> *),<span class="keywordtype">void</span> *cd)
- <a name="l00061"></a>00061 <span class="comment">/*---------------------------------------------------------------------</span>
- <a name="l00062"></a>00062 <span class="comment">* Brief specification of various arrays and parameters in the calling</span>
- <a name="l00063"></a>00063 <span class="comment">* sequence. See manual for a more detailed description.</span>
- <a name="l00064"></a>00064 <span class="comment">*</span>
- <a name="l00065"></a>00065 <span class="comment">* nparam : number of variables</span>
- <a name="l00066"></a>00066 <span class="comment">* nf : number of objective functions (count each set of sequentially</span>
- <a name="l00067"></a>00067 <span class="comment">* related objective functions once)</span>
- <a name="l00068"></a>00068 <span class="comment">* nfsr : number of sets of sequentially related objectives (possibly</span>
- <a name="l00069"></a>00069 <span class="comment">* zero)</span>
- <a name="l00070"></a>00070 <span class="comment">* nineqn : number of nonlinear inequality constraints</span>
- <a name="l00071"></a>00071 <span class="comment">* nineq : total number of inequality constraints</span>
- <a name="l00072"></a>00072 <span class="comment">* neqn : number of nonlinear equality constraints</span>
- <a name="l00073"></a>00073 <span class="comment">* neq : total number of equality constraints</span>
- <a name="l00074"></a>00074 <span class="comment">* ncsrl : number of sets of linear sequentially related inequality</span>
- <a name="l00075"></a>00075 <span class="comment">* constraints</span>
- <a name="l00076"></a>00076 <span class="comment">* ncsrn : number of sets of nonlinear sequentially related inequality</span>
- <a name="l00077"></a>00077 <span class="comment">* constraints</span>
- <a name="l00078"></a>00078 <span class="comment">* mesh_pts : array of integers giving the number of actual objectives/</span>
- <a name="l00079"></a>00079 <span class="comment">* constraints in each sequentially related objective or</span>
- <a name="l00080"></a>00080 <span class="comment">* constraint set. The order is as follows:</span>
- <a name="l00081"></a>00081 <span class="comment">* (i) objective sets, (ii) nonlinear constraint sets,</span>
- <a name="l00082"></a>00082 <span class="comment">* (iii) linear constraint sets. If one or no sequentially</span>
- <a name="l00083"></a>00083 <span class="comment">* related constraint or objectives sets are present, the</span>
- <a name="l00084"></a>00084 <span class="comment">* user may simply pass the address of an integer variable</span>
- <a name="l00085"></a>00085 <span class="comment">* containing the appropriate number (possibly zero).</span>
- <a name="l00086"></a>00086 <span class="comment">* mode : mode=CBA specifies job options as described below:</span>
- <a name="l00087"></a>00087 <span class="comment">* A = 0 : ordinary minimax problems</span>
- <a name="l00088"></a>00088 <span class="comment">* = 1 : ordinary minimax problems with each individual</span>
- <a name="l00089"></a>00089 <span class="comment">* function replaced by its absolute value, ie,</span>
- <a name="l00090"></a>00090 <span class="comment">* an L_infty problem</span>
- <a name="l00091"></a>00091 <span class="comment">* B = 0 : monotone decrease of objective function</span>
- <a name="l00092"></a>00092 <span class="comment">* after each iteration</span>
- <a name="l00093"></a>00093 <span class="comment">* = 1 : monotone decrease of objective function after</span>
- <a name="l00094"></a>00094 <span class="comment">* at most four iterations</span>
- <a name="l00095"></a>00095 <span class="comment">* C = 1 : default operation.</span>
- <a name="l00096"></a>00096 <span class="comment">* = 2 : requires that constraints always be evaluated</span>
- <a name="l00097"></a>00097 <span class="comment">* before objectives during the line search.</span>
- <a name="l00098"></a>00098 <span class="comment">* iprint : print level indicator with the following options-</span>
- <a name="l00099"></a>00099 <span class="comment">* iprint=0: no normal output, only error information</span>
- <a name="l00100"></a>00100 <span class="comment">* (this option is imposed during phase 1)</span>
- <a name="l00101"></a>00101 <span class="comment">* iprint=1: a final printout at a local solution</span>
- <a name="l00102"></a>00102 <span class="comment">* iprint=2: a brief printout at the end of each iteration</span>
- <a name="l00103"></a>00103 <span class="comment">* iprint=3: detailed infomation is printed out at the end</span>
- <a name="l00104"></a>00104 <span class="comment">* of each iteration (for debugging purposes)</span>
- <a name="l00105"></a>00105 <span class="comment">* For iprint=2 or 3, the information may be printed at</span>
- <a name="l00106"></a>00106 <span class="comment">* iterations that are multiples of 10, instead of every</span>
- <a name="l00107"></a>00107 <span class="comment">* iteration. This may be done by adding the desired number</span>
- <a name="l00108"></a>00108 <span class="comment">* of iterations to skip printing to the desired iprint value</span>
- <a name="l00109"></a>00109 <span class="comment">* as specified above. e.g., sending iprint=23 would give</span>
- <a name="l00110"></a>00110 <span class="comment">* the iprint=3 information once every 20 iterations.</span>
- <a name="l00111"></a>00111 <span class="comment">* miter : maximum number of iterations allowed by the user to solve</span>
- <a name="l00112"></a>00112 <span class="comment">* the problem</span>
- <a name="l00113"></a>00113 <span class="comment">* inform : status report at the end of execution</span>
- <a name="l00114"></a>00114 <span class="comment">* inform= 0:normal termination</span>
- <a name="l00115"></a>00115 <span class="comment">* inform= 1:no feasible point found for linear constraints</span>
- <a name="l00116"></a>00116 <span class="comment">* inform= 2:no feasible point found for nonlinear constraints</span>
- <a name="l00117"></a>00117 <span class="comment">* inform= 3:no solution has been found in miter iterations</span>
- <a name="l00118"></a>00118 <span class="comment">* inform= 4:stepsize smaller than machine precision before</span>
- <a name="l00119"></a>00119 <span class="comment">* a successful new iterate is found</span>
- <a name="l00120"></a>00120 <span class="comment">* inform= 5:failure in attempting to construct d0</span>
- <a name="l00121"></a>00121 <span class="comment">* inform= 6:failure in attempting to construct d1</span>
- <a name="l00122"></a>00122 <span class="comment">* inform= 7:inconsistent input data</span>
- <a name="l00123"></a>00123 <span class="comment">* inform= 8:new iterate essentially identical to previous</span>
- <a name="l00124"></a>00124 <span class="comment">* iterate, though stopping criterion not satisfied.</span>
- <a name="l00125"></a>00125 <span class="comment">* inform= 9:penalty parameter too large, unable to satisfy</span>
- <a name="l00126"></a>00126 <span class="comment">* nonlinear equality constraint</span>
- <a name="l00127"></a>00127 <span class="comment">* bigbnd : plus infinity</span>
- <a name="l00128"></a>00128 <span class="comment">* eps : stopping criterion. Execution stopped when the norm of the</span>
- <a name="l00129"></a>00129 <span class="comment">* Newton direction vector is smaller than eps</span>
- <a name="l00130"></a>00130 <span class="comment">* epseqn : tolerance of the violation of nonlinear equality constraints</span>
- <a name="l00131"></a>00131 <span class="comment">* allowed by the user at an optimal solution</span>
- <a name="l00132"></a>00132 <span class="comment">* udelta : perturbation size in computing gradients by finite</span>
- <a name="l00133"></a>00133 <span class="comment">* difference. The actual perturbation is determined by</span>
- <a name="l00134"></a>00134 <span class="comment">* sign(x_i) X max{udelta, rteps X max{1, |x_i|}} for each</span>
- <a name="l00135"></a>00135 <span class="comment">* component of x, where rteps is the square root of machine</span>
- <a name="l00136"></a>00136 <span class="comment">* precision.</span>
- <a name="l00137"></a>00137 <span class="comment">* bl : array of dimension nparam,containing lower bound of x</span>
- <a name="l00138"></a>00138 <span class="comment">* bu : array of dimension nparam,containing upper bound of x</span>
- <a name="l00139"></a>00139 <span class="comment">* x : array of dimension nparam,containing initial guess in input</span>
- <a name="l00140"></a>00140 <span class="comment">* and final iterate at the end of execution</span>
- <a name="l00141"></a>00141 <span class="comment">* f : array of dimension sufficient enough to hold the value of</span>
- <a name="l00142"></a>00142 <span class="comment">* all regular objective functions and the value of all</span>
- <a name="l00143"></a>00143 <span class="comment">* members of the sequentially related objective sets.</span>
- <a name="l00144"></a>00144 <span class="comment">* (dimension must be at least 1)</span>
- <a name="l00145"></a>00145 <span class="comment">* g : array of dimension sufficient enough to hold the value of</span>
- <a name="l00146"></a>00146 <span class="comment">* all regular constraint functions and the value of all</span>
- <a name="l00147"></a>00147 <span class="comment">* members of the sequentially related constraint sets.</span>
- <a name="l00148"></a>00148 <span class="comment">* (dimension must be at least 1)</span>
- <a name="l00149"></a>00149 <span class="comment">* lambda : array of dimension nparam+dim(f)+dim(g), containing</span>
- <a name="l00150"></a>00150 <span class="comment">* Lagrange multiplier values at x in output. (A concerns the</span>
- <a name="l00151"></a>00151 <span class="comment">* mode, see above). The first nparam positions contain the</span>
- <a name="l00152"></a>00152 <span class="comment">* multipliers associated with the simple bounds, the next</span>
- <a name="l00153"></a>00153 <span class="comment">* dim(g) positions contain the multipliers associated with</span>
- <a name="l00154"></a>00154 <span class="comment">* the constraints. The final dim(f) positions contain the</span>
- <a name="l00155"></a>00155 <span class="comment">* multipliers associated with the objective functions. The</span>
- <a name="l00156"></a>00156 <span class="comment">* multipliers are in the order they were specified in the</span>
- <a name="l00157"></a>00157 <span class="comment">* user-defined objective and constraint functions.</span>
- <a name="l00158"></a>00158 <span class="comment">* obj : Pointer to function that returns the value of objective</span>
- <a name="l00159"></a>00159 <span class="comment">* functions, one upon each call</span>
- <a name="l00160"></a>00160 <span class="comment">* constr : Pointer to function that returns the value of constraints</span>
- <a name="l00161"></a>00161 <span class="comment">* one upon each call</span>
- <a name="l00162"></a>00162 <span class="comment">* gradob : Pointer to function that computes gradients of f,</span>
- <a name="l00163"></a>00163 <span class="comment">* alternatively it can be replaced by grobfd to compute</span>
- <a name="l00164"></a>00164 <span class="comment">* finite difference approximations</span>
- <a name="l00165"></a>00165 <span class="comment">* gradcn : Pointer to function that computes gradients of g,</span>
- <a name="l00166"></a>00166 <span class="comment">* alternatively it can be replaced by grcnfd to compute</span>
- <a name="l00167"></a>00167 <span class="comment">* finite difference approximations</span>
- <a name="l00168"></a>00168 <span class="comment">* cd : Void pointer that may be used by the user for the passing of</span>
- <a name="l00169"></a>00169 <span class="comment">* "client data" (untouched by CFSQP)</span>
- <a name="l00170"></a>00170 <span class="comment">*</span>
- <a name="l00171"></a>00171 <span class="comment">*----------------------------------------------------------------------</span>
- <a name="l00172"></a>00172 <span class="comment">*</span>
- <a name="l00173"></a>00173 <span class="comment">*</span>
- <a name="l00174"></a>00174 <span class="comment">* CFSQP Version 2.5d</span>
- <a name="l00175"></a>00175 <span class="comment">*</span>
- <a name="l00176"></a>00176 <span class="comment">* Craig Lawrence, Jian L. Zhou</span>
- <a name="l00177"></a>00177 <span class="comment">* and Andre Tits</span>
- <a name="l00178"></a>00178 <span class="comment">* Institute for Systems Research</span>
- <a name="l00179"></a>00179 <span class="comment">* and</span>
- <a name="l00180"></a>00180 <span class="comment">* Electrical Engineering Department</span>
- <a name="l00181"></a>00181 <span class="comment">* University of Maryland</span>
- <a name="l00182"></a>00182 <span class="comment">* College Park, Md 20742</span>
- <a name="l00183"></a>00183 <span class="comment">*</span>
- <a name="l00184"></a>00184 <span class="comment">* February, 1998</span>
- <a name="l00185"></a>00185 <span class="comment">*</span>
- <a name="l00186"></a>00186 <span class="comment">*</span>
- <a name="l00187"></a>00187 <span class="comment">* The purpose of CFSQP is to solve general nonlinear constrained</span>
- <a name="l00188"></a>00188 <span class="comment">* minimax optimization problems of the form</span>
- <a name="l00189"></a>00189 <span class="comment">*</span>
- <a name="l00190"></a>00190 <span class="comment">* (A=0 in mode) minimize max_i f_i(x) for i=1,...,n_f</span>
- <a name="l00191"></a>00191 <span class="comment">* or</span>
- <a name="l00192"></a>00192 <span class="comment">* (A=1 in mode) minimize max_j |f_i(x)| for i=1,...,n_f</span>
- <a name="l00193"></a>00193 <span class="comment">* s.t. bl <= x <= bu</span>
- <a name="l00194"></a>00194 <span class="comment">* g_j(x) <= 0, for j=1,...,nineqn</span>
- <a name="l00195"></a>00195 <span class="comment">* A_1 x - B_1 <= 0</span>
- <a name="l00196"></a>00196 <span class="comment">*</span>
- <a name="l00197"></a>00197 <span class="comment">* h_i(x) = 0, for i=1,...,neqn</span>
- <a name="l00198"></a>00198 <span class="comment">* A_2 x - B_2 = 0</span>
- <a name="l00199"></a>00199 <span class="comment">*</span>
- <a name="l00200"></a>00200 <span class="comment">* CFSQP is also able to efficiently handle problems with large sets of</span>
- <a name="l00201"></a>00201 <span class="comment">* sequentially related objectives or constraints, see the manual for</span>
- <a name="l00202"></a>00202 <span class="comment">* details.</span>
- <a name="l00203"></a>00203 <span class="comment">*</span>
- <a name="l00204"></a>00204 <span class="comment">*</span>
- <a name="l00205"></a>00205 <span class="comment">* Conditions for External Use</span>
- <a name="l00206"></a>00206 <span class="comment">* ===========================</span>
- <a name="l00207"></a>00207 <span class="comment">*</span>
- <a name="l00208"></a>00208 <span class="comment">* 1. The CFSQP routines may not be distributed to third parties.</span>
- <a name="l00209"></a>00209 <span class="comment">* Interested parties shall contact AEM Design directly.</span>
- <a name="l00210"></a>00210 <span class="comment">* 2. If modifications are performed on the routines, these</span>
- <a name="l00211"></a>00211 <span class="comment">* modifications shall be communicated to AEM Design. The</span>
- <a name="l00212"></a>00212 <span class="comment">* modified routines will remain the sole property of the authors.</span>
- <a name="l00213"></a>00213 <span class="comment">* 3. Due acknowledgment shall be made of the use of the CFSQP</span>
- <a name="l00214"></a>00214 <span class="comment">* routines in research reports or publications. Whenever</span>
- <a name="l00215"></a>00215 <span class="comment">* such reports are released for public access, a copy shall</span>
- <a name="l00216"></a>00216 <span class="comment">* be forwarded to AEM Design.</span>
- <a name="l00217"></a>00217 <span class="comment">* 4. The CFSQP routines may only be used for research and</span>
- <a name="l00218"></a>00218 <span class="comment">* development, unless it has been agreed otherwise with AEM</span>
- <a name="l00219"></a>00219 <span class="comment">* Design in writing.</span>
- <a name="l00220"></a>00220 <span class="comment">*</span>
- <a name="l00221"></a>00221 <span class="comment">* Copyright (c) 1993-1998 by Craig T. Lawrence, Jian L. Zhou, and</span>
- <a name="l00222"></a>00222 <span class="comment">* Andre L. Tits</span>
- <a name="l00223"></a>00223 <span class="comment">* All Rights Reserved.</span>
- <a name="l00224"></a>00224 <span class="comment">*</span>
- <a name="l00225"></a>00225 <span class="comment">*</span>
- <a name="l00226"></a>00226 <span class="comment">* Enquiries should be directed to:</span>
- <a name="l00227"></a>00227 <span class="comment">*</span>
- <a name="l00228"></a>00228 <span class="comment">* AEM Design</span>
- <a name="l00229"></a>00229 <span class="comment">* 3754 LaVista Rd., Suite 250</span>
- <a name="l00230"></a>00230 <span class="comment">* Tucker, GA 30084</span>
- <a name="l00231"></a>00231 <span class="comment">* U. S. A.</span>
- <a name="l00232"></a>00232 <span class="comment">*</span>
- <a name="l00233"></a>00233 <span class="comment">* Phone : 678-990-1121</span>
- <a name="l00234"></a>00234 <span class="comment">* Fax : 678-990-1122</span>
- <a name="l00235"></a>00235 <span class="comment">* E-mail: info@aemdesign.com</span>
- <a name="l00236"></a>00236 <span class="comment">*</span>
- <a name="l00237"></a>00237 <span class="comment">* References:</span>
- <a name="l00238"></a>00238 <span class="comment">* [1] E. Panier and A. Tits, `On Combining Feasibility, Descent and</span>
- <a name="l00239"></a>00239 <span class="comment">* Superlinear Convergence In Inequality Constrained Optimization',</span>
- <a name="l00240"></a>00240 <span class="comment">* Mathematical Programming, Vol. 59(1993), 261-276.</span>
- <a name="l00241"></a>00241 <span class="comment">* [2] J. F. Bonnans, E. Panier, A. Tits and J. Zhou, `Avoiding the</span>
- <a name="l00242"></a>00242 <span class="comment">* Maratos Effect by Means of a Nonmonotone Line search: II.</span>
- <a name="l00243"></a>00243 <span class="comment">* Inequality Problems - Feasible Iterates', SIAM Journal on</span>
- <a name="l00244"></a>00244 <span class="comment">* Numerical Analysis, Vol. 29, No. 4, 1992, pp. 1187-1202.</span>
- <a name="l00245"></a>00245 <span class="comment">* [3] J.L. Zhou and A. Tits, `Nonmonotone Line Search for Minimax</span>
- <a name="l00246"></a>00246 <span class="comment">* Problems', Journal of Optimization Theory and Applications,</span>
- <a name="l00247"></a>00247 <span class="comment">* Vol. 76, No. 3, 1993, pp. 455-476.</span>
- <a name="l00248"></a>00248 <span class="comment">* [4] C.T. Lawrence, J.L. Zhou and A. Tits, `User's Guide for CFSQP</span>
- <a name="l00249"></a>00249 <span class="comment">* Version 2.5: A C Code for Solving (Large Scale) Constrained</span>
- <a name="l00250"></a>00250 <span class="comment">* Nonlinear (Minimax) Optimization Problems, Generating Iterates</span>
- <a name="l00251"></a>00251 <span class="comment">* Satisfying All Inequality Constraints,' Institute for</span>
- <a name="l00252"></a>00252 <span class="comment">* Systems Research, University of Maryland,Technical Report</span>
- <a name="l00253"></a>00253 <span class="comment">* TR-94-16r1, College Park, MD 20742, 1997.</span>
- <a name="l00254"></a>00254 <span class="comment">* [5] C.T. Lawrence and A.L. Tits, `Nonlinear Equality Constraints</span>
- <a name="l00255"></a>00255 <span class="comment">* in Feasible Sequential Quadratic Programming,' Optimization</span>
- <a name="l00256"></a>00256 <span class="comment">* Methods and Software, Vol. 6, March, 1996, pp. 265-282.</span>
- <a name="l00257"></a>00257 <span class="comment">* [6] J.L. Zhou and A.L. Tits, `An SQP Algorithm for Finely</span>
- <a name="l00258"></a>00258 <span class="comment">* Discretized Continuous Minimax Problems and Other Minimax</span>
- <a name="l00259"></a>00259 <span class="comment">* Problems With Many Objective Functions,' SIAM Journal on</span>
- <a name="l00260"></a>00260 <span class="comment">* Optimization, Vol. 6, No. 2, May, 1996, pp. 461--487.</span>
- <a name="l00261"></a>00261 <span class="comment">* [7] C. T. Lawrence and A. L. Tits, `Feasible Sequential Quadratic</span>
- <a name="l00262"></a>00262 <span class="comment">* Programming for Finely Discretized Problems from SIP,'</span>
- <a name="l00263"></a>00263 <span class="comment">* To appear in R. Reemtsen, J.-J. Ruckmann (eds.): Semi-Infinite</span>
- <a name="l00264"></a>00264 <span class="comment">* Programming, in the series Nonconcex Optimization and its</span>
- <a name="l00265"></a>00265 <span class="comment">* Applications. Kluwer Academic Publishers, 1998.</span>
- <a name="l00266"></a>00266 <span class="comment">*</span>
- <a name="l00267"></a>00267 <span class="comment">***********************************************************************</span>
- <a name="l00268"></a>00268 <span class="comment">*/</span>
- <a name="l00269"></a>00269 {
- <a name="l00270"></a>00270 <span class="keywordtype">int</span> i,ipp,j,ncnstr,nclin,nctotl,nob,nobL,modem,nn,
- <a name="l00271"></a>00271 nppram,nrowa,ncsipl1,ncsipn1,nfsip1;
- <a name="l00272"></a>00272 <span class="keywordtype">int</span> feasbl,feasb,prnt,Linfty;
- <a name="l00273"></a>00273 <span class="keywordtype">int</span> *indxob,*indxcn,*mesh_pts1;
- <a name="l00274"></a>00274 <span class="keywordtype">double</span> *signeq;
- <a name="l00275"></a>00275 <span class="keywordtype">double</span> xi,gi,gmax,dummy,epskt;
- <a name="l00276"></a>00276 <span class="keyword">struct </span>_constraint *cs; <span class="comment">/* pointer to array of constraints */</span>
- <a name="l00277"></a>00277 <span class="keyword">struct </span>_objective *ob; <span class="comment">/* pointer to array of objectives */</span>
- <a name="l00278"></a>00278 <span class="keyword">struct </span>_parameter *param; <span class="comment">/* pointer to parameter structure */</span>
- <a name="l00279"></a>00279 <span class="keyword">struct </span>_parameter _param;
- <a name="l00280"></a>00280
- <a name="l00281"></a>00281 <span class="comment">/* Make adjustments to parameters for SIP constraints */</span>
- <a name="l00282"></a>00282 glob_info.tot_actf_sip = glob_info.tot_actg_sip = 0;
- <a name="l00283"></a>00283 mesh_pts=mesh_pts-1;
- <a name="l00284"></a>00284 glob_info.nfsip=nfsr;
- <a name="l00285"></a>00285 glob_info.ncsipl=ncsrl;
- <a name="l00286"></a>00286 glob_info.ncsipn=ncsrn;
- <a name="l00287"></a>00287 nf=nf-nfsr;
- <a name="l00288"></a>00288 nfsip1=nfsr;
- <a name="l00289"></a>00289 nfsr=0;
- <a name="l00290"></a>00290 <span class="keywordflow">for</span> (i=1; i<=nfsip1; i++)
- <a name="l00291"></a>00291 nfsr=nfsr+mesh_pts[i];
- <a name="l00292"></a>00292 nf=nf+nfsr;
- <a name="l00293"></a>00293 nineqn=nineqn-ncsrn;
- <a name="l00294"></a>00294 nineq=nineq-ncsrl-ncsrn;
- <a name="l00295"></a>00295 ncsipl1=ncsrl;
- <a name="l00296"></a>00296 ncsipn1=ncsrn;
- <a name="l00297"></a>00297 ncsrl=0;
- <a name="l00298"></a>00298 ncsrn=0;
- <a name="l00299"></a>00299 <span class="keywordflow">if</span> (ncsipn1)
- <a name="l00300"></a>00300 <span class="keywordflow">for</span> (i=1; i<=ncsipn1; i++)
- <a name="l00301"></a>00301 ncsrn=ncsrn+mesh_pts[nfsip1+i];
- <a name="l00302"></a>00302 <span class="keywordflow">if</span> (ncsipl1)
- <a name="l00303"></a>00303 <span class="keywordflow">for</span> (i=1; i<=ncsipl1; i++)
- <a name="l00304"></a>00304 ncsrl=ncsrl+mesh_pts[nfsip1+ncsipn1+i];
- <a name="l00305"></a>00305 nineqn=nineqn+ncsrn;
- <a name="l00306"></a>00306 nineq=nineq+ncsrn+ncsrl;
- <a name="l00307"></a>00307 <span class="comment">/* Create array of constraint structures */</span>
- <a name="l00308"></a>00308 cs=(<span class="keyword">struct </span>_constraint *)calloc(nineq+neq+1,
- <a name="l00309"></a>00309 <span class="keyword">sizeof</span>(<span class="keyword">struct</span> _constraint));
- <a name="l00310"></a>00310 <span class="keywordflow">for</span> (i=1; i<=nineq+neq; i++) {
- <a name="l00311"></a>00311 cs[<a class="code" href="namespaceCPPL.html#aca67a31b860a54cc09b2519953aa2b39">i</a>].grad=make_dv(nparam);
- <a name="l00312"></a>00312 cs[<a class="code" href="namespaceCPPL.html#aca67a31b860a54cc09b2519953aa2b39">i</a>].act_sip=<a class="code" href="MDO_2optimizationModule_2optimizers_2algorithms_2cfsqp_2cfsqp_8h.html#aa93f0eb578d23995850d61f7d61c55c1">FALSE</a>;
- <a name="l00313"></a>00313 cs[<a class="code" href="namespaceCPPL.html#aca67a31b860a54cc09b2519953aa2b39">i</a>].d1bind=<a class="code" href="MDO_2optimizationModule_2optimizers_2algorithms_2cfsqp_2cfsqp_8h.html#aa93f0eb578d23995850d61f7d61c55c1">FALSE</a>;
- <a name="l00314"></a>00314 }
- <a name="l00315"></a>00315 <span class="comment">/* Create parameter structure */</span>
- <a name="l00316"></a>00316 _param.x=make_dv(nparam+1);
- <a name="l00317"></a>00317 _param.bl=make_dv(nparam);
- <a name="l00318"></a>00318 _param.bu=make_dv(nparam);
- <a name="l00319"></a>00319 _param.mult=make_dv(nparam+1);
- <a name="l00320"></a>00320 param=&_param;
- <a name="l00321"></a>00321
- <a name="l00322"></a>00322 <span class="comment">/* Initialize, compute the machine precision, etc. */</span>
- <a name="l00323"></a>00323 bl=bl-1; bu=bu-1; x=x-1;
- <a name="l00324"></a>00324 <span class="keywordflow">for</span> (i=1; i<=<a class="code" href="namespaceTIMEALG.html#ae9d8839642dc910d1e2b4d262f22673d">nparam</a>; i++) {
- <a name="l00325"></a>00325 param->x[<a class="code" href="namespaceCPPL.html#aca67a31b860a54cc09b2519953aa2b39">i</a>]=x[<a class="code" href="namespaceCPPL.html#aca67a31b860a54cc09b2519953aa2b39">i</a>];
- <a name="l00326"></a>00326 param->bl[<a class="code" href="namespaceCPPL.html#aca67a31b860a54cc09b2519953aa2b39">i</a>]=bl[<a class="code" href="namespaceCPPL.html#aca67a31b860a54cc09b2519953aa2b39">i</a>];
- <a name="l00327"></a>00327 param->bu[<a class="code" href="namespaceCPPL.html#aca67a31b860a54cc09b2519953aa2b39">i</a>]=bu[<a class="code" href="namespaceCPPL.html#aca67a31b860a54cc09b2519953aa2b39">i</a>];
- <a name="l00328"></a>00328 }
- <a name="l00329"></a>00329 param->cd=cd; <span class="comment">/* Initialize client data */</span>
- <a name="l00330"></a>00330 dummy=0.e0;
- <a name="l00331"></a>00331 f=f-1; g=g-1; lambda=lambda-1;
- <a name="l00332"></a>00332 glob_prnt.iter=0;
- <a name="l00333"></a>00333 nstop=1;
- <a name="l00334"></a>00334 nn=nineqn+neqn;
- <a name="l00335"></a>00335 glob_grd.epsmac=small();
- <a name="l00336"></a>00336 tolfea=glob_grd.epsmac*1.e2;
- <a name="l00337"></a>00337 bgbnd=bigbnd;
- <a name="l00338"></a>00338 glob_grd.rteps=sqrt(glob_grd.epsmac);
- <a name="l00339"></a>00339 glob_grd.udelta=udelta;
- <a name="l00340"></a>00340 glob_log.rhol_is1=<a class="code" href="MDO_2optimizationModule_2optimizers_2algorithms_2cfsqp_2cfsqp_8h.html#aa93f0eb578d23995850d61f7d61c55c1">FALSE</a>;
- <a name="l00341"></a>00341 glob_log.get_ne_mult=<a class="code" href="MDO_2optimizationModule_2optimizers_2algorithms_2cfsqp_2cfsqp_8h.html#aa93f0eb578d23995850d61f7d61c55c1">FALSE</a>;
- <a name="l00342"></a>00342 signeq=make_dv(neqn);
- <a name="l00343"></a>00343
- <a name="l00344"></a>00344 nob=0;
- <a name="l00345"></a>00345 gmax=-bgbnd;
- <a name="l00346"></a>00346 glob_prnt.info=0;
- <a name="l00347"></a>00347 glob_prnt.iprint=iprint%10;
- <a name="l00348"></a>00348 ipp=iprint;
- <a name="l00349"></a>00349 glob_prnt.iter_mod=(int)<a class="code" href="utility_2old_2CFSQP_2ver__1_2cfsqp_8h.html#af037b35754d7ec5fc853e97112b7e6db">DMAX1</a>(iprint-iprint%10,1);
- <a name="l00350"></a>00350 glob_prnt.io=stdout;
- <a name="l00351"></a>00351 ncnstr=nineq+neq;
- <a name="l00352"></a>00352 glob_info.nnineq=nineq;
- <a name="l00353"></a>00353 <span class="keywordflow">if</span> (glob_prnt.iprint>0) {
- <a name="l00354"></a>00354 fprintf(glob_prnt.io,
- <a name="l00355"></a>00355 <span class="stringliteral">"\n\n CFSQP Version 2.5d (Released February 1998) \n"</span>);
- <a name="l00356"></a>00356 fprintf(glob_prnt.io,
- <a name="l00357"></a>00357 <span class="stringliteral">" Copyright (c) 1993 --- 1998 \n"</span>);
- <a name="l00358"></a>00358 fprintf(glob_prnt.io,
- <a name="l00359"></a>00359 <span class="stringliteral">" C.T. Lawrence, J.L. Zhou \n"</span>);
- <a name="l00360"></a>00360 fprintf(glob_prnt.io,
- <a name="l00361"></a>00361 <span class="stringliteral">" and A.L. Tits \n"</span>);
- <a name="l00362"></a>00362 fprintf(glob_prnt.io,
- <a name="l00363"></a>00363 <span class="stringliteral">" All Rights Reserved \n\n"</span>);
- <a name="l00364"></a>00364 }
- <a name="l00365"></a>00365 <span class="comment">/*-----------------------------------------------------*/</span>
- <a name="l00366"></a>00366 <span class="comment">/* Check the input data */</span>
- <a name="l00367"></a>00367 <span class="comment">/*-----------------------------------------------------*/</span>
- <a name="l00368"></a>00368 check(nparam,nf,nfsr,&Linfty,nineq,nineqn,neq,neqn,
- <a name="l00369"></a>00369 ncsrl,ncsrn,mode,&modem,eps,bgbnd,param);
- <a name="l00370"></a>00370 <span class="keywordflow">if</span> (glob_prnt.info==7) {
- <a name="l00371"></a>00371 *inform=glob_prnt.info;
- <a name="l00372"></a>00372 <span class="keywordflow">return</span>;
- <a name="l00373"></a>00373 }
- <a name="l00374"></a>00374
- <a name="l00375"></a>00375 maxit=(int)<a class="code" href="utility_2old_2CFSQP_2ver__1_2cfsqp_8h.html#af037b35754d7ec5fc853e97112b7e6db">DMAX1</a>(<a class="code" href="utility_2old_2CFSQP_2ver__1_2cfsqp_8h.html#af037b35754d7ec5fc853e97112b7e6db">DMAX1</a>(miter,10*<a class="code" href="utility_2old_2CFSQP_2ver__1_2cfsqp_8h.html#af037b35754d7ec5fc853e97112b7e6db">DMAX1</a>(nparam,ncnstr)),1000);
- <a name="l00376"></a>00376 feasb=<a class="code" href="MDO_2optimizationModule_2optimizers_2algorithms_2cfsqp_2cfsqp_8h.html#aa8cecfc5c5c054d2875c03e77b7be15d">TRUE</a>;
- <a name="l00377"></a>00377 f…
Large files files are truncated, but you can click here to view the full file