Skip to main content
Computer Science

Return to Question

More specific title. Added tags.
Source Link
John L.
John L.
  • 39.1k
  • 4
  • 34
  • 91

How can ideas like Lagrange Multipliers and Penalty Method be applied for solvingto optimize algorithms?

I have a programming assignment which I was told that is solvable with some DP algorithm. The question involves some $k$ which is essentially a constraint. In particular the question is a variant of LIS problem where at most $k$ exceptions (restarts) are allowed.

But I know that there is a better solution. My professor mentioned Lagrange Multipliers and giving a penalty for each restart. But after googling these terms I wasn't able to find out somethinganything related to algorithms. IEvery article is about Calculus and function optimization. I also read about them on Wikipedia but I can't figure out how to use them. Also every article is related to Calculus and function optimization.

Is there a keyword that can describe better what I want to read about?

How can ideas like Lagrange Multipliers and Penalty Method be applied for solving algorithms?

I have a programming assignment which I was told that is solvable with some DP algorithm. The question involves some $k$ which is essentially a constraint. In particular the question is a variant of LIS problem where at most $k$ exceptions (restarts) are allowed.

But I know that there is a better solution. My professor mentioned Lagrange Multipliers and giving a penalty for each restart. But after googling these terms I wasn't able to find out something related to algorithms. I read about them on Wikipedia but I can't figure out how to use them. Also every article is related to Calculus and function optimization.

Is there a keyword that can describe better what I want to read about?

How can Lagrange Multipliers and Penalty Method be applied to optimize algorithms?

I have a programming assignment which I was told that is solvable with some DP algorithm. The question is a variant of LIS problem where at most $k$ exceptions (restarts) are allowed.

But I know that there is a better solution. My professor mentioned Lagrange Multipliers and giving a penalty for each restart. But after googling these terms I wasn't able to find out anything related to algorithms. Every article is about Calculus and function optimization. I also read about them on Wikipedia but I can't figure out how to use them.

Is there a keyword that can describe better what I want to read?

Source Link
user113632
user113632

How can ideas like Lagrange Multipliers and Penalty Method be applied for solving algorithms?

I have a programming assignment which I was told that is solvable with some DP algorithm. The question involves some $k$ which is essentially a constraint. In particular the question is a variant of LIS problem where at most $k$ exceptions (restarts) are allowed.

But I know that there is a better solution. My professor mentioned Lagrange Multipliers and giving a penalty for each restart. But after googling these terms I wasn't able to find out something related to algorithms. I read about them on Wikipedia but I can't figure out how to use them. Also every article is related to Calculus and function optimization.

Is there a keyword that can describe better what I want to read about?