All Issues

Volume 12, 2022

Volume 11, 2021

Volume 10, 2020

Volume 9, 2019

Volume 8, 2018

Volume 7, 2017

Volume 6, 2016

Volume 5, 2015

Volume 4, 2014

Volume 3, 2013

Volume 2, 2012

Volume 1, 2011

Numerical Algebra, Control and Optimization

December 2018 , Volume 8 , Issue 4

Select all articles


A projected preconditioned conjugate gradient method for the linear response eigenvalue problem
Xing Li, Chungen Shen and Lei-Hong Zhang
2018, 8(4): 389-412 doi: 10.3934/naco.2018025 +[Abstract](5525) +[HTML](501) +[PDF](474.37KB)

The linear response eigenvalue problem aims at computing a few smallest positive eigenvalues together with the associated eigenvectors of a special Hamiltonian matrix and plays an important role for estimating the excited states of physical systems. A subspace version of the Thouless minimization principle was established by Bai and Li (SIAM J. Matrix Anal. Appl., 33:1075-1100, 2012) which characterizes the desired eigenpairs as its solution. In this paper, we propose a Projected Preconditioned Conjugate Gradient (\begin{document}$\texttt{PPCG_lrep}$\end{document}) method to solve this subspace version of Thouless's minimization directly. We show that \begin{document}$\texttt{PPCG_lrep}$\end{document} is an efficient implementation of the inverse power iteration and can be performed in parallel. It also enjoys several properties including the monotonicity and constraint preservation in the Thouless minimization principle. Convergence of both eigenvalues and eigenvectors are established and numerical experiences on various problems are reported.

Optimization problems with orthogonal matrix constraints
K. T. Arasu and Manil T. Mohan
2018, 8(4): 413-440 doi: 10.3934/naco.2018026 +[Abstract](10083) +[HTML](1244) +[PDF](716.28KB)

The optimization problems involving orthogonal matrices have been formulated in this work. A lower bound for the number of stationary points of such optimization problems is found and its connection to the number of possible partitions of natural numbers is also established. We obtained local and global optima of such problems for different orders and showed their connection with the Hadamard, conference and weighing matrices. The application of general theory to some concrete examples including maximization of Shannon, Rény, Tsallis and Sharma-Mittal entropies for orthogonal matrices, minimum distance orthostochastic matrices to uniform van der Waerden matrices, Cressie-Read and K-divergence functions for orthogonal matrices, etc are also discussed. Global optima for all orders has been found for the optimization problems involving unitary matrix constraints.

On the cyclic pseudomonotonicity and the proximal point algorithm
Hadi Khatibzadeh, Vahid Mohebbi and Mohammad Hossein Alizadeh
2018, 8(4): 441-449 doi: 10.3934/naco.2018027 +[Abstract](4458) +[HTML](413) +[PDF](264.45KB)

We introduce various versions of cyclic pseudomonotonicity and study the relations between them. Some examples about the relation between them and monotonicity are also presented. By imposing some assumptions on the cyclic pseudomonotone bifunctions, we study the convergence analysis of the proximal point algorithm which has been studied by Iusem and Sosa [5] for pseudomonotone bifunctions, with better assumptions.

Quantitative stability analysis of stochastic mathematical programs with vertical complementarity constraints
Yongchao Liu
2018, 8(4): 451-460 doi: 10.3934/naco.2018028 +[Abstract](4266) +[HTML](461) +[PDF](311.16KB)

This paper studies the quantitative stability of stochastic mathematical programs with vertical complementarity constraints (SMPVCC) with respect to the perturbation of the underlying probability distribution. We first show under moderate conditions that the optimal solution set-mapping is outer semiconitnuous and optimal value function is Lipschitz continuous with respect to the probability distribution. We then move on to investigate the outer semiconitnuous of the M-stationary points by employing the reformulation of stationary points and some stability results on the stochastic generalized equations. The particular focus is given to discrete approximation of probability distributions, where both cases that the sample is chosen in a fixed procedure and random procedure are considered. The technical results lay a theoretical foundation for approximation schemes to be applied to solve SMPVCC.

Weighted vertices optimizer (WVO): A novel metaheuristic optimization algorithm
Soheil Dolatabadi
2018, 8(4): 461-479 doi: 10.3934/naco.2018029 +[Abstract](5912) +[HTML](569) +[PDF](908.28KB)

This paper introduces a novel optimization algorithm that is based on the basic idea underlying the bisection root-finding method in mathematics. The bisection method is modified for use as an optimizer by weighting each agent or vertex, and the algorithm developed from this process is called the weighted vertices optimizer (WVO). For exploitation and exploration, both swarm intelligence and evolution strategy are used to improve the accuracy and speed of WVO, which is then compared with six other popular optimization algorithms. Results confirm the superiority of WVO in most of the test functions.

A stochastic approach to model housing markets: The US housing market case
Bilgi Yilmaz and A. Sevtap Selcuk-Kestel
2018, 8(4): 481-492 doi: 10.3934/naco.2018030 +[Abstract](6174) +[HTML](733) +[PDF](575.18KB)

This study aims to estimate the price changes in housing markets using a stochastic process, which is defined in the form of stochastic differential equations (SDEs). It proposes a general SDEs system on the price structure in terms of house price index and mortgage rate to establish an effective process. As an empirical analysis, it applies a calibration procedure to an SDE on monthly S&P/Case-Shiller US National Home Price Index (HPI) and 30-year fixed mortgage rate to estimate parameters of differentiable functions defined in SDEs. The prediction power of the proposed stochastic model is justified through a Monte Carlo algorithm for one-year ahead monthly forecasts of the HPI returns. The results of the study show that the stochastic processes are flexible in terms of the choice of structure, compact with respect to the number of exogenous variables involved, and it is a literal method. Furthermore, this approach has a relatively high estimation power in forecasting the national house prices.

Further results on the perturbation estimations for the Drazin inverse
Haifeng Ma and Xiaoshuang Gao
2018, 8(4): 493-503 doi: 10.3934/naco.2018031 +[Abstract](3908) +[HTML](483) +[PDF](298.84KB)

For \begin{document}$n× n$\end{document} complex singular matrix \begin{document}$A$\end{document} with ind\begin{document}$(A) = k>1$\end{document}, let \begin{document}$A^D$\end{document} be the Drazin inverse of \begin{document}$A$\end{document}. If a matrix \begin{document}$B = A+E$ \end{document} with ind\begin{document}$(B) = 1$ \end{document} is said to be an acute perturbation of \begin{document}$A$ \end{document}, if \begin{document}$\|E\|$ \end{document} is small and the spectral radius of \begin{document}$B_gB- A^DA$ \end{document} satisfies

where \begin{document}$B_g$ \end{document} is the group inverse of \begin{document}$B$ \end{document}.

The acute perturbation coincides with the stable perturbation of the group inverse, if the matrix \begin{document}$B$ \end{document} satisfies geometrical condition:

which introduced by Vélez-Cerrada, Robles, and Castro-González, (Error bounds for the perturbation of the Drazin inverse under some geometrical conditions, Appl. Math. Comput., 215 (2009), 2154-2161).

Furthermore, two examples are provided to illustrate the acute perturbation of the Drazin inverse. We prove the correctness of the conjecture in a special case of ind\begin{document}$(B) = 1$ \end{document} by Wei (Acute perturbation of the group inverse, Linear Algebra Appl., 534 (2017), 135-157).

2021 CiteScore: 1.9




Special Issues

Email Alert

[Back to Top]