MoochoPack : Framework for Large-Scale Optimization Algorithms  Version of the Day
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
MoochoPack_ReducedHessianSecantUpdateLPBFGS_Strategy.hpp
1 // @HEADER
2 // ***********************************************************************
3 //
4 // Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
5 // Copyright (2003) Sandia Corporation
6 //
7 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
8 // license for use of this work by or on behalf of the U.S. Government.
9 //
10 // Redistribution and use in source and binary forms, with or without
11 // modification, are permitted provided that the following conditions are
12 // met:
13 //
14 // 1. Redistributions of source code must retain the above copyright
15 // notice, this list of conditions and the following disclaimer.
16 //
17 // 2. Redistributions in binary form must reproduce the above copyright
18 // notice, this list of conditions and the following disclaimer in the
19 // documentation and/or other materials provided with the distribution.
20 //
21 // 3. Neither the name of the Corporation nor the names of the
22 // contributors may be used to endorse or promote products derived from
23 // this software without specific prior written permission.
24 //
25 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
26 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
29 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
30 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
31 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
32 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
33 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
34 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
35 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 //
37 // Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov)
38 //
39 // ***********************************************************************
40 // @HEADER
41 
42 #ifndef REDUCED_HESSIAN_SECANT_UPDATE_LPBFGS_STRATEGY_H
43 #define REDUCED_HESSIAN_SECANT_UPDATE_LPBFGS_STRATEGY_H
44 
45 #include "MoochoPack_ReducedHessianSecantUpdateBFGSProjected_Strategy.hpp"
46 #include "MoochoPack_BFGSUpdate_Strategy.hpp"
47 #include "MoochoPack_quasi_newton_stats.hpp"
48 #include "MoochoPack_act_set_stats.hpp"
49 #include "ConstrainedOptPack_MatrixHessianSuperBasic.hpp"
52 
53 namespace MoochoPack {
54 
60 {
61 public:
62 
67 
71  STANDARD_MEMBER_COMPOSITION_MEMBERS( size_type, min_num_updates_proj_start );
72 
77  STANDARD_MEMBER_COMPOSITION_MEMBERS( size_type, max_num_updates_proj_start );
78 
82  STANDARD_MEMBER_COMPOSITION_MEMBERS( size_type, num_superbasics_switch_dense );
83 
87  STANDARD_MEMBER_COMPOSITION_MEMBERS( size_type, num_add_recent_updates );
88 
91  const proj_bfgs_updater_ptr_t& proj_bfgs_updater = NULL
92  ,size_type min_num_updates_proj_start = 0
93  ,size_type max_num_updates_proj_start = 999999
94  ,size_type num_superbasics_switch_dense = 500
95  ,size_type num_add_recent_updates = 10
96  );
97 
99  bool perform_update(
100  DVectorSlice* s_bfgs, DVectorSlice* y_bfgs, bool first_update
101  ,std::ostream& out, EJournalOutputLevel olevel, NLPAlgo *algo, NLPAlgoState *s
102  ,MatrixOp *rHL_k
103  );
105  void print_step( std::ostream& out, const std::string& leading_str ) const;
106 
107 private:
108 
109  // //////////////////////////////
110  // Private types
111 
112  // /////////////////////////////
113  // Private data members
114 
115  quasi_newton_stats_iq_member quasi_newton_stats_;
116  act_set_stats_iq_member act_set_stats_;
117 
118 }; // end class ReducedHessianSecantUpdateLPBFGS_Strategy
119 
120 } // end namespace MoochoPack
121 
122 #endif // REDUCED_HESSIAN_SECANT_UPDATE_LPBFGS_STRATEGY_H
Strategy interface for performing secant updates {abstract}.
bool perform_update(DVectorSlice *s_bfgs, DVectorSlice *y_bfgs, bool first_update, std::ostream &out, EJournalOutputLevel olevel, NLPAlgo *algo, NLPAlgoState *s, MatrixOp *rHL_k)
rSQP Algorithm control class.
ReducedHessianSecantUpdateLPBFGS_Strategy(const proj_bfgs_updater_ptr_t &proj_bfgs_updater=NULL, size_type min_num_updates_proj_start=0, size_type max_num_updates_proj_start=999999, size_type num_superbasics_switch_dense=500, size_type num_add_recent_updates=10)
STANDARD_COMPOSITION_MEMBERS(ReducedHessianSecantUpdateBFGSProjected_Strategy, proj_bfgs_updater)
<<std comp>="">> members for the strategy object that will perform dense projected BFGS updating...
Perform BFGS updates on only the free independent (super basic) variables.
Reduced space SQP state encapsulation interface.
size_t size_type
Class for object that attempts to return an IterQuantityAccess<QuasiNewtonStats> from an AlgorithmSta...
Perform BFGS updates on only the free independent (super basic) variables.
STANDARD_MEMBER_COMPOSITION_MEMBERS(size_type, min_num_updates_proj_start)
Set the minimum number of BFGS updates to perform on the LBFGS matrix before considering switching to...
Class for object that attempts to return an IterQuantityAccess<ActSetStats> from an AlgorithmState ob...
void print_step(std::ostream &out, const std::string &leading_str) const