5 papers
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…
Sum of two maximal monotone operators in a general Banach space is maximal
S. R. Pattanaik, D. K. Pradhan, S. Pradhan
In a real Banach space, we first prove that the sum of a monotone operator of type (FPV) and maximal monotone operator Rockafellar's constraint qualification is maximal. This prove…
Maximality of the sum of the monotone operator of type (FPV) and a maximal monotone operator
S. R. Pattanaik, D. K. Pradhan
Here, question raised by Borwein and Yao has been settled by establishing that the sum of two maximal monotone operators A and B is maximal monotone with the condition that A is of…
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…
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…