Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 69b1e16

Browse files
authored
Update README.md
1 parent 3119664 commit 69b1e16

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -163,7 +163,7 @@ We can see that the algorithm quickly converges to the optimal point (see Fig. 5
163163
For more examples refer to the python scripts in "examples" folder. [https://github.com/tsyet12/Duelist-Algorithm-Python/tree/master/examples]
164164

165165

166-
# Dealing with Complex Constraint using Karush-Kuhn-Tucker (KKT) conditions
166+
# Dealing with Complex Constraint conditions
167167

168168
There will be some problems that have complex constraints. For example, constraints which depends on two or more manipulated variables.
169169

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /