// @HEADER // ***************************************************************************** // Rapid Optimization Library (ROL) Package // // Copyright 2014 NTESS and the ROL contributors. // SPDX-License-Identifier: BSD-3-Clause // ***************************************************************************** // @HEADER #pragma once #ifndef L1_OPTIMIZATION_PROBLEM_HPP #define L1_OPTIMIZATION_PROBLEM_HPP #include "ROL_Bounds.hpp" #include "ROL_BoundConstraint_Partitioned.hpp" #include "ROL_OptimizationProblem.hpp" #include "l1_penalty_objective.hpp" #include "l1_penalty_constraint.hpp" #include "identity_constraint.hpp" namespace ROL { template Ptr> make_l1_penalty_problem( const Ptr>& obj, const Ptr>& x, const Ptr>& con, const Ptr>& emul, Real gamma ) { auto r = emul->clone(); auto s = emul->clone(); auto lb = emul->clone(); auto ub = emul->clone(); r->setScalar(1.0); s->setScalar(1.0); lb->zero(); ub->setScalar(ROL_INF()); std::vector>> xrs = {x,r,s}; auto xp = makePtr>( xrs ); auto x_bnd = makePtr>(*x); auto rs_bnd = makePtr>(lb,ub); x_bnd->deactivate(); rs_bnd->activateLower(); rs_bnd->deactivateUpper(); auto bnds = std::vector>>{{x_bnd,rs_bnd,rs_bnd}}; auto bnd = makePtr>(bnds,xrs); auto lp_obj = makePtr>(obj,*emul,gamma); auto lp_con = makePtr>(con); return makePtr>(lp_obj,xp,bnd,lp_con,emul); } template Ptr> make_l1_penalty_problem( const Ptr>& obj, const Ptr>& x, Real gamma ) { Ptr> con = makePtr>(); return make_l1_penalty_problem(obj,x,con,x,gamma); } } // namespace ROL #endif // L1_OPTIMIZATION_PROBLEM_HPP