ROL
ROL_TypeU_BundleAlgorithm.hpp
Go to the documentation of this file.
1 // @HEADER
2 // ************************************************************************
3 //
4 // Rapid Optimization Library (ROL) Package
5 // Copyright (2014) 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 lead developers:
38 // Drew Kouri (dpkouri@sandia.gov) and
39 // Denis Ridzal (dridzal@sandia.gov)
40 //
41 // ************************************************************************
42 // @HEADER
43 
44 #ifndef ROL_TYPEU_BUNDLEALGORITHM_H
45 #define ROL_TYPEU_BUNDLEALGORITHM_H
46 
47 #include "ROL_TypeU_Algorithm.hpp"
48 #include "ROL_Bundle_U.hpp"
49 #include "ROL_LineSearch_U.hpp"
50 
56 namespace ROL {
57 namespace TypeU {
58 
59 template<typename Real>
60 class BundleAlgorithm : public Algorithm<Real> {
61 private:
62  // Bundle
63  Ptr<Bundle_U<Real>> bundle_; // Bundle of subgradients and linearization errors
64  Ptr<LineSearch_U<Real>> lineSearch_; // Line-search object for nonconvex problems
65 
66  // Dual cutting plane solution
67  unsigned QPiter_; // Number of QP solver iterations
68  unsigned QPmaxit_; // Maximum number of QP iterations
69  Real QPtol_; // QP subproblem tolerance
70 
71  // Step flag
72  int step_flag_; // Whether serious or null step
73 
74  // Aggregate subgradients, linearizations, and distance measures
75 
76  // Algorithmic parameters
77  Real T_;
78  Real tol_;
79  Real m1_;
80  Real m2_;
81  Real m3_;
82  Real nu_;
83 
84  // Line-search parameters
85  int ls_maxit_;
86 
88  bool isConvex_;
89 
92 
96 
97 public:
98 
99  BundleAlgorithm( ParameterList &parlist,
100  const Ptr<LineSearch_U<Real>> &lineSearch = nullPtr );
101 
102  void run( Vector<Real> &x,
103  const Vector<Real> &g,
104  Objective<Real> &obj,
105  std::ostream &outStream = std::cout) override;
106 
107  void writeHeader( std::ostream& os ) const override;
108 
109  void writeName( std::ostream& os) const override;
110 
111  void writeOutput( std::ostream& os, const bool print_header = false ) const override;
112 
113 private:
114 
115  void initialize(const Vector<Real> &x, const Vector<Real> &g,
116  Objective<Real> &obj, std::ostream &outStream = std::cout);
117 
118 }; // class ROL::BundleAlgorithm
119 } // namespace TypeU
120 } // namespace ROL
121 
123 
124 #endif
Provides interface for and implements line searches.
Provides the interface to evaluate objective functions.
void writeName(std::ostream &os) const override
Print step name.
BundleAlgorithm(ParameterList &parlist, const Ptr< LineSearch_U< Real >> &lineSearch=nullPtr)
Defines the linear algebra or vector space interface.
Definition: ROL_Vector.hpp:80
void initialize(const Vector< Real > &x, const Vector< Real > &g, Objective< Real > &obj, std::ostream &outStream=std::cout)
void writeHeader(std::ostream &os) const override
Print iterate header.
Provides an interface to run unconstrained optimization algorithms.
void run(Vector< Real > &x, const Vector< Real > &g, Objective< Real > &obj, std::ostream &outStream=std::cout) override
Run algorithm on unconstrained problems (Type-U). This general interface supports the use of dual opt...
void writeOutput(std::ostream &os, const bool print_header=false) const override
Print iterate status.
Provides an interface to run trust-bundle methods for unconstrained optimization algorithms.
Ptr< LineSearch_U< Real > > lineSearch_