11#include <alpaqa-version.h>
24#ifdef ALPAQA_WITH_CASADI
25#include <casadi/config.h>
27#ifdef ALPAQA_WITH_JSON
28#include <nlohmann/json_fwd.hpp>
30#ifdef ALPAQA_WITH_IPOPT
31#include <IpoptConfig.h>
45namespace fs = std::filesystem;
46using namespace std::string_view_literals;
52 dl: Dynamically loaded problem using the DLProblem class.
53 Specify the name of the registration function using the
54 problem.register option, e.g. problem.register=register_alpaqa_problem.
55 Further options can be passed to the problem using
56 problem.<key>[=<value>].
57 cs: Load a CasADi problem using the CasADiProblem class.
58 If a .tsv file with the same name as the shared library file exists,
59 the bounds and parameters will be loaded from that file. See
60 CasADiProblem::load_numerical_data for more details.
61 The problem parameter can be set using the problem.param option.
62 cu: Load a CUTEst problem using the CUTEstProblem class.
66 PANOC solver with the given direction.
67 Directions include: lbfgs, struclbfgs, anderson.
68 zerofpr[.<direction>]:
69 ZeroFPR solver, supports the same directions as PANOC.
71 PANTR solver. Requires products with the Hessian of the augmented
72 Lagrangian (unless dir.finite_diff=true).
74 FISTA (fast iterative shrinkage-thresholding algorithm). Only for
77 Ipopt interior point solver. Requires Jacobian of the constraints
78 and Hessian of the Lagrangian (unless finite memory is enabled).
80 QPALM proximal ALM QP solver. Assumes that the problem is a QP.
81 Requires Jacobian of the constraints and Hessian of the Lagrangian.
84 Solver-specific options can be specified as key-value pairs, where the
85 keys use periods to access struct members. For example,
86 solver.Lipschitz.L_0=1e3.
88 solver: Parameters for the main (inner) solver.
89 alm: Parameters for the outer ALM solver (if applicable).
90 dir: Parameters for solver's direction provider (if applicable).
91 accel: Parameters for direction's accelerator (if applicable).
92 out: File to write output to (default: -, i.e. standard output).
93 sol: Folder to write the solutions (and optional statistics) to.
94 x0: Initial guess for the solution.
95 mul_g0: Initial guess for the multipliers of the general constraints.
96 mul_x0: Initial guess for the multipliers of the bound constraints on x.
97 num_exp: Repeat the experiment this many times for more accurate timings.
98 extra_stats: Log more per-iteration solver statistics, such as step sizes,
99 Newton step acceptance, and residuals. Requires `sol' to be set.
101 The prefix @ can be added to the values of x0, mul_g0 and mul_x0 to read
102 the values from the given CSV file.
104 Options can be loaded from a JSON file by using an @ prefix. For example,
105 an argument @options.json loads the options from a file options.json in the
106 current directory. Multiple JSON files are processed in the order they
107 appear in the command line arguments. Options specified on the command line
108 always have precedence over options in a JSON file, regardless of order.
111 alpaqa-driver problem.so \
112 problem.register=register_alpaqa_problem \
113 problem.custom_arg=foo \
114 method=panoc.struclbfgs \
116 alm.{tolerance,dual_tolerance}=1e-8 \
117 solver.print_interval=50 \
120 alpaqa-driver cs:build/casadi_problem.so \
121 @options/default.json \
122 problem.param=1,2,3 \
124 solver.tol=1e-8 solver.constr_viol_tol=1e-8 \
125 solver.warm_start_init_point=yes \
127 mul_g0=@/some/other/file.csv \
128 mul_x0=@/yet/another/file.csv
132 const auto *opts =
" [<problem-type>:][<path>/]<name> [method=<solver>] "
133 "[<key>=<value>...]\n";
134 std::cout <<
"alpaqa-driver " ALPAQA_VERSION_FULL
" (" << alpaqa_build_time
136 " Command-line interface to the alpaqa solvers.\n"
137 " alpaqa is published under the LGPL-3.0.\n"
138 " https://github.com/kul-optec/alpaqa"
141 << a0 << opts <<
docs << std::endl;
142 std::cout <<
"Third-party libraries:\n"
143 <<
" * Eigen " << EIGEN_WORLD_VERSION <<
'.'
144 << EIGEN_MAJOR_VERSION <<
'.' << EIGEN_MINOR_VERSION
145 <<
" (https://gitlab.com/libeigen/eigen) - MPL-2.0\n"
146#ifdef ALPAQA_WITH_CASADI
147 <<
" * CasADi " CASADI_VERSION_STRING
148 " (https://github.com/casadi/casadi) - LGPL-3.0-or-later\n"
150#ifdef ALPAQA_WITH_CUTEST
152 " (https://github.com/ralna/CUTEst) - BSD-3-Clause\n"
154#ifdef ALPAQA_WITH_LBFGSB
155 <<
" * L-BFGS-B 3.0 "
156 "(http://users.iems.northwestern.edu/~nocedal/lbfgsb.html) - "
159#ifdef ALPAQA_WITH_IPOPT
160 <<
" * Ipopt " IPOPT_VERSION
161 " (https://github.com/coin-or/Ipopt) - EPL-2.0\n"
162 <<
" * MUMPS (https://mumps-solver.org) - CECILL-C\n"
163 <<
" * OpenBLAS (https://github.com/OpenMathLib/OpenBLAS) - "
166#ifdef ALPAQA_WITH_QPALM
167 <<
" * QPALM " QPALM_VERSION_STR
168 " (https://github.com/kul-optec/QPALM) - LGPL-3.0\n"
170#ifdef ALPAQA_WITH_JSON
171 <<
" * nlohmann/json " << NLOHMANN_JSON_VERSION_MAJOR <<
'.'
172 << NLOHMANN_JSON_VERSION_MINOR <<
'.'
173 << NLOHMANN_JSON_VERSION_PATCH
174 <<
" (https://github.com/nlohmann/json) - MIT\n"
180 std::cout << ALPAQA_VERSION_FULL
" (" << ALPAQA_BUILD_TIME <<
")\n";
186 auto tok_pos = s.find(tok);
187 if (tok_pos == s.npos)
188 return std::make_tuple(std::string_view{}, s);
189 std::string_view key{s.begin(), s.begin() + tok_pos};
190 std::string_view rem{s.begin() + tok_pos + 1, s.end()};
191 return std::make_tuple(key, rem);
195 std::string out_path =
"-";
198 if (out_fstream.open(out_path); !out_fstream)
199 throw std::runtime_error(
"Unable to open '" + out_path +
"'");
200 return out_fstream.is_open() ? out_fstream : std::cout;
204 std::string sol_path;
210 bool rel_to_exe = argv[1][0] ==
'^';
211 std::string_view prob_path_s = argv[1] +
static_cast<ptrdiff_t
>(rel_to_exe);
212 std::string_view prob_type;
213 std::tie(prob_type, prob_path_s) =
split_once(prob_path_s,
':');
214 fs::path prob_path{prob_path_s};
216 prob_path = fs::canonical(fs::path(argv[0])).parent_path() / prob_path;
217 return std::make_tuple(std::move(prob_path), prob_type);
221 os <<
"Loaded problem \"" << problem.
name <<
"\"\n"
222 <<
"Number of variables: " << problem.
problem.
get_n() <<
"\n"
223 <<
"Number of constraints: " << problem.
problem.
get_m() <<
"\n";
225 os <<
"Nonzeros in Jg: " << *problem.
nnz_jac_g <<
"\n";
227 os <<
"Nonzeros in ∇²L: " << *problem.
nnz_hess_L <<
"\n";
229 os <<
"Nonzeros in ∇²ψ: " << *problem.
nnz_hess_ψ <<
"\n";
231 os <<
"Box constraints:"
238 os <<
"General constraints:"
244 os <<
"Provided functions:\n";
249 std::string method =
"panoc", direction;
253 std::map<std::string_view, solver_builder_func> solvers{
260 auto solver_it = solvers.find(method);
261 if (solver_it == solvers.end())
262 throw std::invalid_argument(
263 "Unknown solver '" + std::string(method) +
"'\n" +
264 " Available solvers: " +
267 return std::make_tuple(std::move(solver_it->second), direction);
272 std::span<const char *> argv) {
274 auto timestamp_str = std::to_string(results.
timestamp);
277 if (name ==
"PROBLEM")
279 auto suffix =
'_' + name +
'_' + timestamp_str +
'_' + rnd_str;
280 fs::create_directories(sol_output_dir);
281 std::array solutions{
282 std::tuple{
"solution",
"sol_x", &sol_res.solution},
283 std::tuple{
"multipliers for g",
"mul_g", &sol_res.multipliers},
284 std::tuple{
"multipliers for x",
"mul_x", &sol_res.multipliers_bounds},
286 for (
auto [name, fname, value] : solutions) {
287 if (value->size() == 0)
289 auto pth = sol_output_dir / (std::string(fname) + suffix +
".csv");
290 os <<
"Writing " << name <<
" to " << pth << std::endl;
291 std::ofstream output_file(pth);
295 auto pth = sol_output_dir / (
"cmdline" + suffix +
".txt");
296 os <<
"Writing arguments to " << pth << std::endl;
297 std::ofstream output_file(pth);
298 for (
const char *arg : argv)
299 output_file << std::quoted(arg,
'\'') <<
' ';
302 if (solver->has_statistics()) {
303 auto pth = sol_output_dir / (
"stats" + suffix +
".csv");
304 os <<
"Writing statistics to " << pth << std::endl;
305 std::ofstream output_file(pth);
306 solver->write_statistics_to_stream(output_file);
310int main(
int argc,
const char *argv[])
try {
312 SetConsoleOutputCP(CP_UTF8);
321 if (argv[1] ==
"-h"sv || argv[1] ==
"--help"sv || argv[1] ==
"?"sv)
323 if (argv[1] ==
"-v"sv || argv[1] ==
"--version"sv)
325 if (argv[1] ==
"--complete"sv) {
332 std::span args{argv,
static_cast<size_t>(argc)};
333 Options opts{argc - 2, argv + 2};
336 std::ofstream out_fstream;
349 auto solver = solver_builder(direction, opts);
352 os <<
"Loading " << prob_path <<
" ..." << std::endl;
353 auto problem =
load_problem(prob_type, prob_path.parent_path(),
354 prob_path.filename(), opts);
359 auto used = opts.used();
360 auto unused_opt = std::ranges::find(used, 0);
361 auto unused_idx =
static_cast<size_t>(unused_opt - used.begin());
362 if (unused_opt != used.end())
363 throw std::invalid_argument(
"Unused option: " +
364 std::string(opts.options()[unused_idx]));
367 auto solver_results = solver->run(problem, os);
370 real_t f = problem.problem.eval_f(solver_results.solution);
372 problem.problem, solver_results.solution, solver_results.multipliers);
375 .solver_results = solver_results,
376 .objective = f + solver_results.h,
377 .smooth_objective = f,
379 .options = opts.options(),
380 .timestamp = timestamp_ms<std::chrono::system_clock>().count(),
387 if (!sol_output_dir.empty())
390}
catch (std::exception &e) {
392 << e.what() << std::endl;
auto get_solver_builder(Options &opts)
std::string get_output_paths(Options &opts)
std::ostream & get_output_stream(Options &opts, std::ofstream &out_fstream)
auto get_problem_path(const char *const *argv)
void print_usage(const char *a0)
void store_solution(const fs::path &sol_output_dir, std::ostream &os, BenchmarkResults &results, auto &solver, std::span< const char * > argv)
void print_problem_description(std::ostream &os, LoadedProblem &problem)
auto split_once(std::string_view s, char tok='.')
Split the string s on the first occurrence of tok.
int main(int argc, const char *argv[])
length_t get_n() const
[Required] Number of decision variables.
length_t get_m() const
[Required] Number of constraints.
#define USING_ALPAQA_CONFIG(Conf)
std::string demangled_typename(const std::type_info &t)
Get the pretty name of the given type as a string.
SharedSolverWrapper make_fista_driver(std::string_view direction, Options &opts)
void print_provided_functions(std::ostream &os, const TypeErasedProblem< Conf > &problem)
SharedSolverWrapper make_ipopt_driver(std::string_view, Options &)
SharedSolverWrapper make_lbfgsb_driver(std::string_view, Options &)
auto split_key(std::string_view full, char tok='.')
Split the string full on the first occurrence of tok.
std::string join(std::ranges::input_range auto strings, join_opt opt={})
Join the list of strings into a single string, using the separator given by opt.
std::ostream & print_csv(std::ostream &os, const Eigen::DenseBase< Derived > &M, Args &&...args)
KKTError< Conf > compute_kkt_error(const TypeErasedProblem< Conf > &problem, crvec< Conf > x, crvec< Conf > y)
decltype(auto) set_params(T &t, std::string_view prefix, Options &opts)
SharedSolverWrapper make_zerofpr_driver(std::string_view direction, Options &opts)
SharedSolverWrapper make_panoc_driver(std::string_view direction, Options &opts)
SharedSolverWrapper make_pantr_driver(std::string_view direction, Options &opts)
void print_completion(std::string_view method, std::string_view params)
LoadedProblem load_problem(std::string_view type, const fs::path &dir, const fs::path &file, Options &opts)
std::optional< length_t > nnz_hess_L
std::optional< ConstrCount > general_constr_count
std::optional< length_t > nnz_hess_ψ
alpaqa::TypeErasedProblem< config_t > problem
std::optional< ConstrCount > box_constr_count
std::optional< length_t > nnz_jac_g
SharedSolverWrapper make_qpalm_driver(std::string_view, Options &)
std::string random_hex_string(auto &&rng)
void print_results(std::ostream &os, const BenchmarkResults &results)
SolverResults solver_results
Double-precision double configuration.