alpaqa 1.0.0a8
Nonconvex constrained optimization
Loading...
Searching...
No Matches
alm-driver.hpp
Go to the documentation of this file.
1#pragma once
2
6
7#include "options.hpp"
8#include "problem.hpp"
9#include "results.hpp"
10
11template <class InnerSolver>
12auto make_alm_solver(InnerSolver &&inner_solver, Options &opts) {
13 // Settings for the ALM solver
14 using ALMSolver = alpaqa::ALMSolver<InnerSolver>;
15 typename ALMSolver::Params alm_param;
16 alm_param.max_iter = 200;
17 alm_param.tolerance = 1e-8;
18 alm_param.dual_tolerance = 1e-8;
19 alm_param.print_interval = 1;
20 alm_param.print_precision = 1;
21 set_params(alm_param, "alm", opts);
22 return ALMSolver{alm_param, std::forward<InnerSolver>(inner_solver)};
23}
24
26
27template <class InnerSolver>
29 // Settings for the solver
30 typename InnerSolver::Params solver_param;
31 solver_param.max_iter = 50'000;
32 solver_param.print_interval = 0;
33 solver_param.stop_crit = alpaqa::PANOCStopCrit::ProjGradUnitNorm;
34 set_params(solver_param, "solver", opts);
35
36 if constexpr (requires { typename InnerSolver::Direction; }) {
37 // Settings for the direction provider
38 using Direction = typename InnerSolver::Direction;
39 typename Direction::DirectionParams dir_param;
40 typename Direction::AcceleratorParams accel_param;
41 set_params(dir_param, "dir", opts);
42 set_params(accel_param, "accel", opts);
43 return InnerSolver{
44 solver_param,
45 Direction{{
46 .accelerator = accel_param,
47 .direction = dir_param,
48 }},
49 };
50 } else {
51 return InnerSolver{solver_param};
52 }
53}
54
55template <class Solver>
57 std::ostream &os, unsigned N_exp) {
58 solver.os = &os;
59
60 // Initial guess
61 vec x = problem.initial_guess_x, y = problem.initial_guess_y;
62
63 // Solve the problem
64 auto stats = solver(problem.problem, x, y);
65
66 // Store the evaluation counters
67 auto evals = *problem.evaluations;
68
69 // Solve the problems again to average runtimes
70 auto avg_duration = stats.elapsed_time;
71 os.setstate(std::ios_base::badbit); // suppress output
72 for (unsigned i = 0; i < N_exp; ++i) {
73 x = problem.initial_guess_x;
74 y = problem.initial_guess_y;
75 auto s = solver(problem.problem, x, y);
76 if (s.status == alpaqa::SolverStatus::Interrupted) {
77 os.clear();
78 os << "\rInterrupted after " << i << " runs" << std::endl;
79 N_exp = i;
80 break;
81 }
82 avg_duration += s.elapsed_time;
83 }
84 os.clear();
85 avg_duration /= (N_exp + 1);
86
87 solver.os = &std::cout;
88
89 // Results
90 real_t final_γ = 0, final_h = 0;
91 if constexpr (requires { stats.inner.final_γ; })
92 final_γ = stats.inner.final_γ;
93 if constexpr (requires { stats.inner.final_h; })
94 final_h = stats.inner.final_h;
95 decltype(SolverResults::extra) extra{};
96 if constexpr (requires { stats.inner.linesearch_failures; })
97 extra.emplace_back(
98 "linesearch_failures",
99 static_cast<index_t>(stats.inner.linesearch_failures));
100 if constexpr (requires { stats.inner.linesearch_backtracks; })
101 extra.emplace_back(
102 "linesearch_backtracks",
103 static_cast<index_t>(stats.inner.linesearch_backtracks));
104 if constexpr (requires { stats.inner.stepsize_backtracks; })
105 extra.emplace_back(
106 "stepsize_backtracks",
107 static_cast<index_t>(stats.inner.stepsize_backtracks));
108 if constexpr (requires { stats.inner.lbfgs_failures; })
109 extra.emplace_back("lbfgs_failures",
110 static_cast<index_t>(stats.inner.lbfgs_failures));
111 if constexpr (requires { stats.inner.lbfgs_rejected; })
112 extra.emplace_back("lbfgs_rejected",
113 static_cast<index_t>(stats.inner.lbfgs_rejected));
114 return SolverResults{
115 .status = enum_name(stats.status),
116 .success = stats.status == alpaqa::SolverStatus::Converged,
117 .evals = evals,
118 .duration = avg_duration,
119 .solver = solver.get_name(),
120 .h = final_h,
121 .δ = stats.δ,
122 .ε = stats.ε,
123 .γ = final_γ,
124 .Σ = stats.norm_penalty,
125 .solution = x,
126 .multipliers = y,
127 .multipliers_bounds = vec(0),
128 .outer_iter = static_cast<index_t>(stats.outer_iterations),
129 .inner_iter = static_cast<index_t>(stats.inner.iterations),
130 .extra = std::move(extra),
131 };
132}
auto make_inner_solver(Options &opts)
Definition: alm-driver.hpp:28
SolverResults run_alm_solver(LoadedProblem &problem, Solver &solver, std::ostream &os, unsigned N_exp)
Definition: alm-driver.hpp:56
auto make_alm_solver(InnerSolver &&inner_solver, Options &opts)
Definition: alm-driver.hpp:12
Augmented Lagrangian Method solver.
Definition: alm.hpp:96
#define USING_ALPAQA_CONFIG(Conf)
Definition: config.hpp:42
std::string_view enum_name(Ipopt::ApplicationReturnStatus s)
Definition: ipopt-enums.hpp:6
@ ProjGradUnitNorm
∞-norm of the projected gradient with unit step size:
@ Interrupted
Solver was interrupted by the user.
@ Converged
Converged and reached given tolerance.
decltype(auto) set_params(T &t, std::string_view prefix, Options &opts)
Definition: options.hpp:29
vec initial_guess_y
Unknowns.
Definition: problem.hpp:20
vec initial_guess_x
Definition: problem.hpp:19
alpaqa::TypeErasedProblem< config_t > problem
Definition: problem.hpp:15
std::shared_ptr< alpaqa::EvalCounter > evaluations
Definition: problem.hpp:18
std::vector< std::pair< std::string, any_stat_t > > extra
Definition: results.hpp:36
std::string_view status
Definition: results.hpp:24