Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A constructive proof of the Kuhn-Tucker multiplier rule

From MaRDI portal
Publication:2551067
Jump to:navigation, search

DOI10.1016/0022-247X(69)90153-XzbMath0232.90051MaRDI QIDQ2551067

Edward Beltrami

Publication date: 1969

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)



Mathematics Subject Classification ID

Convex programming (90C25)


Related Items

A short elementary proof of the Lagrange multiplier theorem, Continuous gap contact formulation based on the screened Poisson equation, A penalty function proof of a Lagrange multiplier theorem with application to linear delay systems, A generalization of Lagrange's method of undetermined multipliers using zero-zone functionals, A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization, Refinements of necessary optimality conditions in nondifferentiable programming. I, On penalty function methods for nonlinear programming problems, Über eine Penalty-Methode



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • On infinite-dimensional convex programs
  • On a Method of Courant for Minimizing Functionals
  • Contributions to the Theory of Generalized Inverses
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2551067&oldid=15295637"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 06:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki