Abstract
AbstractThe purpose of this work is to show the relation between the Kuhn‐Tucker and the gradient‐projection conditions for constrained maximization (minimization) problems. A similar relationship exists between Kuhn‐Tucker‐type conditions and gradient‐projection‐type conditions for certain constrained saddle‐point problems. This latter relationship may lead to a computational algorithm for these constrained saddle‐point problems.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
