Showing math.OCShow all
3 papers · 1 filter
math.OC2022
The Performance of MBFGS with Different Inexact Line Search Rule
Manish Kumar Sahu, Suvendu Ranjan Pattanaik, Santosh Kumar Panda
The modified BFGS optimization algorithm is generally used when the objective function is non-convex. In this method, one has to move in a specific direction such that the value of…
math.OC2014
Sufficiency Condition for KKT Points in Non-smooth Analysis
S R Pattanaik
In this article we consider a convex feasible set described by inequality constraints that are continuous and not necessarily Lipschitz or convex. We show that if the Slater constr…
math.OC2011
Optimality Conditions for Bilevel Programming Problem in Asplund Spaces
Suvendu Pattanaik
Here, necessary optimal condition for Optimistic Bilevel programming problem is obtained in Asplund spaces. Also we have got necessary optimal conditions in finite dimensional spac…