Lagrange-type functions in constrained non-convex optimization

The outer archives are busy

by Aleksandr Moiseevich Rubinov, A. Rubinov, Xiao-qi Yang

About this book

Consider the following mathematical programming problem with inequality constraints: min f(x) subject to x X, gi(x) 0 i = 1, . . . , m, (1.1.1) where f and gi, i =1, . . . , m are real-valued functions defined on a metric space X.

Match Score

Create a free account to see Match Scores on books the community has marked — once you’ve set your preferences.

Create free account

Marks of the Realm

Marks left by readers of this tome

No community marks yet — be the first to inscribe this tome.

Pacing

—out of 5

Horror / Dark Elements

—out of 5

Romance

—out of 5

Spice Level

—out of 5

LGBTQ+ Representation

—out of 5

Social & Political Themes in Stories

—out of 5

Inscribe Your Rating

Mark this tome across each content category