Infine functions and nonsmooth multiobjective optimization problems. - S. Nobakhtian 001 (Comput. Math. Appl., 2006)

Duality without constraint qualification in nonsmooth optimization. - S. Nobakhtian 001 (Int. J. Math. Math. Sci., 2006)

Optimality Criteria and Duality in Multiobjective Programming Involving Nonsmooth Invex Functions. - S. Nobakhtian 001 (J. Glob. Optim., 2006)

Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints. - S. Nobakhtian 001 (J. Glob. Optim., 2008)

Nonsmooth multiobjective continuous-time problems with generalized invexity. - S. Nobakhtian 001 (J. Glob. Optim., 2009)

Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems. - Nader Kanzi; S. Nobakhtian 001 (Eur. J. Oper. Res., 2010)

Convergence conditions for decentralized optimal traffic engineering in connectionless networks. - Dariush Fooladivanda; Massoud Hashemi; Soghra Nobakhtian (IEEE Trans. Commun., 2010)

Convexificators and strong Kuhn-Tucker conditions. - Mohammad Golestani; S. Nobakhtian 001 (Comput. Math. Appl., 2012)

Optimality Conditions and Duality for Nonsmooth Fractional Continuous-Time Problems. - S. Nobakhtian 001; M. R. Pouryayevali (J. Optim. Theory Appl., 2012)

Optimality conditions for nonsmooth semi-infinite multiobjective programming. - Nader Kanzi; S. Nobakhtian 001 (Optim. Lett., 2014)

Sensitivity analysis of the value function for nonsmooth optimization problems. - M. Alavi Hejazi; S. Nobakhtian 001 (Oper. Res. Lett., 2017)

An algorithm for generalized constrained multi-source Weber problem with demand substations. - S. Nobakhtian 001; Ahmadreza Raeisi Dehkordi (4OR, 2018)

On Constraint Qualifications and Sensitivity Analysis for General Optimization Problems via Pseudo-Jacobians. - M. Alavi Hejazi; Nooshin Movahedian; S. Nobakhtian 001 (J. Optim. Theory Appl., 2018)

A fast algorithm for the rectilinear distance location problem. - S. Nobakhtian 001; Ahmadreza Raeisi Dehkordi (Math. Methods Oper. Res., 2018)

A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization. - Najmeh Hoseini Monjezi; S. Nobakhtian 001 (Comput. Optim. Appl., 2019)

Nonsmooth sparsity constrained optimization problems: optimality conditions. - Nooshin Movahedian; S. Nobakhtian 001; M. Sarabadan (Optim. Lett., 2019)

A filter proximal bundle method for nonsmooth nonconvex constrained optimization. - Najmeh Hoseini Monjezi; S. Nobakhtian 001 (J. Glob. Optim., 2021)

An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems. - Najmeh Hoseini Monjezi; S. Nobakhtian 001 (Ann. Oper. Res., 2022)

A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data. - Najmeh Hoseini Monjezi; S. Nobakhtian 001 (Numer. Algorithms, 2022)

Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems. - Najmeh Hoseini Monjezi; S. Nobakhtian 001 (Optim. Lett., 2022)

Observable placement of phasor measurement units for defense against data integrity attacks in real time power markets. - Hamed Badrsimaei; Rahmat-Allah Hooshmand; Soghra Nobakhtian (Reliab. Eng. Syst. Saf., 2023)

New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information. - Najmeh Hoseini Monjezi; S. Nobakhtian 001 (Numer. Algorithms, 2023)

Nonsmooth nonconvex optimization on Riemannian manifolds via bundle trust region algorithm. - Najmeh Hoseini Monjezi; S. Nobakhtian 001; M. R. Pouryayevali (Comput. Optim. Appl., 2024)