default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBalendu Bhooshan Upadhyay
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Balendu Bhooshan Upadhyay
, Arnav Ghosh, Ioan M. Stancu-Minasian:
Second-Order Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Problems on Hadamard Manifolds. Asia Pac. J. Oper. Res. 41(2): 2350019:1-2350019:26 (2024)- [j11]Balendu Bhooshan Upadhyay, Ioan M. Stancu-Minasian, Subham Poddar, Priyanka Mishra:
On Approximate Variational Inequalities and Bilevel Programming Problems. Axioms 13(6): 371 (2024) - [j10]Balendu Bhooshan Upadhyay, Shivani Sain, Ioan M. Stancu-Minasian:
Lagrange Duality and Saddle-Point Optimality Conditions for Nonsmooth Interval-Valued Multiobjective Semi-Infinite Programming Problems with Vanishing Constraints. Axioms 13(9): 573 (2024) - [j9]Balendu Bhooshan Upadhyay, Rupesh K. Pandey, Shengda Zeng:
A generalization of generalized Hukuhara Newton's method for interval-valued multiobjective optimization problems. Fuzzy Sets Syst. 492: 109066 (2024) - [j8]Balendu Bhooshan Upadhyay, Rupesh K. Pandey, Jinlan Pan, Shengda Zeng:
Quasi-Newton algorithms for solving interval-valued multiobjective optimization problems by using their certain equivalence. J. Comput. Appl. Math. 438: 115550 (2024) - [j7]Balendu Bhooshan Upadhyay, Arnav Ghosh, Savin Treanta:
Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds. J. Glob. Optim. 89(3): 723-744 (2024) - [j6]Balendu Bhooshan Upadhyay, Arnav Ghosh, Savin Treanta:
Constraint Qualifications and Optimality Criteria for Nonsmooth Multiobjective Programming Problems on Hadamard Manifolds. J. Optim. Theory Appl. 200(2): 794-819 (2024) - 2023
- [j5]Balendu Bhooshan Upadhyay, Arnav Ghosh:
On Constraint Qualifications for Mathematical Programming Problems with Vanishing Constraints on Hadamard Manifolds. J. Optim. Theory Appl. 199(1): 1-35 (2023) - [j4]Zahra Jafariani, Nader Kanzi, Maryam Naderi Parizi, Balendu Bhooshan Upadhyay:
On Frèchet normal cone for nonsmooth mathematical programming problems with switching constraints. RAIRO Oper. Res. 57(5): 2721-2734 (2023) - 2022
- [j3]Balendu Bhooshan Upadhyay, Arnav Ghosh, Priyanka Mishra, Savin Treanta:
Optimality conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds using generalized geodesic convexity. RAIRO Oper. Res. 56(4): 2037-2065 (2022)
2010 – 2019
- 2019
- [c1]Balendu Bhooshan Upadhyay, Priyanka Mishra, Ram N. Mohapatra, Shashi Kant Mishra:
On the Applications of Nonsmooth Vector Optimization Problems to Solve Generalized Vector Variational Inequalities Using Convexificators. WCGO 2019: 660-671 - 2015
- [j2]Balendu Bhooshan Upadhyay, Shashi Kant Mishra:
Nonsmooth semi-infinite minmax programming involving generalized (Φ, ρ)-invexity. J. Syst. Sci. Complex. 28(4): 857-875 (2015) - 2014
- [j1]Shashi Kant Mishra, Balendu Bhooshan Upadhyay, Le Thi Hoai An:
Lagrange Multiplier Characterizations of Solution Sets of Constrained Nonsmooth Pseudolinear Optimization Problems. J. Optim. Theory Appl. 160(3): 763-777 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
