ROL
ROL_TypeG_InteriorPointAlgorithm.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_TYPEG_INTERIORPOINTALGORITHM_H
45#define ROL_TYPEG_INTERIORPOINTALGORITHM_H
46
49#include "ROL_Secant.hpp"
50
54
55namespace ROL {
56namespace TypeG {
57
58template<typename Real>
60private:
61 const Ptr<Secant<Real>> secant_;
62
63 Real mumin_;
64 Real mumax_;
65 Real rho_;
67 Real kappaD_;
68 Real gtol_;
69 Real ctol_;
70 Real stol_;
75
76 ROL::ParameterList list_;
78
79 std::string stepname_;
80
81 bool print_;
84
86
87 using TypeG::Algorithm<Real>::status_;
88 using TypeG::Algorithm<Real>::state_;
89 using TypeG::Algorithm<Real>::proj_;
90
92 const Vector<Real> &g,
93 const Vector<Real> &l,
94 const Vector<Real> &c,
98 Vector<Real> &pwa,
99 Vector<Real> &dwa,
100 std::ostream &outStream = std::cout);
101
102 void updateState(const Vector<Real> &x,
103 const Vector<Real> &l,
106 Constraint<Real> &con,
107 Vector<Real> &pwa,
108 Vector<Real> &dwa,
109 std::ostream &outStream = std::cout);
110public:
111
112 InteriorPointAlgorithm(ParameterList &list, const Ptr<Secant<Real>> &secant_ = nullPtr);
113
114 using TypeG::Algorithm<Real>::run;
115 void run( Vector<Real> &x,
116 const Vector<Real> &g,
117 Objective<Real> &obj,
119 Constraint<Real> &econ,
120 Vector<Real> &emul,
121 const Vector<Real> &eres,
122 std::ostream &outStream = std::cout) override;
123
124 void writeHeader( std::ostream& os ) const override;
125
126 void writeName( std::ostream& os ) const override;
127
128 void writeOutput( std::ostream& os, const bool print_header = false ) const override;
129
130}; // class ROL::TypeG::InteriorPointAlgorithm
131
132} // namespace TypeG
133} // namespace ROL
134
136
137#endif
Provides the interface to apply upper and lower bound constraints.
Defines the general constraint operator interface.
Provides the interface to evaluate objective functions.
Provides interface for and implements limited-memory secant operators.
Provides an interface to run general constrained optimization algorithms.
const Ptr< CombinedStatusTest< Real > > status_
Ptr< PolyhedralProjection< Real > > proj_
const Ptr< AlgorithmState< Real > > state_
InteriorPointAlgorithm(ParameterList &list, const Ptr< Secant< Real > > &secant_=nullPtr)
void updateState(const Vector< Real > &x, const Vector< Real > &l, InteriorPointObjective< Real > &ipobj, BoundConstraint< Real > &bnd, Constraint< Real > &con, Vector< Real > &pwa, Vector< Real > &dwa, std::ostream &outStream=std::cout)
void writeName(std::ostream &os) const override
Print step name.
void writeHeader(std::ostream &os) const override
Print iterate header.
void writeOutput(std::ostream &os, const bool print_header=false) const override
Print iterate status.
void run(Vector< Real > &x, const Vector< Real > &g, Objective< Real > &obj, BoundConstraint< Real > &bnd, Constraint< Real > &econ, Vector< Real > &emul, const Vector< Real > &eres, std::ostream &outStream=std::cout) override
Run algorithm on general constrained problems (Type-G). This is the primary Type-G interface.
void initialize(Vector< Real > &x, const Vector< Real > &g, const Vector< Real > &l, const Vector< Real > &c, InteriorPointObjective< Real > &ipobj, BoundConstraint< Real > &bnd, Constraint< Real > &con, Vector< Real > &pwa, Vector< Real > &dwa, std::ostream &outStream=std::cout)
Defines the linear algebra or vector space interface.