Search Results - Numerical Linear Algorithms and Problems

Refine Results
  1. 1

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

    ISSN: 0170-4214, 1099-1476
    Published: Freiburg Wiley Subscription Services, Inc 15.09.2020
    “…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…”
    Get full text
    Journal Article
  2. 2

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

    ISSN: 1017-1398, 1572-9265
    Published: New York Springer US 01.10.2023
    Published in Numerical algorithms (01.10.2023)
    “…This paper proposes an accelerating outer space algorithm for globally solving generalized linear multiplicative problems (GLMP…”
    Get full text
    Journal Article
  3. 3

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

    ISSN: 1017-1398, 1572-9265
    Published: New York Springer US 01.08.2024
    Published in Numerical algorithms (01.08.2024)
    “…In this paper, we develop a branch and bound algorithm for globally solving linear multiplicative programs (LMP…”
    Get full text
    Journal Article
  4. 4

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

    ISBN: 9780691132983, 0691132984, 1400830249, 9781400830244
    Published: Princeton Princeton University Press 2008
    “… This book shows how to exploit the special structure of such problems to develop efficient numerical algorithms…”
    Get full text
    eBook Book
  5. 5

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

    ISSN: 1017-1398, 1572-9265
    Published: Boston Springer US 01.06.2014
    Published in Numerical algorithms (01.06.2014)
    “…We present a predictor-corrector path-following interior-point algorithm for P ∗ ( κ ) horizontal linear complementarity problem based on new search directions…”
    Get full text
    Journal Article
  6. 6

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

    ISSN: 0749-159X, 1098-2426
    Published: Hoboken, USA John Wiley & Sons, Inc 01.05.2024
    “…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…”
    Get full text
    Journal Article
  7. 7

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

    ISSN: 1017-1398, 1572-9265
    Published: New York Springer US 01.01.2021
    Published in Numerical algorithms (01.01.2021)
    “…In this paper, we present some novel observations for the semidefinite linear complementarity problems, abbreviated as SDLCPs…”
    Get full text
    Journal Article
  8. 8

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

    ISSN: 1017-1398, 1572-9265
    Published: New York Springer US 01.08.2022
    Published in Numerical algorithms (01.08.2022)
    “…We introduce a modulus-based formulation for vertical linear complementarity problems (VLCPs…”
    Get full text
    Journal Article
  9. 9

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

    ISSN: 2065-2151, 2065-216X
    Published: Brasov Transilvania University of Brasov 2020
    “…)-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…”
    Get full text
    Journal Article
  10. 10

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

    ISSN: 1017-1398, 1572-9265
    Published: New York Springer US 01.07.2023
    Published in Numerical algorithms (01.07.2023)
    “… 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…”
    Get full text
    Journal Article
  11. 11

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

    ISSN: 1017-1398, 1572-9265
    Published: New York Springer US 01.11.2022
    Published in Numerical algorithms (01.11.2022)
    “…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…”
    Get full text
    Journal Article
  12. 12

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

    ISSN: 1017-1398, 1572-9265
    Published: 09.08.2025
    Published in Numerical algorithms (09.08.2025)
    “…We consider the linear least squares problem with linear equality constraints (LSE problem) formulated as $$\varvec{\min }_{x\in \mathbb {R}^{n}}\Vert \varvec…”
    Get full text
    Journal Article
  13. 13

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

    ISSN: 2223-7038, 2226-4116
    Published: 30.11.2020
    Published in Cybernetics and physics (30.11.2020)
    “…We propose and compare three numeric algorithms for optimal control of state-linear impulsive systems…”
    Get full text
    Journal Article
  14. 14

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

    ISSN: 0096-3003, 1873-5649
    Published: Elsevier Inc 01.04.2013
    Published in Applied mathematics and computation (01.04.2013)
    “…) 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…”
    Get full text
    Journal Article
  15. 15

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

    ISSN: 1017-1398, 1572-9265
    Published: Boston Springer US 01.06.2013
    Published in Numerical algorithms (01.06.2013)
    “…In this paper an interior-point algorithm for P * ( κ ) horizontal linear complementarity problems is proposed that uses new search directions…”
    Get full text
    Journal Article
  16. 16

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

    ISSN: 1017-1398, 1572-9265
    Published: New York Springer US 01.01.2020
    Published in Numerical algorithms (01.01.2020)
    “…) linear complementarity problems. Lastly, we analyze the proposed methods by numerical experiments involving both symmetric and non-symmetric matrices…”
    Get full text
    Journal Article
  17. 17

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

    ISSN: 1017-1398, 1572-9265
    Published: New York Springer US 01.06.2025
    Published in Numerical algorithms (01.06.2025)
    “…A generalized weak Galerkin finite element method for linear elasticity interface problems is presented…”
    Get full text
    Journal Article
  18. 18

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

    ISSN: 1017-1398, 1572-9265
    Published: New York Springer US 01.04.2025
    Published in Numerical algorithms (01.04.2025)
    “…For solving horizontal linear complementarity problem (HLCP), we propose a general double-relaxation two-sweep modulus-based matrix splitting iteration method…”
    Get full text
    Journal Article
  19. 19

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

    ISSN: 1017-1398, 1572-9265
    Published: New York Springer US 01.01.2022
    Published in Numerical algorithms (01.01.2022)
    “…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…”
    Get full text
    Journal Article
  20. 20

    Evolutionary derivation of Runge–Kutta pairs for addressing inhomogeneous linear problems by Simos, T. E., Tsitouras, Ch

    ISSN: 1017-1398, 1572-9265
    Published: New York Springer US 01.06.2021
    Published in Numerical algorithms (01.06.2021)
    “…Two new Runge–Kutta (RK) pairs of orders 6(4) and 7(5) are presented for solving numerically the inhomogeneous linear initial value problems with constant coefficients…”
    Get full text
    Journal Article