We consider constraint qualifications in nonlinear programming which can be reduced to the classical Mangasarian–Fromovitz condition with the help of a new parametrization of the set of feasible points. Click to show full abstract
We consider constraint qualifications in nonlinear programming which can be reduced to the classical Mangasarian–Fromovitz condition with the help of a new parametrization of the set of feasible points.
Keywords:
note mangasarian;
mangasarian fromovitz;
fromovitz like;
constraint qualifications
Journal Title: Journal of Optimization Theory and Applications
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Optimization Theory and Applications
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!