Ali Mohammad-Nezhad
Ali Mohammad-Nezhad has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
Tamás Terlaky
Department of Industrial and Systems Engineering, Harold S. Mohler Laboratory, Lehigh University, Bethlehem, PA, USA
4 shared publications- Tamás Terlaky
Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, USA
4 shared publications Hashem Mahlooji
Sharif University of Technology Tehran Iran
2 shared publicationsSaugata Basu
2 shared publicationsAbdolhamid Eshraghniaye Jahromi
1 shared publicationHasan Manzour
1 shared publication
Latest Publications
- Open Access
- 3 December 2024
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Sigma
- Vol. 12, e115
Improved effective Łojasiewicz inequality and applications
Let $\mathrm {R}$ be a real closed field. Given a closed and bounded semialgebraic set $A \subset \mathrm {R}^n$ and semialgebraic continuous functions $f,g:A \rightarrow \mathrm {R}$ such that $f^{-1}(0) \subset g^{-1}(0)$ , there exist an integer $N> 0$ and $c \in \mathrm {R}$ such that the inequality (Łojasiewicz inequality) $|g(x)|^N \le c \cdot |f(x)|$ holds for all $x \in A$ . In this paper, we consider the case when A is defined by a quantifier-free formula with atoms of the form $P = 0, P>0, P \in \mathcal {P}$ for some finite subset of polynomials $\mathcal {P} \subset \mathrm {R}[X_1,\ldots ,X_n]_{\leq d}$ , and the graphs of $f,g$ are also defined by quantifier-free formulas with atoms of the form $Q = 0, Q>0, Q \in \mathcal {Q}$ , for some finite set $\mathcal {Q} \subset \mathrm {R}[X_1,\ldots ,X_n,Y]_{\leq d}$ . We prove that the Łojasiewicz exponent in this case is bounded by $(8 d)^{2(n+7)}$ . Our bound depends on d and n but is independent of the combinatorial parameters, namely the cardinalities of $\mathcal {P}$ and $\mathcal {Q}$ . The previous best-known upper bound in this generality appeared in P. Solernó, Effective Łojasiewicz Inequalities in Semi-Algebraic Geometry, Applicable Algebra in Engineering, Communication and Computing (1991) and depended on the sum of degrees of the polynomials defining $A,f,g$ and thus implicitly on the cardinalities of $\mathcal {P}$ and $\mathcal {Q}$ . As a consequence, we improve the current best error bounds for polynomial systems under some conditions. Finally, we prove a version of Łojasiewicz inequality in polynomially bounded o-minimal structures. We prove the existence of a common upper bound on the Łojasiewicz exponent for certain combinatorially defined infinite (but not necessarily definable) families of pairs of functions. This improves a prior result of Chris Miller (C. Miller, Expansions of the real field with power functions, Ann. Pure Appl. Logic (1994)).- 3 December 2024
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Sigma
- Vol. 12, e115
Open AccessImproved effective Łojasiewicz inequality and applications
Let $\mathrm {R}$ be a real closed field. Given a closed and bounded semialgebraic set $A \subset \mathrm {R}^n$ and semialgebraic continuous functions $f,g:A \rightarrow \mathrm {R}$ such that $f^{-1}(0) \subset g^{-1}(0)$ , there exist an integer $N> 0$ and $c \in \mathrm {R}$ such that the inequality (Łojasiewicz inequality) $|g(x)|^N \le c \cdot |f(x)|$ holds for all $x \in A$ . In this paper, we consider the case when A is defined by a quantifier-free formula with atoms of the form $P = 0, P>0, P \in \mathcal {P}$ for some finite subset of polynomials $\mathcal {P} \subset \mathrm {R}[X_1,\ldots ,X_n]_{\leq d}$ , and the graphs of $f,g$ are also defined by quantifier-free formulas with atoms of the form $Q = 0, Q>0, Q \in \mathcal {Q}$ , for some finite set $\mathcal {Q} \subset \mathrm {R}[X_1,\ldots ,X_n,Y]_{\leq d}$ . We prove that the Łojasiewicz exponent in this case is bounded by $(8 d)^{2(n+7)}$ . Our bound depends on d and n but is independent of the combinatorial parameters, namely the cardinalities of $\mathcal {P}$ and $\mathcal {Q}$ . The previous best-known upper bound in this generality appeared in P. Solernó, Effective Łojasiewicz Inequalities in Semi-Algebraic Geometry, Applicable Algebra in Engineering, Communication and Computing (1991) and depended on the sum of degrees of the polynomials defining $A,f,g$ and thus implicitly on the cardinalities of $\mathcal {P}$ and $\mathcal {Q}$ . As a consequence, we improve the current best error bounds for polynomial systems under some conditions. Finally, we prove a version of Łojasiewicz inequality in polynomially bounded o-minimal structures. We prove the existence of a common upper bound on the Łojasiewicz exponent for certain combinatorially defined infinite (but not necessarily definable) families of pairs of functions. This improves a prior result of Chris Miller (C. Miller, Expansions of the real field with power functions, Ann. Pure Appl. Logic (1994)). - 9 February 2024
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 156
On the complexity of analyticity in semi-definite optimization
- 9 February 2024
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 156
On the complexity of analyticity in semi-definite optimization
- 1 November 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 47 (4) , 2989-3009
On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization
This paper revisits the parametric analysis of semidefinite optimization problems with respect to the perturbation of the objective function along a fixed direction. We review the notions of invariancy set, nonlinearity interval, and transition point of the optimal partition, and we investigate their characterizations. We show that the set of transition points is finite and the continuity of the optimal set mapping, on the basis of Painlevé–Kuratowski set convergence, might fail on a nonlinearity interval. Under a local nonsingularity condition, we then develop a methodology, stemming from numerical algebraic geometry, to efficiently compute nonlinearity intervals and transition points of the optimal partition. Finally, we support the theoretical results by applying our procedure to some numerical examples.
- 1 November 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 47 (4) , 2989-3009
On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization
This paper revisits the parametric analysis of semidefinite optimization problems with respect to the perturbation of the objective function along a fixed direction. We review the notions of invariancy set, nonlinearity interval, and transition point of the optimal partition, and we investigate their characterizations. We show that the set of transition points is finite and the continuity of the optimal set mapping, on the basis of Painlevé–Kuratowski set convergence, might fail on a nonlinearity interval. Under a local nonsingularity condition, we then develop a methodology, stemming from numerical algebraic geometry, to efficiently compute nonlinearity intervals and transition points of the optimal partition. Finally, we support the theoretical results by applying our procedure to some numerical examples.
- 26 May 2022
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Algebra and Geometry
- Vol. 6 (2) , 299-318
On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate
In this paper, we investigate the complexity of the central path of semidefinite optimization through the lens of real algebraic geometry. To that end, we propose an algorithm to compute real univa...
- 26 May 2022
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Algebra and Geometry
- Vol. 6 (2) , 299-318
On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate
In this paper, we investigate the complexity of the central path of semidefinite optimization through the lens of real algebraic geometry. To that end, we propose an algorithm to compute real univa...
- 18 August 2021
- Published by Springer Nature in Mathematical Programming
- Vol. 189 (1-2) , 491-525
On the sensitivity of the optimal partition for parametric second-order conic optimization
- 18 August 2021
- Published by Springer Nature in Mathematical Programming
- Vol. 189 (1-2) , 491-525
On the sensitivity of the optimal partition for parametric second-order conic optimization
- Open Access
On the sensitivity of the optimal partition for parametric second-order conic optimization
In this paper, using an optimal partition approach, we study the parametric analysis of a second-order conic optimization problem, where the objective function is perturbed along a fixed direction. We characterize the notions of so-called invariancy set and nonlinearity interval, which serve as stability regions of the optimal partition. We then propose, under the strict complementarity condition, an iterative procedure to compute a nonlinearity interval of the optimal partition. Furthermore, under primal and dual nondegeneracy conditions, we show that a boundary point of a nonlinearity interval can be numerically identified from a nonlinear reformulation of the parametric second-order conic optimization problem. Our theoretical results are supported by numerical experiments.
Open AccessOn the sensitivity of the optimal partition for parametric second-order conic optimization
In this paper, using an optimal partition approach, we study the parametric analysis of a second-order conic optimization problem, where the objective function is perturbed along a fixed direction. We characterize the notions of so-called invariancy set and nonlinearity interval, which serve as stability regions of the optimal partition. We then propose, under the strict complementarity condition, an iterative procedure to compute a nonlinearity interval of the optimal partition. Furthermore, under primal and dual nondegeneracy conditions, we show that a boundary point of a nonlinearity interval can be numerically identified from a nonlinear reformulation of the parametric second-order conic optimization problem. Our theoretical results are supported by numerical experiments.
- 3 November 2019
- Published by Taylor & Francis in Optimization
- Vol. 69 (1) , 187-216
Parametric analysis of semidefinite optimization
In this paper, we study parametric analysis of semidefinite optimization problems w.r.t. the perturbation of the objective function. We study the behaviour of the optimal partition and optimal set mapping on a so-called nonlinearity interval. Furthermore, we investigate the sensitivity of the approximation of the optimal partition in a nonlinearity interval, which has been recently studied by Mohammad-Nezhad and Terlaky. The approximation of the optimal partition was obtained from a bounded sequence of interior solutions on, or in a neighbourhood of the central path. We derive an upper bound on the distance between the approximations of the optimal partitions of the original and perturbed problems. Finally, we examine the theoretical bounds by way of experimentation.
- 3 November 2019
- Published by Taylor & Francis in Optimization
- Vol. 69 (1) , 187-216
Parametric analysis of semidefinite optimization
In this paper, we study parametric analysis of semidefinite optimization problems w.r.t. the perturbation of the objective function. We study the behaviour of the optimal partition and optimal set mapping on a so-called nonlinearity interval. Furthermore, we investigate the sensitivity of the approximation of the optimal partition in a nonlinearity interval, which has been recently studied by Mohammad-Nezhad and Terlaky. The approximation of the optimal partition was obtained from a bounded sequence of interior solutions on, or in a neighbourhood of the central path. We derive an upper bound on the distance between the approximations of the optimal partitions of the original and perturbed problems. Finally, we examine the theoretical bounds by way of experimentation.
- Open Access
Parametric analysis of semidefinite optimization
In this paper, we study parametric analysis of semidefinite optimization problems w.r.t. the perturbation of the objective function. We study the behavior of the optimal partition and optimal set mapping on a so-called nonlinearity interval. Furthermore, we investigate the sensitivity of the approximation of the optimal partition in a nonlinearity interval, which has been recently studied by Mohammad-Nezhad and Terlaky. The approximation of the optimal partition was obtained from a bounded sequence of interior solutions on, or in a neighborhood of the central path. We derive an upper bound on the distance between the approximations of the optimal partitions of the original and perturbed problems. Finally, we examine the theoretical bounds by way of experimentation.
Open AccessParametric analysis of semidefinite optimization
In this paper, we study parametric analysis of semidefinite optimization problems w.r.t. the perturbation of the objective function. We study the behavior of the optimal partition and optimal set mapping on a so-called nonlinearity interval. Furthermore, we investigate the sensitivity of the approximation of the optimal partition in a nonlinearity interval, which has been recently studied by Mohammad-Nezhad and Terlaky. The approximation of the optimal partition was obtained from a bounded sequence of interior solutions on, or in a neighborhood of the central path. We derive an upper bound on the distance between the approximations of the optimal partitions of the original and perturbed problems. Finally, we examine the theoretical bounds by way of experimentation.
- 5 March 2019
- Published by Taylor & Francis in INFOR: Information Systems and Operational Research
- Vol. 58 (2) , 225-263
On the identification of the optimal partition for semidefinite optimization
The concept of the optimal partition was originally introduced for linear optimization and linear complementarity problems and subsequently extended to semidefinite optimization. For linear optimization and sufficient linear complementarity problems, from a central solution sufficiently close to the optimal set, the optimal partition and a maximally complementary optimal solution can be identified in strongly polynomial time. In this paper, we consider the identification of the optimal partition of semidefinite optimization, for which we provide an approximation from a bounded sequence of solutions on, or in a neighbourhood of the central path. Using bounds on the magnitude of the eigenvalues, we identify the subsets of eigenvectors of the interior solutions whose accumulation points are orthonormal bases for the subspaces of the optimal partition. The magnitude of the eigenvalues of an interior solution is quantified using a condition number and an upper bound on the distance of an interior solution to the optimal set. We provide a measure of proximity of the approximation obtained from the central solutions to the true optimal partition of the problem.
- 5 March 2019
- Published by Taylor & Francis in INFOR: Information Systems and Operational Research
- Vol. 58 (2) , 225-263
On the identification of the optimal partition for semidefinite optimization
The concept of the optimal partition was originally introduced for linear optimization and linear complementarity problems and subsequently extended to semidefinite optimization. For linear optimization and sufficient linear complementarity problems, from a central solution sufficiently close to the optimal set, the optimal partition and a maximally complementary optimal solution can be identified in strongly polynomial time. In this paper, we consider the identification of the optimal partition of semidefinite optimization, for which we provide an approximation from a bounded sequence of solutions on, or in a neighbourhood of the central path. Using bounds on the magnitude of the eigenvalues, we identify the subsets of eigenvectors of the interior solutions whose accumulation points are orthonormal bases for the subspaces of the optimal partition. The magnitude of the eigenvalues of an interior solution is quantified using a condition number and an upper bound on the distance of an interior solution to the optimal set. We provide a measure of proximity of the approximation obtained from the central solutions to the true optimal partition of the problem.
- 1 January 2019
- Published by Elsevier in Operations Research Letters
- Vol. 47 (1) , 59-65
A rounding procedure for semidefinite optimization
- 1 January 2019
- Published by Elsevier in Operations Research Letters
- Vol. 47 (1) , 59-65
A rounding procedure for semidefinite optimization