Suchergebnisse - Numerical Linear Algorithms and Problems

Cost‐efficient numerical algorithm for solving the linear inverse problem of finding a variable magnetization von Akimova, Elena N., Martyshko, Petr S., Misilov, Vladimir E., Miftakhov, Valeriy O.

“… The paper is devoted to developing an original cost‐efficient algorithm for solving the inverse problem of finding a variable magnetization in a rectangular parallelepiped. The problem is ill …”
Volltext

An accelerating outer space algorithm for globally solving generalized linear multiplicative problems von Hou, Zhisong, Liu, Sanyang

“… This paper proposes an accelerating outer space algorithm for globally solving generalized linear multiplicative problems (GLMP …”
Volltext

A criterion space algorithm for solving linear multiplicative programming problems von Shen, Peiping, Deng, Yaping, Wu, Dianxiao

“… In this paper, we develop a branch and bound algorithm for globally solving linear multiplicative programs (LMP …”
Volltext

Optimization algorithms on matrix manifolds von Absil, P.A, Absil, P.A, Mahony,R, Sepulchre,R

“… This book shows how to exploit the special structure of such problems to develop efficient numerical algorithms …”
Volltext

A predictor-corrector interior-point algorithm for P∗(κ)-horizontal linear complementarity problem von Kheirfam, Behrouz

“… We present a predictor-corrector path-following interior-point algorithm for P ∗ ( κ ) horizontal linear complementarity problem based on new search directions …”
Volltext

Numerical algorithm with fifth‐order accuracy for axisymmetric Laplace equation with linear boundary value problem von Li, Hu, Huang, Jin

“… In order to obtain the numerical solutions of the axisymmetric Laplace equation with linear boundary problem in three dimensions, we have developed a quadrature method to solve the problem …”
Volltext

Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems von Ke, Yi-Fen

“… In this paper, we present some novel observations for the semidefinite linear complementarity problems, abbreviated as SDLCPs …”
Volltext

A modulus-based formulation for the vertical linear complementarity problem von Mezzadri, Francesco

“… We introduce a modulus-based formulation for vertical linear complementarity problems (VLCPs …”
Volltext

The effect of the step-size on the numerical behavior of a primal-dual interior-point algorithm applied to P(κ) linear complementary problem von Chenouf, Chahinez, Kebbiche, Zakia

“… )-Linear complementarity problem based on two new kernel functions. The numerical behavior of the primal-dual interior-point algorithm is shown to be improved with these step-size choices …”
Volltext

A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem von Peiping, Shen, Yafei, Wang, Dianxiao, Wu

“… Using the resulting second-order cone program (SOCP), we design a spatial branch and bound algorithm, which iteratively refines the piecewise linear approximations by dividing rectangles and solving a series of problems (SOCP …”
Volltext

A sign-based linear method for horizontal linear complementarity problems von Shao, Xin-Hui, Wang, Zhe, Shen, Hai-Long

“… For the horizontal linear complementarity problem, we establish a linear method based on the sign patterns of the solution of the equivalent modulus equation under the assumption of strict complementarity …”
Volltext

Krylov iterative methods for linear least squares problems with linear equality constraints von Li, Haibo

“… We consider the linear least squares problem with linear equality constraints (LSE problem) formulated as $$\varvec{\min }_{x\in \mathbb {R}^{n}}\Vert \varvec …”
Volltext

Numerical Algorithms For State-Linear Optimal Impulsive Control Problems Based On Feedback Necessary Optimality Conditions von Sorokin, Stepan, Staritsyn, Maxim

“… We propose and compare three numeric algorithms for optimal control of state-linear impulsive systems …”
Volltext

Backtracking Search Optimization Algorithm for numerical optimization problems von Civicioglu, Pinar

“… ) for solving real-valued numerical optimization problems. EAs are popular stochastic search algorithms that are widely used to solve non-linear, non-differentiable and complex numerical optimization problems …”
Volltext

Polynomial interior-point algorithm for P horizontal linear complementarity problems von Asadi, S., Mansouri, H.

“… In this paper an interior-point algorithm for P * ( κ ) horizontal linear complementarity problems is proposed that uses new search directions …”
Volltext

Modulus-based matrix splitting methods for horizontal linear complementarity problems von Mezzadri, Francesco, Galligani, Emanuele

“… ) linear complementarity problems. Lastly, we analyze the proposed methods by numerical experiments involving both symmetric and non-symmetric matrices …”
Volltext

Generalized weak Galerkin finite element method for linear elasticity interface problems von Wang, Yue, Gao, Fuzheng

“… A generalized weak Galerkin finite element method for linear elasticity interface problems is presented …”
Volltext

General double-relaxation two-sweep modulus-based matrix splitting iteration methods for horizontal linear complementarity problem von Wang, Dan, Li, Jicheng

“… For solving horizontal linear complementarity problem (HLCP), we propose a general double-relaxation two-sweep modulus-based matrix splitting iteration method …”
Volltext

On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems von Wu, Wen-Ting

“… For solving the large-scale linear least-squares problem, we propose a block version of the randomized extended Kaczmarz method, called the two-subspace randomized extended Kaczmarz method, which does …”
Volltext

Scalable Algorithms for Contact Problems von Dostal, Zdenek, Kozubek, Tomas, Sadowska, Marie, Vondrak, Vit

“… problems of linear elasticity …”
Volltext