Search
Search Results
-
Block-row and block-column iterative algorithms for solving linear matrix equation
Using tools like the Kronecker product and the vector operator, various Sylvester matrix equations can always be converted into the form
... 
-
A review of radial basis function with applications explored
Partial differential equations are a vital component of the study of mathematical models in science and engineering. There are various tools and...
-
Efficient iteration methods for complex systems with an indefinite matrix term
Complex valued systems with an indefinite matrix term arise in important applications such as for certain time-harmonic partial differential...
-
S-Nodes, Factorisation of Spectral Matrix Functions and Corresponding Inequalities
Using factorisation and Arov–Krein inequality results, we derive important inequalities (in terms of S -nodes) in interpolation problems.
-
Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix
This paper studies several solution paths of sparse quadratic minimization problems as a function of the weighing parameter of the bi-objective of...
-
A Semismooth Newton-based Augmented Lagrangian Algorithm for Density Matrix Least Squares Problems
The density matrix least squares problem arises from the quantum state tomography problem in experimental physics and has many applications in signal...
-
Perturbation analysis of the euclidean distance matrix optimization problem and its numerical implications
Euclidean distance matrices have lately received increasing attention in applications such as multidimensional scaling and molecular conformation...
-
Two Harmonic Jacobi–Davidson Methods for Computing a Partial Generalized Singular Value Decomposition of a Large Matrix Pair
Two harmonic extraction based Jacobi–Davidson (JD) type algorithms are proposed to compute a partial generalized singular value decomposition (GSVD)...
-
Proof Methods for Robust Low-Rank Matrix Recovery
Low-rank matrix recovery problems arise naturally as mathematical formulations of various inverse problems, such as matrix completion, blind...
-
Spectral Homogenization Problems in Linear Elasticity: The Averaged Robin Reaction Matrix
We consider a spectral homogenization problem for the elasticity operator posed in a bounded domain of the upper half-space, a part of its boundary...
-
A variant of two-step modulus-based matrix splitting iteration method for Retinex problem
Based on a variational optimization model, and by imposing physical constraints on the reflection value, and deriving deformation of the Retinex...
-
Structured Low-Rank Approximation: Optimization on Matrix Manifold Approach
We deal with the problem to compute the nearest Structured Low-Rank Approximation (SLRA) to a given matrix in this paper. This problem arises in many...
-
Quasi-Energy Function for Morse–Smale 3-Diffeomorphisms with Fixed Points with Pairwise Distinct Indices
AbstractThe present paper is devoted to a lower bound for the number of critical points of the Lyapunov function for Morse–Smale 3-diffeomorphisms...
-
Bayesian Optimization for Function Compositions with Applications to Dynamic Pricing
Bayesian Optimization (BO) is used to find the global optima of black box functions. In this work, we propose a practical BO method of function...
-
-
-
Level constrained first order methods for function constrained optimization
We present a new feasible proximal gradient method for constrained optimization where both the objective and constraint functions are given by...
-
Outer approximation for global optimization of mixed-integer quadratic bilevel problems
Bilevel optimization problems have received a lot of attention in the last years and decades. Besides numerous theoretical developments there also...
-
An efficient modulus-based matrix splitting iteration method for quasi-complementarity problems
In this paper, by transforming the quasi-complementarity problem (QCP) into an equivalent fixed-point format, we develop an efficient modulus-based...
-
Submodular function minimization and polarity
Using polarity, we give an outer polyhedral approximation for the epigraph of set functions. For a submodular function, we prove that the...
