S. Nobakhtian

Orcid: 0000-0003-2488-7892

Affiliations:
  • University of Isfahan, Department of Applied Mathematics and Computer Science, Iran


According to our database1, S. Nobakhtian authored at least 23 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Nonsmooth nonconvex optimization on Riemannian manifolds via bundle trust region algorithm.
Comput. Optim. Appl., July, 2024

2023
New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information.
Numer. Algorithms, October, 2023

Observable placement of phasor measurement units for defense against data integrity attacks in real time power markets.
Reliab. Eng. Syst. Saf., 2023

2022
Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems.
Optim. Lett., 2022

A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data.
Numer. Algorithms, 2022

An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems.
Ann. Oper. Res., 2022

2021
A filter proximal bundle method for nonsmooth nonconvex constrained optimization.
J. Glob. Optim., 2021

2019
Nonsmooth sparsity constrained optimization problems: optimality conditions.
Optim. Lett., 2019

A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization.
Comput. Optim. Appl., 2019

2018
A fast algorithm for the rectilinear distance location problem.
Math. Methods Oper. Res., 2018

On Constraint Qualifications and Sensitivity Analysis for General Optimization Problems via Pseudo-Jacobians.
J. Optim. Theory Appl., 2018

An algorithm for generalized constrained multi-source Weber problem with demand substations.
4OR, 2018

2017
Sensitivity analysis of the value function for nonsmooth optimization problems.
Oper. Res. Lett., 2017

2014
Optimality conditions for nonsmooth semi-infinite multiobjective programming.
Optim. Lett., 2014

2012
Optimality Conditions and Duality for Nonsmooth Fractional Continuous-Time Problems.
J. Optim. Theory Appl., 2012

Convexificators and strong Kuhn-Tucker conditions.
Comput. Math. Appl., 2012

2010
Convergence conditions for decentralized optimal traffic engineering in connectionless networks.
IEEE Trans. Commun., 2010

Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems.
Eur. J. Oper. Res., 2010

2009
Nonsmooth multiobjective continuous-time problems with generalized invexity.
J. Glob. Optim., 2009

2008
Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints.
J. Glob. Optim., 2008

2006
Optimality Criteria and Duality in Multiobjective Programming Involving Nonsmooth Invex Functions.
J. Glob. Optim., 2006

Duality without constraint qualification in nonsmooth optimization.
Int. J. Math. Math. Sci., 2006

Infine functions and nonsmooth multiobjective optimization problems.
Comput. Math. Appl., 2006


  Loading...