Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merit function scaling #32

Open
ManifoldFR opened this issue Aug 24, 2022 · 0 comments
Open

Merit function scaling #32

ManifoldFR opened this issue Aug 24, 2022 · 0 comments
Labels
enhancement New feature or request

Comments

@ManifoldFR
Copy link
Member

ManifoldFR commented Aug 24, 2022

At the moment, the merit function looks like (for the primal, proximal augmented Lagrangian with no constraints other than system dynamics)

$$ \mathcal{L}_k(\mathbf x, \mathbf u; \boldsymbol\lambda^k) = \sum_{i=0}^{N-1} \ell_i(x_i, u_i) + \frac{1}{2\mu_k} \| f(x_i, u_i, x_{i+1}) + \mu_k\lambda_{i+1}^k \|^2_2 + \frac{\rho_k}2 \| (\mathbf x, \mathbf u) \ominus (\mathbf x^k, \mathbf u^k) \|_2^2 $$

The issue here is the scaling of the penalty function, which scales with the number of nodes N and makes the merit function much steeper for problems with more discretization nodes.

My idea:

  • keep (μ_k) the same and controlled by BCL (or filter in the future see Filter line-search #31)
  • scale the penalty terms according to number of nodes or timestep
  • adjust the direction computation accordingly
@ManifoldFR ManifoldFR added the enhancement New feature or request label Aug 24, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

Successfully merging a pull request may close this issue.

1 participant