default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Nobakhtian 0001
Person information
- affiliation: University of Isfahan, Department of Applied Mathematics and Computer Science, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Najmeh Hoseini Monjezi, S. Nobakhtian, M. R. Pouryayevali
:
Nonsmooth nonconvex optimization on Riemannian manifolds via bundle trust region algorithm. Comput. Optim. Appl. 88(3): 871-902 (2024)- 2023
- [j22]Najmeh Hoseini Monjezi, S. Nobakhtian:
New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information. Numer. Algorithms 94(2): 765-787 (2023) - [j21]Hamed Badrsimaei, Rahmat-Allah Hooshmand, Soghra Nobakhtian:
Observable placement of phasor measurement units for defense against data integrity attacks in real time power markets. Reliab. Eng. Syst. Saf. 230: 108957 (2023) - 2022
- [j20]Najmeh Hoseini Monjezi, S. Nobakhtian:
An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems. Ann. Oper. Res. 311(2): 1123-1154 (2022) - [j19]Najmeh Hoseini Monjezi, S. Nobakhtian:
A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data. Numer. Algorithms 89(2): 637-674 (2022) - [j18]Najmeh Hoseini Monjezi, S. Nobakhtian:
Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems. Optim. Lett. 16(5): 1495-1511 (2022) - 2021
- [j17]Najmeh Hoseini Monjezi, S. Nobakhtian:
A filter proximal bundle method for nonsmooth nonconvex constrained optimization. J. Glob. Optim. 79(1): 1-37 (2021)
2010 – 2019
- 2019
- [j16]Najmeh Hoseini Monjezi, S. Nobakhtian:
A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization. Comput. Optim. Appl. 74(2): 443-480 (2019) - [j15]Nooshin Movahedian, S. Nobakhtian, M. Sarabadan:
Nonsmooth sparsity constrained optimization problems: optimality conditions. Optim. Lett. 13(5): 1027-1038 (2019) - 2018
- [j14]S. Nobakhtian, Ahmadreza Raeisi Dehkordi:
An algorithm for generalized constrained multi-source Weber problem with demand substations. 4OR 16(4): 343-377 (2018) - [j13]M. Alavi Hejazi, Nooshin Movahedian, S. Nobakhtian:
On Constraint Qualifications and Sensitivity Analysis for General Optimization Problems via Pseudo-Jacobians. J. Optim. Theory Appl. 179(3): 778-799 (2018) - [j12]S. Nobakhtian, Ahmadreza Raeisi Dehkordi:
A fast algorithm for the rectilinear distance location problem. Math. Methods Oper. Res. 88(1): 81-98 (2018) - 2017
- [j11]M. Alavi Hejazi, S. Nobakhtian:
Sensitivity analysis of the value function for nonsmooth optimization problems. Oper. Res. Lett. 45(4): 348-352 (2017) - 2014
- [j10]Nader Kanzi, S. Nobakhtian:
Optimality conditions for nonsmooth semi-infinite multiobjective programming. Optim. Lett. 8(4): 1517-1528 (2014) - 2012
- [j9]Mohammad Golestani, S. Nobakhtian:
Convexificators and strong Kuhn-Tucker conditions. Comput. Math. Appl. 64(4): 550-557 (2012) - [j8]S. Nobakhtian, M. R. Pouryayevali:
Optimality Conditions and Duality for Nonsmooth Fractional Continuous-Time Problems. J. Optim. Theory Appl. 152(1): 245-255 (2012) - 2010
- [j7]Nader Kanzi, S. Nobakhtian:
Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems. Eur. J. Oper. Res. 205(2): 253-261 (2010) - [j6]Dariush Fooladivanda, Massoud Hashemi, Soghra Nobakhtian:
Convergence conditions for decentralized optimal traffic engineering in connectionless networks. IEEE Trans. Commun. 58(5): 1333-1337 (2010)
2000 – 2009
- 2009
- [j5]S. Nobakhtian:
Nonsmooth multiobjective continuous-time problems with generalized invexity. J. Glob. Optim. 43(4): 593-606 (2009) - 2008
- [j4]S. Nobakhtian:
Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints. J. Glob. Optim. 41(1): 103-115 (2008) - 2006
- [j3]S. Nobakhtian:
Infine functions and nonsmooth multiobjective optimization problems. Comput. Math. Appl. 51(9-10): 1385-1394 (2006) - [j2]S. Nobakhtian:
Duality without constraint qualification in nonsmooth optimization. Int. J. Math. Math. Sci. 2006: 30459:1-30459:11 (2006) - [j1]S. Nobakhtian:
Optimality Criteria and Duality in Multiobjective Programming Involving Nonsmooth Invex Functions. J. Glob. Optim. 35(4): 593-606 (2006)
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-07-05 21:03 CEST 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:
