Kona: A Software Library for De-Constrained Optimization. The Kona library implements a set of algorithms for PDE-constrained optimization problems. An important aspect of its implementation is that it makes no assumptions regarding the dimension of the control, state, or constraint vectors. The user must implement these vectors and, through reverse communication, Kona asks the user to perform various operations on these vectors. In principle, this model should allow Kona to be used in a variety of parallel environments, because it remains agnostic to how the user implements the vectors. The best way to understand how it works is with an example, so please refer to test_kona.cpp (for example) in the test directory.

References in zbMATH (referenced in 1 article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Hicken, Jason E.; Dener, Alp: A flexible iterative solver for nonconvex, equality-constrained quadratic subproblems (2015)